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.r536-tall-171690532900665.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 Sudoku-PT-AN13, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532900665
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 813K Apr 12 11:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.3M Apr 12 10:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 379K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Apr 12 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Apr 12 11:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.1M Apr 12 11:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 78K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 191K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 Sudoku-PT-AN13-CTLCardinality-2024-00
FORMULA_NAME Sudoku-PT-AN13-CTLCardinality-2024-01
FORMULA_NAME Sudoku-PT-AN13-CTLCardinality-2024-02
FORMULA_NAME Sudoku-PT-AN13-CTLCardinality-2024-03
FORMULA_NAME Sudoku-PT-AN13-CTLCardinality-2024-04
FORMULA_NAME Sudoku-PT-AN13-CTLCardinality-2024-05
FORMULA_NAME Sudoku-PT-AN13-CTLCardinality-2024-06
FORMULA_NAME Sudoku-PT-AN13-CTLCardinality-2024-07
FORMULA_NAME Sudoku-PT-AN13-CTLCardinality-2024-08
FORMULA_NAME Sudoku-PT-AN13-CTLCardinality-2024-09
FORMULA_NAME Sudoku-PT-AN13-CTLCardinality-2024-10
FORMULA_NAME Sudoku-PT-AN13-CTLCardinality-2024-11
FORMULA_NAME Sudoku-PT-AN13-CTLCardinality-2024-12
FORMULA_NAME Sudoku-PT-AN13-CTLCardinality-2024-13
FORMULA_NAME Sudoku-PT-AN13-CTLCardinality-2024-14
FORMULA_NAME Sudoku-PT-AN13-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717273567402

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:26:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:26:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:26:08] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2024-06-01 20:26:08] [INFO ] Transformed 2704 places.
[2024-06-01 20:26:08] [INFO ] Transformed 2197 transitions.
[2024-06-01 20:26:08] [INFO ] Found NUPN structural information;
[2024-06-01 20:26:08] [INFO ] Parsed PT model containing 2704 places and 2197 transitions and 8788 arcs in 389 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 144 ms.
FORMULA Sudoku-PT-AN13-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 33 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-06-01 20:26:09] [INFO ] Computed 507 invariants in 57 ms
[2024-06-01 20:26:10] [INFO ] Implicit Places using invariants in 893 ms returned []
[2024-06-01 20:26:10] [INFO ] Invariant cache hit.
[2024-06-01 20:26:12] [INFO ] Implicit Places using invariants and state equation in 1862 ms returned []
Implicit Place search using SMT with State Equation took 2791 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 2846 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2704 out of 2704 places after structural reductions.
[2024-06-01 20:26:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 20:26:12] [INFO ] Flatten gal took : 232 ms
FORMULA Sudoku-PT-AN13-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 20:26:13] [INFO ] Flatten gal took : 161 ms
[2024-06-01 20:26:13] [INFO ] Input system was already deterministic with 2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 25666 ms. (1 steps per ms) remains 11/41 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4298 ms. (9 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4991 ms. (8 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3976 ms. (10 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 607 ms. (65 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4621 ms. (8 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12645 ms. (3 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 478 ms. (83 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 481 ms. (82 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2629 ms. (15 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 771 ms. (51 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 10/11 properties
[2024-06-01 20:26:29] [INFO ] Invariant cache hit.
Problem AtomicPropp14 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 2704/2704 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/2704 variables, 507/3211 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2704 variables, 0/3211 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 5915 constraints, problems are : Problem set: 6 solved, 4 unsolved in 5021 ms.
Refiners :[Domain max(s): 2704/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2535 variables, 2535/2535 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/2535 variables, 338/2873 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2535 variables, 0/2873 constraints. Problems are: Problem set: 7 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 3042 constraints, problems are : Problem set: 7 solved, 3 unsolved in 4088 ms.
Refiners :[Domain max(s): 2535/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 13231ms problems are : Problem set: 7 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.11 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 130 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 507/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 8387 ms. (4 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 604 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 573 ms. (69 steps per ms) remains 2/2 properties
// Phase 1: matrix 2197 rows 507 cols
[2024-06-01 20:26:46] [INFO ] Computed 38 invariants in 133 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 332/501 variables, 32/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 332/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/507 variables, 6/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 6/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2197/2704 variables, 507/1052 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1433 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 332/501 variables, 32/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 332/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/507 variables, 6/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 6/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2197/2704 variables, 507/1052 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1590 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3256ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 163 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=13 )
Parikh walk visited 2 properties in 19 ms.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
[2024-06-01 20:26:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 20:26:49] [INFO ] Flatten gal took : 103 ms
FORMULA Sudoku-PT-AN13-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 20:26:49] [INFO ] Flatten gal took : 110 ms
[2024-06-01 20:26:49] [INFO ] Input system was already deterministic with 2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA Sudoku-PT-AN13-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 47 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 2704/2704 places, 2197/2197 transitions.
[2024-06-01 20:26:50] [INFO ] Flatten gal took : 91 ms
[2024-06-01 20:26:50] [INFO ] Flatten gal took : 91 ms
[2024-06-01 20:26:50] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 75 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 507/2704 places, 2197/2197 transitions.
[2024-06-01 20:26:50] [INFO ] Flatten gal took : 60 ms
[2024-06-01 20:26:50] [INFO ] Flatten gal took : 68 ms
[2024-06-01 20:26:50] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 77 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 78 ms. Remains : 2704/2704 places, 2197/2197 transitions.
[2024-06-01 20:26:50] [INFO ] Flatten gal took : 108 ms
[2024-06-01 20:26:50] [INFO ] Flatten gal took : 80 ms
[2024-06-01 20:26:51] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.6 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 65 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 507/2704 places, 2197/2197 transitions.
[2024-06-01 20:26:51] [INFO ] Flatten gal took : 69 ms
[2024-06-01 20:26:51] [INFO ] Flatten gal took : 59 ms
[2024-06-01 20:26:51] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 25 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 2704/2704 places, 2197/2197 transitions.
[2024-06-01 20:26:51] [INFO ] Flatten gal took : 81 ms
[2024-06-01 20:26:51] [INFO ] Flatten gal took : 87 ms
[2024-06-01 20:26:51] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 45 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 507/2704 places, 2197/2197 transitions.
[2024-06-01 20:26:51] [INFO ] Flatten gal took : 56 ms
[2024-06-01 20:26:51] [INFO ] Flatten gal took : 60 ms
[2024-06-01 20:26:52] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2192 places and 0 transitions.
Iterating post reduction 0 with 2192 rules applied. Total rules applied 2192 place count 512 transition count 2197
Applied a total of 2192 rules in 61 ms. Remains 512 /2704 variables (removed 2192) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 512/2704 places, 2197/2197 transitions.
[2024-06-01 20:26:52] [INFO ] Flatten gal took : 56 ms
[2024-06-01 20:26:52] [INFO ] Flatten gal took : 60 ms
[2024-06-01 20:26:52] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 515 are kept as prefixes of interest. Removing 2189 places using SCC suffix rule.5 ms
Discarding 2189 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 56 ms. Remains 515 /2704 variables (removed 2189) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 515/2704 places, 2197/2197 transitions.
[2024-06-01 20:26:52] [INFO ] Flatten gal took : 54 ms
[2024-06-01 20:26:52] [INFO ] Flatten gal took : 59 ms
[2024-06-01 20:26:52] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2193 places and 0 transitions.
Iterating post reduction 0 with 2193 rules applied. Total rules applied 2193 place count 511 transition count 2197
Applied a total of 2193 rules in 43 ms. Remains 511 /2704 variables (removed 2193) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 511/2704 places, 2197/2197 transitions.
[2024-06-01 20:26:52] [INFO ] Flatten gal took : 54 ms
[2024-06-01 20:26:52] [INFO ] Flatten gal took : 60 ms
[2024-06-01 20:26:52] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 398 are kept as prefixes of interest. Removing 2306 places using SCC suffix rule.3 ms
Discarding 2306 places :
Also discarding 180 output transitions
Drop transitions (Output transitions of discarded places.) removed 180 transitions
Applied a total of 1 rules in 96 ms. Remains 398 /2704 variables (removed 2306) and now considering 2017/2197 (removed 180) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 96 ms. Remains : 398/2704 places, 2017/2197 transitions.
[2024-06-01 20:26:53] [INFO ] Flatten gal took : 41 ms
[2024-06-01 20:26:53] [INFO ] Flatten gal took : 47 ms
[2024-06-01 20:26:53] [INFO ] Input system was already deterministic with 2017 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2191 places and 0 transitions.
Iterating post reduction 0 with 2191 rules applied. Total rules applied 2191 place count 513 transition count 2197
Applied a total of 2191 rules in 52 ms. Remains 513 /2704 variables (removed 2191) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 513/2704 places, 2197/2197 transitions.
[2024-06-01 20:26:53] [INFO ] Flatten gal took : 79 ms
[2024-06-01 20:26:53] [INFO ] Flatten gal took : 59 ms
[2024-06-01 20:26:53] [INFO ] Input system was already deterministic with 2197 transitions.
[2024-06-01 20:26:53] [INFO ] Flatten gal took : 80 ms
[2024-06-01 20:26:53] [INFO ] Flatten gal took : 85 ms
[2024-06-01 20:26:53] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 7 ms.
[2024-06-01 20:26:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2704 places, 2197 transitions and 8788 arcs took 12 ms.
Total runtime 45399 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 : Sudoku-PT-AN13-CTLCardinality-2024-00
Could not compute solution for formula : Sudoku-PT-AN13-CTLCardinality-2024-01
Could not compute solution for formula : Sudoku-PT-AN13-CTLCardinality-2024-03
Could not compute solution for formula : Sudoku-PT-AN13-CTLCardinality-2024-04
Could not compute solution for formula : Sudoku-PT-AN13-CTLCardinality-2024-06
Could not compute solution for formula : Sudoku-PT-AN13-CTLCardinality-2024-08
Could not compute solution for formula : Sudoku-PT-AN13-CTLCardinality-2024-10
Could not compute solution for formula : Sudoku-PT-AN13-CTLCardinality-2024-12
Could not compute solution for formula : Sudoku-PT-AN13-CTLCardinality-2024-13
Could not compute solution for formula : Sudoku-PT-AN13-CTLCardinality-2024-14
Could not compute solution for formula : Sudoku-PT-AN13-CTLCardinality-2024-15

BK_STOP 1717273614256

--------------------
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 Sudoku-PT-AN13-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/528/ctl_0_
ctl formula name Sudoku-PT-AN13-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/528/ctl_1_
ctl formula name Sudoku-PT-AN13-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/528/ctl_2_
ctl formula name Sudoku-PT-AN13-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/528/ctl_3_
ctl formula name Sudoku-PT-AN13-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/528/ctl_4_
ctl formula name Sudoku-PT-AN13-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/528/ctl_5_
ctl formula name Sudoku-PT-AN13-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/528/ctl_6_
ctl formula name Sudoku-PT-AN13-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/528/ctl_7_
ctl formula name Sudoku-PT-AN13-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/528/ctl_8_
ctl formula name Sudoku-PT-AN13-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/528/ctl_9_
ctl formula name Sudoku-PT-AN13-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/528/ctl_10_
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="Sudoku-PT-AN13"
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 Sudoku-PT-AN13, 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 r536-tall-171690532900665"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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