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.r488-tall-171631132900529.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 DoubleExponent-PT-002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900529
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 33K 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 DoubleExponent-PT-002-CTLCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-06
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-07
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-08
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2023-12
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2023-13
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2023-14
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717193610124

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:13:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:13:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:13:31] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2024-05-31 22:13:31] [INFO ] Transformed 110 places.
[2024-05-31 22:13:31] [INFO ] Transformed 98 transitions.
[2024-05-31 22:13:31] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 75 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 98
Applied a total of 2 rules in 27 ms. Remains 108 /110 variables (removed 2) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 108 cols
[2024-05-31 22:13:31] [INFO ] Computed 12 invariants in 12 ms
[2024-05-31 22:13:31] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-31 22:13:31] [INFO ] Invariant cache hit.
[2024-05-31 22:13:31] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-31 22:13:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 2/107 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-31 22:13:32] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 13 ms to minimize.
[2024-05-31 22:13:32] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:13:32] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:13:32] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:13:32] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:13:32] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:13:33] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:13:33] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:13:33] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 2 ms to minimize.
[2024-05-31 22:13:33] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-31 22:13:33] [INFO ] Deduced a trap composed of 61 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:13:33] [INFO ] Deduced a trap composed of 69 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:13:33] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:13:33] [INFO ] Deduced a trap composed of 69 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:13:33] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/205 variables, 107/134 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/206 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-31 22:13:35] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:13:35] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:13:35] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 138 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5054 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 2/107 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 98/205 variables, 107/137 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 95/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/206 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-31 22:13:40] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 236 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7054 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 19/19 constraints]
After SMT, in 12164ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 12197ms
Starting structural reductions in LTL mode, iteration 1 : 108/110 places, 98/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12557 ms. Remains : 108/110 places, 98/98 transitions.
Support contains 75 out of 108 places after structural reductions.
[2024-05-31 22:13:44] [INFO ] Flatten gal took : 42 ms
[2024-05-31 22:13:44] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:13:44] [INFO ] Input system was already deterministic with 98 transitions.
RANDOM walk for 40000 steps (1339 resets) in 1802 ms. (22 steps per ms) remains 39/68 properties
BEST_FIRST walk for 4000 steps (111 resets) in 139 ms. (28 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (111 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (109 resets) in 51 ms. (76 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (112 resets) in 84 ms. (47 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (112 resets) in 39 ms. (100 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (109 resets) in 38 ms. (102 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (117 resets) in 48 ms. (81 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (114 resets) in 37 ms. (105 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (113 resets) in 44 ms. (88 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (111 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (110 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (111 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (140 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (107 resets) in 22 ms. (173 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (109 resets) in 22 ms. (173 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (109 resets) in 22 ms. (173 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (118 resets) in 35 ms. (111 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (111 resets) in 39 ms. (100 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (113 resets) in 33 ms. (117 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (115 resets) in 37 ms. (105 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (108 resets) in 33 ms. (117 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (115 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (115 resets) in 40 ms. (97 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (114 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (109 resets) in 33 ms. (117 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (110 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (113 resets) in 33 ms. (117 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (115 resets) in 47 ms. (83 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (114 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (107 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (120 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (112 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (108 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (109 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (109 resets) in 35 ms. (111 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (117 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (115 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (114 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (108 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
[2024-05-31 22:13:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 1 (OVERLAPS) 54/101 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 31 unsolved
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/7 constraints. Problems are: Problem set: 10 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 29 unsolved
Problem AtomicPropp32 is UNSAT
At refinement iteration 4 (OVERLAPS) 6/107 variables, 5/12 constraints. Problems are: Problem set: 11 solved, 28 unsolved
[2024-05-31 22:13:45] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:13:45] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:13:45] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 3/15 constraints. Problems are: Problem set: 11 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 11 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 98/205 variables, 107/122 constraints. Problems are: Problem set: 11 solved, 28 unsolved
[2024-05-31 22:13:46] [INFO ] Deduced a trap composed of 56 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:13:46] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:13:46] [INFO ] Deduced a trap composed of 64 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:13:46] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:13:46] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:13:46] [INFO ] Deduced a trap composed of 54 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 6/128 constraints. Problems are: Problem set: 11 solved, 28 unsolved
[2024-05-31 22:13:46] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 1/129 constraints. Problems are: Problem set: 11 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/129 constraints. Problems are: Problem set: 11 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 1/206 variables, 1/130 constraints. Problems are: Problem set: 11 solved, 28 unsolved
[2024-05-31 22:13:46] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 1/131 constraints. Problems are: Problem set: 11 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/131 constraints. Problems are: Problem set: 11 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 0/206 variables, 0/131 constraints. Problems are: Problem set: 11 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 131 constraints, problems are : Problem set: 11 solved, 28 unsolved in 1675 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 11 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 28 unsolved
Problem AtomicPropp49 is UNSAT
At refinement iteration 1 (OVERLAPS) 57/101 variables, 5/5 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/7 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 4/11 constraints. Problems are: Problem set: 12 solved, 27 unsolved
[2024-05-31 22:13:47] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/12 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/12 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 6/107 variables, 5/17 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 7/24 constraints. Problems are: Problem set: 12 solved, 27 unsolved
[2024-05-31 22:13:47] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-31 22:13:47] [INFO ] Deduced a trap composed of 77 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 2/26 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 98/205 variables, 107/133 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 25/158 constraints. Problems are: Problem set: 12 solved, 27 unsolved
[2024-05-31 22:13:47] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:13:48] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 4 ms to minimize.
[2024-05-31 22:13:48] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 3/161 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/161 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 1/206 variables, 1/162 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 2/164 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/206 variables, 0/164 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 17 (OVERLAPS) 0/206 variables, 0/164 constraints. Problems are: Problem set: 12 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 164 constraints, problems are : Problem set: 12 solved, 27 unsolved in 2028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 27/39 constraints, Known Traps: 17/17 constraints]
After SMT, in 3716ms problems are : Problem set: 12 solved, 27 unsolved
Fused 27 Parikh solutions to 24 different solutions.
Parikh walk visited 12 properties in 2954 ms.
Support contains 19 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 107 transition count 86
Reduce places removed 12 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 19 rules applied. Total rules applied 32 place count 95 transition count 79
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 39 place count 88 transition count 79
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 39 place count 88 transition count 76
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 45 place count 85 transition count 76
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 67 place count 74 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 73 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 73 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 72 transition count 64
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 76 place count 72 transition count 59
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 81 place count 67 transition count 59
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 86 place count 67 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 87 place count 66 transition count 58
Applied a total of 87 rules in 39 ms. Remains 66 /108 variables (removed 42) and now considering 58/98 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 66/108 places, 58/98 transitions.
RANDOM walk for 40000 steps (3565 resets) in 700 ms. (57 steps per ms) remains 5/15 properties
BEST_FIRST walk for 40000 steps (2660 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2618 resets) in 173 ms. (229 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (2668 resets) in 189 ms. (210 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2680 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2682 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
// Phase 1: matrix 58 rows 66 cols
[2024-05-31 22:13:52] [INFO ] Computed 12 invariants in 3 ms
[2024-05-31 22:13:52] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 44/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:13:52] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/53 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:13:52] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 11/64 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:13:53] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:13:53] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 2 ms to minimize.
[2024-05-31 22:13:53] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:13:53] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 58/122 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/124 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/124 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/124 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/124 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 87 constraints, problems are : Problem set: 0 solved, 5 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 44/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/53 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 11/64 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 58/122 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/124 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/124 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:13:53] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/124 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/124 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/124 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 93 constraints, problems are : Problem set: 0 solved, 5 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 7/7 constraints]
After SMT, in 647ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1157 ms.
Support contains 7 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 58/58 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 64 transition count 56
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 58 transition count 50
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 58 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 57 transition count 49
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 57 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 55 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 55 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 54 transition count 46
Applied a total of 24 rules in 18 ms. Remains 54 /66 variables (removed 12) and now considering 46/58 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 54/66 places, 46/58 transitions.
RANDOM walk for 40000 steps (4305 resets) in 660 ms. (60 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (2989 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (2977 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3052 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3034 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3042 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 2170 steps, run visited all 5 properties in 28 ms. (steps per millisecond=77 )
Probabilistic random walk after 2170 steps, saw 1112 distinct states, run finished after 31 ms. (steps per millisecond=70 ) properties seen :5
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-002-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:13:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:13:55] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 66 out of 108 places (down from 71) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 176 edges and 108 vertex of which 104 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 98
Applied a total of 1 rules in 3 ms. Remains 107 /108 variables (removed 1) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 107/108 places, 98/98 transitions.
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:13:55] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 3 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 106/108 places, 98/98 transitions.
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:13:55] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 83 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 82 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 47 place count 82 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 53 place count 79 transition count 71
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 83 place count 64 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 63 transition count 55
Applied a total of 84 rules in 13 ms. Remains 63 /108 variables (removed 45) and now considering 55/98 (removed 43) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 63/108 places, 55/98 transitions.
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:13:55] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 98
Applied a total of 1 rules in 4 ms. Remains 107 /108 variables (removed 1) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 107/108 places, 98/98 transitions.
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:13:55] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 2 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/108 places, 98/98 transitions.
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:13:55] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 83 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 81 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 49 place count 81 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 57 place count 77 transition count 69
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 83 place count 64 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 63 transition count 55
Applied a total of 84 rules in 10 ms. Remains 63 /108 variables (removed 45) and now considering 55/98 (removed 43) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 63/108 places, 55/98 transitions.
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:13:55] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 83 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 45 place count 83 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 53 place count 79 transition count 71
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 83 place count 64 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 63 transition count 55
Applied a total of 84 rules in 9 ms. Remains 63 /108 variables (removed 45) and now considering 55/98 (removed 43) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 63/108 places, 55/98 transitions.
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:13:55] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 2 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/108 places, 98/98 transitions.
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:13:55] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 2 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/108 places, 98/98 transitions.
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:13:55] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 105 transition count 82
Reduce places removed 15 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 90 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 87 transition count 79
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 37 place count 87 transition count 75
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 45 place count 83 transition count 75
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 63 place count 74 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 73 transition count 65
Applied a total of 64 rules in 10 ms. Remains 73 /108 variables (removed 35) and now considering 65/98 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 73/108 places, 65/98 transitions.
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:13:55] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 1 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 106/108 places, 98/98 transitions.
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:13:55] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 105 transition count 73
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 81 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 49 place count 81 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 77 transition count 69
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 87 place count 62 transition count 54
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 62 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 61 transition count 53
Applied a total of 90 rules in 10 ms. Remains 61 /108 variables (removed 47) and now considering 53/98 (removed 45) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 61/108 places, 53/98 transitions.
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 2 ms
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:13:55] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 1 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 106/108 places, 98/98 transitions.
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:13:55] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 98
Applied a total of 1 rules in 1 ms. Remains 107 /108 variables (removed 1) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 107/108 places, 98/98 transitions.
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:13:55] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:13:55] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:13:55] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 22:13:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 98 transitions and 274 arcs took 1 ms.
Total runtime 24190 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 : DoubleExponent-PT-002-CTLCardinality-2024-00
Could not compute solution for formula : DoubleExponent-PT-002-CTLCardinality-2024-01
Could not compute solution for formula : DoubleExponent-PT-002-CTLCardinality-2024-02
Could not compute solution for formula : DoubleExponent-PT-002-CTLCardinality-2024-03
Could not compute solution for formula : DoubleExponent-PT-002-CTLCardinality-2024-04
Could not compute solution for formula : DoubleExponent-PT-002-CTLCardinality-2024-05
Could not compute solution for formula : DoubleExponent-PT-002-CTLCardinality-2024-06
Could not compute solution for formula : DoubleExponent-PT-002-CTLCardinality-2024-07
Could not compute solution for formula : DoubleExponent-PT-002-CTLCardinality-2024-08
Could not compute solution for formula : DoubleExponent-PT-002-CTLCardinality-2024-09
Could not compute solution for formula : DoubleExponent-PT-002-CTLCardinality-2024-11
Could not compute solution for formula : DoubleExponent-PT-002-CTLCardinality-2023-12
Could not compute solution for formula : DoubleExponent-PT-002-CTLCardinality-2023-14
Could not compute solution for formula : DoubleExponent-PT-002-CTLCardinality-2023-15

BK_STOP 1717193635869

--------------------
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 DoubleExponent-PT-002-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/663/ctl_0_
ctl formula name DoubleExponent-PT-002-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/663/ctl_1_
ctl formula name DoubleExponent-PT-002-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/663/ctl_2_
ctl formula name DoubleExponent-PT-002-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/663/ctl_3_
ctl formula name DoubleExponent-PT-002-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/663/ctl_4_
ctl formula name DoubleExponent-PT-002-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/663/ctl_5_
ctl formula name DoubleExponent-PT-002-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/663/ctl_6_
ctl formula name DoubleExponent-PT-002-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/663/ctl_7_
ctl formula name DoubleExponent-PT-002-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/663/ctl_8_
ctl formula name DoubleExponent-PT-002-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/663/ctl_9_
ctl formula name DoubleExponent-PT-002-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/663/ctl_10_
ctl formula name DoubleExponent-PT-002-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/663/ctl_11_
ctl formula name DoubleExponent-PT-002-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/663/ctl_12_
ctl formula name DoubleExponent-PT-002-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/663/ctl_13_
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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r488-tall-171631132900529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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