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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 306K Apr 12 12:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 12 12:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 646K Apr 12 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 11:50 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 170K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 582K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 361K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 366K Apr 12 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 857K Apr 12 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 12 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:01 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 499K 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-BN09-CTLCardinality-2024-00
FORMULA_NAME Sudoku-PT-BN09-CTLCardinality-2024-01
FORMULA_NAME Sudoku-PT-BN09-CTLCardinality-2024-02
FORMULA_NAME Sudoku-PT-BN09-CTLCardinality-2024-03
FORMULA_NAME Sudoku-PT-BN09-CTLCardinality-2024-04
FORMULA_NAME Sudoku-PT-BN09-CTLCardinality-2024-05
FORMULA_NAME Sudoku-PT-BN09-CTLCardinality-2024-06
FORMULA_NAME Sudoku-PT-BN09-CTLCardinality-2024-07
FORMULA_NAME Sudoku-PT-BN09-CTLCardinality-2024-08
FORMULA_NAME Sudoku-PT-BN09-CTLCardinality-2024-09
FORMULA_NAME Sudoku-PT-BN09-CTLCardinality-2024-10
FORMULA_NAME Sudoku-PT-BN09-CTLCardinality-2024-11
FORMULA_NAME Sudoku-PT-BN09-CTLCardinality-2024-12
FORMULA_NAME Sudoku-PT-BN09-CTLCardinality-2024-13
FORMULA_NAME Sudoku-PT-BN09-CTLCardinality-2024-14
FORMULA_NAME Sudoku-PT-BN09-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717278720255

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-BN09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:52:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 21:52:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:52:01] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2024-06-01 21:52:01] [INFO ] Transformed 1053 places.
[2024-06-01 21:52:01] [INFO ] Transformed 729 transitions.
[2024-06-01 21:52:01] [INFO ] Found NUPN structural information;
[2024-06-01 21:52:01] [INFO ] Parsed PT model containing 1053 places and 729 transitions and 3645 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 53 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-BN09-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1053 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 17 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-06-01 21:52:01] [INFO ] Computed 324 invariants in 26 ms
[2024-06-01 21:52:02] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-06-01 21:52:02] [INFO ] Invariant cache hit.
[2024-06-01 21:52:02] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Finished structural reductions in LTL mode , in 1 iterations and 1257 ms. Remains : 1053/1053 places, 729/729 transitions.
Support contains 1053 out of 1053 places after structural reductions.
[2024-06-01 21:52:03] [INFO ] Flatten gal took : 132 ms
[2024-06-01 21:52:03] [INFO ] Flatten gal took : 81 ms
[2024-06-01 21:52:03] [INFO ] Input system was already deterministic with 729 transitions.
RANDOM walk for 40000 steps (601 resets) in 8604 ms. (4 steps per ms) remains 17/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 172 ms. (23 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 17/17 properties
[2024-06-01 21:52:06] [INFO ] Invariant cache hit.
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp35 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1053 variables, 1053/1053 constraints. Problems are: Problem set: 4 solved, 13 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1053 variables, 324/1377 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 15 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 2430 constraints, problems are : Problem set: 15 solved, 2 unsolved in 2621 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 729/891 variables, 162/324 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/891 variables, 729/1053 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/891 variables, 0/1053 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 162/1053 variables, 162/1215 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1053 variables, 162/1377 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 729/1782 variables, 1053/2430 constraints. Problems are: Problem set: 15 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 2432 constraints, problems are : Problem set: 15 solved, 2 unsolved in 3243 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 2/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 7322ms problems are : Problem set: 15 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 162 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.3 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 129 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 324/1053 places, 729/729 transitions.
RANDOM walk for 40000 steps (602 resets) in 2698 ms. (14 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 309607 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 309607 steps, saw 78566 distinct states, run finished after 3004 ms. (steps per millisecond=103 ) properties seen :0
// Phase 1: matrix 729 rows 324 cols
[2024-06-01 21:52:18] [INFO ] Computed 75 invariants in 39 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 25/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/324 variables, 50/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 162/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 2 unsolved in 443 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 25/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/324 variables, 50/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 162/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 2/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1053 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1053 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 19683 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 20231ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 2 properties in 139 ms.
Successfully simplified 15 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-BN09-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 21:52:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 21:52:38] [INFO ] Flatten gal took : 54 ms
FORMULA Sudoku-PT-BN09-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 21:52:38] [INFO ] Flatten gal took : 53 ms
[2024-06-01 21:52:38] [INFO ] Input system was already deterministic with 729 transitions.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
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-BN09-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 25 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-06-01 21:52:38] [INFO ] Flatten gal took : 41 ms
[2024-06-01 21:52:38] [INFO ] Flatten gal took : 43 ms
[2024-06-01 21:52:39] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 7 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-06-01 21:52:39] [INFO ] Flatten gal took : 38 ms
[2024-06-01 21:52:39] [INFO ] Flatten gal took : 40 ms
[2024-06-01 21:52:39] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.4 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 28 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 324/1053 places, 729/729 transitions.
[2024-06-01 21:52:39] [INFO ] Flatten gal took : 31 ms
[2024-06-01 21:52:39] [INFO ] Flatten gal took : 33 ms
[2024-06-01 21:52:39] [INFO ] Input system was already deterministic with 729 transitions.
RANDOM walk for 196 steps (0 resets) in 108 ms. (1 steps per ms) remains 0/1 properties
FORMULA Sudoku-PT-BN09-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.4 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 324/1053 places, 729/729 transitions.
[2024-06-01 21:52:39] [INFO ] Flatten gal took : 30 ms
[2024-06-01 21:52:39] [INFO ] Flatten gal took : 31 ms
[2024-06-01 21:52:39] [INFO ] Input system was already deterministic with 729 transitions.
RANDOM walk for 44 steps (0 resets) in 30 ms. (1 steps per ms) remains 0/1 properties
FORMULA Sudoku-PT-BN09-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-06-01 21:52:39] [INFO ] Flatten gal took : 35 ms
[2024-06-01 21:52:39] [INFO ] Flatten gal took : 36 ms
[2024-06-01 21:52:39] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 18 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-06-01 21:52:39] [INFO ] Flatten gal took : 31 ms
[2024-06-01 21:52:39] [INFO ] Flatten gal took : 32 ms
[2024-06-01 21:52:39] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 335 are kept as prefixes of interest. Removing 718 places using SCC suffix rule.2 ms
Discarding 718 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 29 ms. Remains 335 /1053 variables (removed 718) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 335/1053 places, 729/729 transitions.
[2024-06-01 21:52:39] [INFO ] Flatten gal took : 24 ms
[2024-06-01 21:52:39] [INFO ] Flatten gal took : 28 ms
[2024-06-01 21:52:40] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 265 are kept as prefixes of interest. Removing 788 places using SCC suffix rule.2 ms
Discarding 788 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 33 ms. Remains 265 /1053 variables (removed 788) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 265/1053 places, 729/729 transitions.
[2024-06-01 21:52:40] [INFO ] Flatten gal took : 21 ms
[2024-06-01 21:52:40] [INFO ] Flatten gal took : 23 ms
[2024-06-01 21:52:40] [INFO ] Input system was already deterministic with 729 transitions.
RANDOM walk for 4923 steps (67 resets) in 683 ms. (7 steps per ms) remains 0/1 properties
FORMULA Sudoku-PT-BN09-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 330 are kept as prefixes of interest. Removing 723 places using SCC suffix rule.3 ms
Discarding 723 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 22 ms. Remains 330 /1053 variables (removed 723) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 330/1053 places, 729/729 transitions.
[2024-06-01 21:52:40] [INFO ] Flatten gal took : 25 ms
[2024-06-01 21:52:40] [INFO ] Flatten gal took : 28 ms
[2024-06-01 21:52:40] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 721 places and 0 transitions.
Iterating post reduction 0 with 721 rules applied. Total rules applied 721 place count 332 transition count 729
Applied a total of 721 rules in 20 ms. Remains 332 /1053 variables (removed 721) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 332/1053 places, 729/729 transitions.
[2024-06-01 21:52:40] [INFO ] Flatten gal took : 24 ms
[2024-06-01 21:52:40] [INFO ] Flatten gal took : 26 ms
[2024-06-01 21:52:40] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 713 places and 0 transitions.
Iterating post reduction 0 with 713 rules applied. Total rules applied 713 place count 340 transition count 729
Applied a total of 713 rules in 13 ms. Remains 340 /1053 variables (removed 713) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 340/1053 places, 729/729 transitions.
[2024-06-01 21:52:40] [INFO ] Flatten gal took : 23 ms
[2024-06-01 21:52:40] [INFO ] Flatten gal took : 25 ms
[2024-06-01 21:52:40] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 329 are kept as prefixes of interest. Removing 724 places using SCC suffix rule.2 ms
Discarding 724 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 329 /1053 variables (removed 724) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 329/1053 places, 729/729 transitions.
[2024-06-01 21:52:40] [INFO ] Flatten gal took : 23 ms
[2024-06-01 21:52:40] [INFO ] Flatten gal took : 25 ms
[2024-06-01 21:52:40] [INFO ] Input system was already deterministic with 729 transitions.
[2024-06-01 21:52:40] [INFO ] Flatten gal took : 48 ms
[2024-06-01 21:52:40] [INFO ] Flatten gal took : 34 ms
[2024-06-01 21:52:41] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 8 ms.
[2024-06-01 21:52:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1053 places, 729 transitions and 3645 arcs took 7 ms.
Total runtime 39726 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-BN09-CTLCardinality-2024-00
Could not compute solution for formula : Sudoku-PT-BN09-CTLCardinality-2024-02
Could not compute solution for formula : Sudoku-PT-BN09-CTLCardinality-2024-06
Could not compute solution for formula : Sudoku-PT-BN09-CTLCardinality-2024-07
Could not compute solution for formula : Sudoku-PT-BN09-CTLCardinality-2024-09
Could not compute solution for formula : Sudoku-PT-BN09-CTLCardinality-2024-11
Could not compute solution for formula : Sudoku-PT-BN09-CTLCardinality-2024-12
Could not compute solution for formula : Sudoku-PT-BN09-CTLCardinality-2024-13
Could not compute solution for formula : Sudoku-PT-BN09-CTLCardinality-2024-15

BK_STOP 1717278761362

--------------------
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-BN09-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/526/ctl_0_
ctl formula name Sudoku-PT-BN09-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/526/ctl_1_
ctl formula name Sudoku-PT-BN09-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/526/ctl_2_
ctl formula name Sudoku-PT-BN09-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/526/ctl_3_
ctl formula name Sudoku-PT-BN09-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/526/ctl_4_
ctl formula name Sudoku-PT-BN09-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/526/ctl_5_
ctl formula name Sudoku-PT-BN09-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/526/ctl_6_
ctl formula name Sudoku-PT-BN09-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/526/ctl_7_
ctl formula name Sudoku-PT-BN09-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/526/ctl_8_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-BN09"
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-BN09, 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-171690533000713"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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