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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 19K Apr 12 02:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 02:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 02:41 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 7.2K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 42K Apr 12 02:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 262K Apr 12 02:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 12 02:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 224K Apr 12 02:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K 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 100K 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-2-CTLCardinality-2024-00
FORMULA_NAME Peterson-PT-2-CTLCardinality-2024-01
FORMULA_NAME Peterson-PT-2-CTLCardinality-2024-02
FORMULA_NAME Peterson-PT-2-CTLCardinality-2024-03
FORMULA_NAME Peterson-PT-2-CTLCardinality-2024-04
FORMULA_NAME Peterson-PT-2-CTLCardinality-2024-05
FORMULA_NAME Peterson-PT-2-CTLCardinality-2024-06
FORMULA_NAME Peterson-PT-2-CTLCardinality-2024-07
FORMULA_NAME Peterson-PT-2-CTLCardinality-2024-08
FORMULA_NAME Peterson-PT-2-CTLCardinality-2024-09
FORMULA_NAME Peterson-PT-2-CTLCardinality-2024-10
FORMULA_NAME Peterson-PT-2-CTLCardinality-2024-11
FORMULA_NAME Peterson-PT-2-CTLCardinality-2024-12
FORMULA_NAME Peterson-PT-2-CTLCardinality-2024-13
FORMULA_NAME Peterson-PT-2-CTLCardinality-2024-14
FORMULA_NAME Peterson-PT-2-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717269241337

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-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:14:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:14:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:14:03] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-06-01 19:14:03] [INFO ] Transformed 102 places.
[2024-06-01 19:14:03] [INFO ] Transformed 126 transitions.
[2024-06-01 19:14:03] [INFO ] Found NUPN structural information;
[2024-06-01 19:14:03] [INFO ] Parsed PT model containing 102 places and 126 transitions and 384 arcs in 384 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 31 ms.
Support contains 93 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 12 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:14:03] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-06-01 19:14:03] [INFO ] Computed 11 invariants in 17 ms
[2024-06-01 19:14:04] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-06-01 19:14:04] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:14:04] [INFO ] Invariant cache hit.
[2024-06-01 19:14:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:14:04] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-06-01 19:14:04] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:14:04] [INFO ] Invariant cache hit.
[2024-06-01 19:14:04] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 3/102 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 17 ms to minimize.
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 2 ms to minimize.
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 2 ms to minimize.
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-06-01 19:14:06] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:14:07] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-06-01 19:14:07] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 2 ms to minimize.
[2024-06-01 19:14:07] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
[2024-06-01 19:14:07] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
[2024-06-01 19:14:07] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:14:08] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 256 constraints, problems are : Problem set: 0 solved, 123 unsolved in 9206 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 15/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 123/379 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:14:16] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 380 constraints, problems are : Problem set: 0 solved, 123 unsolved in 6729 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 20/20 constraints]
After SMT, in 16038ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 16059ms
Finished structural reductions in LTL mode , in 1 iterations and 16800 ms. Remains : 102/102 places, 126/126 transitions.
Support contains 93 out of 102 places after structural reductions.
[2024-06-01 19:14:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 19:14:20] [INFO ] Flatten gal took : 49 ms
[2024-06-01 19:14:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Peterson-PT-2-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 19:14:20] [INFO ] Flatten gal took : 19 ms
[2024-06-01 19:14:20] [INFO ] Input system was already deterministic with 126 transitions.
Support contains 92 out of 102 places (down from 93) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2974 ms. (13 steps per ms) remains 28/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
[2024-06-01 19:14:22] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:14:22] [INFO ] Invariant cache hit.
[2024-06-01 19:14:22] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 20 solved, 4 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/93 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/93 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/93 variables, 3/96 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/99 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/99 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/96 variables, 3/102 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 3/105 constraints. Problems are: Problem set: 21 solved, 3 unsolved
[2024-06-01 19:14:22] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
Problem AtomicPropp46 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 1/106 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/106 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 120/216 variables, 96/202 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 22/224 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/224 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/222 variables, 6/230 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 6/236 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/222 variables, 2/238 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 0/238 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/222 variables, 0/238 constraints. Problems are: Problem set: 22 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 238 constraints, problems are : Problem set: 22 solved, 2 unsolved in 291 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 22 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 54/61 variables, 3/10 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 54/64 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/64 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/62 variables, 1/65 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/66 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/66 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/64 variables, 2/68 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 2/70 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/70 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 80/144 variables, 64/134 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 12/146 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 0/146 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 10/154 variables, 6/152 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/154 variables, 6/158 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 2/160 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 1/161 constraints. Problems are: Problem set: 22 solved, 2 unsolved
[2024-06-01 19:14:22] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/154 variables, 1/162 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/154 variables, 0/162 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 16/170 variables, 4/166 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/170 variables, 4/170 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/170 variables, 10/180 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/170 variables, 0/180 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 26/196 variables, 1/181 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/196 variables, 26/207 constraints. Problems are: Problem set: 22 solved, 2 unsolved
[2024-06-01 19:14:22] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-06-01 19:14:22] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:14:22] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/196 variables, 3/210 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/196 variables, 0/210 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/197 variables, 1/211 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/197 variables, 1/212 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/197 variables, 0/212 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 1/198 variables, 1/213 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/198 variables, 1/214 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/198 variables, 1/215 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/198 variables, 1/216 constraints. Problems are: Problem set: 22 solved, 2 unsolved
[2024-06-01 19:14:22] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/198 variables, 1/217 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/198 variables, 0/217 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 24/222 variables, 28/245 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/222 variables, 0/245 constraints. Problems are: Problem set: 22 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 0/222 variables, 0/245 constraints. Problems are: Problem set: 22 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 245 constraints, problems are : Problem set: 22 solved, 2 unsolved in 553 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/24 constraints, Known Traps: 6/6 constraints]
After SMT, in 887ms problems are : Problem set: 22 solved, 2 unsolved
Parikh walk visited 0 properties in 356 ms.
Support contains 7 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 102 transition count 95
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 71 transition count 95
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 62 place count 71 transition count 80
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 92 place count 56 transition count 80
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 104 place count 50 transition count 74
Applied a total of 104 rules in 47 ms. Remains 50 /102 variables (removed 52) and now considering 74/126 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 50/102 places, 74/126 transitions.
RANDOM walk for 40000 steps (8 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Probably explored full state space saw : 1866 states, properties seen :1
Probabilistic random walk after 7464 steps, saw 1866 distinct states, run finished after 56 ms. (steps per millisecond=133 ) properties seen :1
Explored full state space saw : 1866 states, properties seen :0
Exhaustive walk after 7464 steps, saw 1866 distinct states, run finished after 19 ms. (steps per millisecond=392 ) properties seen :0
Successfully simplified 23 atomic propositions for a total of 14 simplifications.
FORMULA Peterson-PT-2-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 19:14:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 19:14:23] [INFO ] Flatten gal took : 11 ms
[2024-06-01 19:14:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Peterson-PT-2-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 19:14:23] [INFO ] Flatten gal took : 11 ms
[2024-06-01 19:14:23] [INFO ] Input system was already deterministic with 126 transitions.
Support contains 36 out of 102 places (down from 73) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 19:14:23] [INFO ] Flatten gal took : 10 ms
[2024-06-01 19:14:23] [INFO ] Flatten gal took : 10 ms
[2024-06-01 19:14:23] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 19:14:23] [INFO ] Flatten gal took : 9 ms
[2024-06-01 19:14:23] [INFO ] Flatten gal took : 10 ms
[2024-06-01 19:14:23] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 19:14:23] [INFO ] Flatten gal took : 8 ms
[2024-06-01 19:14:23] [INFO ] Flatten gal took : 15 ms
[2024-06-01 19:14:23] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 19:14:23] [INFO ] Flatten gal took : 8 ms
[2024-06-01 19:14:23] [INFO ] Flatten gal took : 10 ms
[2024-06-01 19:14:23] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 19:14:23] [INFO ] Flatten gal took : 9 ms
[2024-06-01 19:14:23] [INFO ] Flatten gal took : 10 ms
[2024-06-01 19:14:23] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 19:14:23] [INFO ] Flatten gal took : 8 ms
[2024-06-01 19:14:23] [INFO ] Flatten gal took : 9 ms
[2024-06-01 19:14:23] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 19:14:24] [INFO ] Flatten gal took : 7 ms
[2024-06-01 19:14:24] [INFO ] Flatten gal took : 12 ms
[2024-06-01 19:14:24] [INFO ] Input system was already deterministic with 126 transitions.
[2024-06-01 19:14:24] [INFO ] Flatten gal took : 9 ms
[2024-06-01 19:14:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 19:14:24] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 19:14:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 126 transitions and 384 arcs took 4 ms.
Total runtime 21036 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-2-CTLCardinality-2024-02
Could not compute solution for formula : Peterson-PT-2-CTLCardinality-2024-07
Could not compute solution for formula : Peterson-PT-2-CTLCardinality-2024-08
Could not compute solution for formula : Peterson-PT-2-CTLCardinality-2024-10
Could not compute solution for formula : Peterson-PT-2-CTLCardinality-2024-11
Could not compute solution for formula : Peterson-PT-2-CTLCardinality-2024-12
Could not compute solution for formula : Peterson-PT-2-CTLCardinality-2024-15

BK_STOP 1717269264423

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-2-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/600/ctl_0_
ctl formula name Peterson-PT-2-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/600/ctl_1_
ctl formula name Peterson-PT-2-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/600/ctl_2_
ctl formula name Peterson-PT-2-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/600/ctl_3_
ctl formula name Peterson-PT-2-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/600/ctl_4_
ctl formula name Peterson-PT-2-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/600/ctl_5_
ctl formula name Peterson-PT-2-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/600/ctl_6_
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-2"
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-2, 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-171654407200249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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