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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 6.6K Apr 12 11:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 12 11:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 10:21 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 4.1K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Apr 12 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 12 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 11:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 11:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN15-CTLCardinality-2024-00
FORMULA_NAME Sudoku-COL-AN15-CTLCardinality-2024-01
FORMULA_NAME Sudoku-COL-AN15-CTLCardinality-2024-02
FORMULA_NAME Sudoku-COL-AN15-CTLCardinality-2024-03
FORMULA_NAME Sudoku-COL-AN15-CTLCardinality-2024-04
FORMULA_NAME Sudoku-COL-AN15-CTLCardinality-2024-05
FORMULA_NAME Sudoku-COL-AN15-CTLCardinality-2024-06
FORMULA_NAME Sudoku-COL-AN15-CTLCardinality-2024-07
FORMULA_NAME Sudoku-COL-AN15-CTLCardinality-2024-08
FORMULA_NAME Sudoku-COL-AN15-CTLCardinality-2024-09
FORMULA_NAME Sudoku-COL-AN15-CTLCardinality-2024-10
FORMULA_NAME Sudoku-COL-AN15-CTLCardinality-2024-11
FORMULA_NAME Sudoku-COL-AN15-CTLCardinality-2024-12
FORMULA_NAME Sudoku-COL-AN15-CTLCardinality-2024-13
FORMULA_NAME Sudoku-COL-AN15-CTLCardinality-2024-14
FORMULA_NAME Sudoku-COL-AN15-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717264166138

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:49:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:49:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:49:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 17:49:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:49:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 480 ms
[2024-06-01 17:49:27] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4050 PT places and 3375.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
[2024-06-01 17:49:27] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-06-01 17:49:27] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
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 1 formulas.
FORMULA Sudoku-COL-AN15-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40856 steps (176 resets) in 237 ms. (171 steps per ms) remains 14/52 properties
BEST_FIRST walk for 40856 steps (176 resets) in 87 ms. (464 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40856 steps (176 resets) in 124 ms. (326 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40856 steps (176 resets) in 71 ms. (567 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40856 steps (176 resets) in 46 ms. (869 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40856 steps (176 resets) in 44 ms. (907 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40856 steps (176 resets) in 22 ms. (1776 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40856 steps (176 resets) in 58 ms. (692 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40856 steps (176 resets) in 46 ms. (869 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40856 steps (176 resets) in 21 ms. (1857 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40856 steps (176 resets) in 49 ms. (817 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40856 steps (176 resets) in 40 ms. (996 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40856 steps (176 resets) in 24 ms. (1634 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40856 steps (176 resets) in 38 ms. (1047 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40856 steps (176 resets) in 25 ms. (1571 steps per ms) remains 14/14 properties
// Phase 1: matrix 1 rows 4 cols
[2024-06-01 17:49:28] [INFO ] Computed 3 invariants in 4 ms
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 7 constraints, problems are : Problem set: 10 solved, 4 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 4/11 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/11 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/5 variables, 0/11 constraints. Problems are: Problem set: 10 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 11 constraints, problems are : Problem set: 10 solved, 4 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 4/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 10 solved, 4 unsolved
Finished Parikh walk after 162 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=27 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 11 ms.
Successfully simplified 10 atomic propositions for a total of 15 simplifications.
[2024-06-01 17:49:28] [INFO ] Flatten gal took : 14 ms
[2024-06-01 17:49:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-COL-AN15-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:49:28] [INFO ] Flatten gal took : 1 ms
Domain [N(15), N(15)] of place Rows breaks symmetries in sort N
[2024-06-01 17:49:28] [INFO ] Unfolded HLPN to a Petri net with 4050 places and 3375 transitions 13500 arcs in 101 ms.
[2024-06-01 17:49:28] [INFO ] Unfolded 14 HLPN properties in 6 ms.
Support contains 4050 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 36 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2024-06-01 17:49:29] [INFO ] Computed 675 invariants in 67 ms
[2024-06-01 17:49:30] [INFO ] Implicit Places using invariants in 1173 ms returned []
[2024-06-01 17:49:30] [INFO ] Invariant cache hit.
[2024-06-01 17:49:34] [INFO ] Implicit Places using invariants and state equation in 3992 ms returned []
Implicit Place search using SMT with State Equation took 5178 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 5232 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Support contains 4050 out of 4050 places after structural reductions.
[2024-06-01 17:49:34] [INFO ] Flatten gal took : 402 ms
[2024-06-01 17:49:35] [INFO ] Flatten gal took : 233 ms
[2024-06-01 17:49:36] [INFO ] Input system was already deterministic with 3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 18409 ms. (2 steps per ms) remains 12/46 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2463 ms. (16 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 952 ms. (41 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 679 ms. (58 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 666 ms. (59 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1502 ms. (26 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1327 ms. (30 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1338 ms. (29 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 733 ms. (54 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1857 ms. (21 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 952 ms. (41 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2899 ms. (13 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1345 ms. (29 steps per ms) remains 12/12 properties
[2024-06-01 17:49:45] [INFO ] Invariant cache hit.
Problem AtomicPropp24 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp20 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 3 solved, 9 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp39 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 7 solved, 5 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10773ms problems are : Problem set: 7 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 675 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.12 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 59 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 675/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 11328 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 691 ms. (57 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 665 ms. (60 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 694 ms. (57 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 695 ms. (57 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1892 ms. (21 steps per ms) remains 5/5 properties
Probabilistic random walk after 148501 steps, saw 148447 distinct states, run finished after 12015 ms. (steps per millisecond=12 ) properties seen :0
// Phase 1: matrix 3375 rows 675 cols
[2024-06-01 17:50:12] [INFO ] Computed 44 invariants in 177 ms
Problem AtomicPropp23 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 44/44 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/675 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 3375/4050 variables, 675/719 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4050 variables, 0/719 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/4050 variables, 0/719 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4050/4050 variables, and 719 constraints, problems are : Problem set: 1 solved, 4 unsolved in 7755 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 44/44 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/675 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 3375/4050 variables, 675/719 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4050 variables, 0/719 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/4050 variables, 0/719 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4050/4050 variables, and 719 constraints, problems are : Problem set: 1 solved, 4 unsolved in 6915 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 15154ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 225 steps, including 0 resets, run visited all 4 properties in 20 ms. (steps per millisecond=11 )
Parikh walk visited 4 properties in 22 ms.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
[2024-06-01 17:50:28] [INFO ] Flatten gal took : 192 ms
[2024-06-01 17:50:28] [INFO ] Flatten gal took : 170 ms
[2024-06-01 17:50:29] [INFO ] Input system was already deterministic with 3375 transitions.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
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 1 formulas.
FORMULA Sudoku-COL-AN15-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.14 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 156 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 160 ms. Remains : 675/4050 places, 3375/3375 transitions.
[2024-06-01 17:50:29] [INFO ] Flatten gal took : 94 ms
[2024-06-01 17:50:29] [INFO ] Flatten gal took : 96 ms
[2024-06-01 17:50:30] [INFO ] Input system was already deterministic with 3375 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 14 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-06-01 17:50:30] [INFO ] Flatten gal took : 130 ms
[2024-06-01 17:50:30] [INFO ] Flatten gal took : 123 ms
[2024-06-01 17:50:30] [INFO ] Input system was already deterministic with 3375 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 316 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 675/4050 places, 3375/3375 transitions.
[2024-06-01 17:50:31] [INFO ] Flatten gal took : 94 ms
[2024-06-01 17:50:31] [INFO ] Flatten gal took : 98 ms
[2024-06-01 17:50:31] [INFO ] Input system was already deterministic with 3375 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 158 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 158 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-06-01 17:50:31] [INFO ] Flatten gal took : 110 ms
[2024-06-01 17:50:31] [INFO ] Flatten gal took : 126 ms
[2024-06-01 17:50:31] [INFO ] Input system was already deterministic with 3375 transitions.
RANDOM walk for 452 steps (0 resets) in 237 ms. (1 steps per ms) remains 0/1 properties
FORMULA Sudoku-COL-AN15-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 18 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-06-01 17:50:32] [INFO ] Flatten gal took : 123 ms
[2024-06-01 17:50:32] [INFO ] Flatten gal took : 136 ms
[2024-06-01 17:50:32] [INFO ] Input system was already deterministic with 3375 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 65 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 675/4050 places, 3375/3375 transitions.
[2024-06-01 17:50:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 17:50:32] [INFO ] Flatten gal took : 83 ms
FORMULA Sudoku-COL-AN15-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:50:32] [INFO ] Flatten gal took : 102 ms
[2024-06-01 17:50:33] [INFO ] Input system was already deterministic with 3375 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 33 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 675/4050 places, 3375/3375 transitions.
[2024-06-01 17:50:33] [INFO ] Flatten gal took : 86 ms
[2024-06-01 17:50:33] [INFO ] Flatten gal took : 93 ms
[2024-06-01 17:50:33] [INFO ] Input system was already deterministic with 3375 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 52 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-06-01 17:50:33] [INFO ] Flatten gal took : 112 ms
[2024-06-01 17:50:33] [INFO ] Flatten gal took : 115 ms
[2024-06-01 17:50:33] [INFO ] Input system was already deterministic with 3375 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.7 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 47 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 675/4050 places, 3375/3375 transitions.
[2024-06-01 17:50:34] [INFO ] Flatten gal took : 80 ms
[2024-06-01 17:50:34] [INFO ] Flatten gal took : 93 ms
[2024-06-01 17:50:34] [INFO ] Input system was already deterministic with 3375 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 28 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-06-01 17:50:34] [INFO ] Flatten gal took : 105 ms
[2024-06-01 17:50:34] [INFO ] Flatten gal took : 113 ms
[2024-06-01 17:50:34] [INFO ] Input system was already deterministic with 3375 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 42 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 675/4050 places, 3375/3375 transitions.
[2024-06-01 17:50:35] [INFO ] Flatten gal took : 81 ms
[2024-06-01 17:50:35] [INFO ] Flatten gal took : 89 ms
[2024-06-01 17:50:35] [INFO ] Input system was already deterministic with 3375 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 28 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 675/4050 places, 3375/3375 transitions.
[2024-06-01 17:50:35] [INFO ] Flatten gal took : 80 ms
[2024-06-01 17:50:35] [INFO ] Flatten gal took : 90 ms
[2024-06-01 17:50:35] [INFO ] Input system was already deterministic with 3375 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 8 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-06-01 17:50:35] [INFO ] Flatten gal took : 110 ms
[2024-06-01 17:50:35] [INFO ] Flatten gal took : 116 ms
[2024-06-01 17:50:36] [INFO ] Input system was already deterministic with 3375 transitions.
[2024-06-01 17:50:36] [INFO ] Flatten gal took : 138 ms
[2024-06-01 17:50:36] [INFO ] Flatten gal took : 144 ms
[2024-06-01 17:50:37] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 17 ms.
[2024-06-01 17:50:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4050 places, 3375 transitions and 13500 arcs took 18 ms.
Total runtime 69779 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-COL-AN15-CTLCardinality-2024-00
Could not compute solution for formula : Sudoku-COL-AN15-CTLCardinality-2024-01
Could not compute solution for formula : Sudoku-COL-AN15-CTLCardinality-2024-02
Could not compute solution for formula : Sudoku-COL-AN15-CTLCardinality-2024-05
Could not compute solution for formula : Sudoku-COL-AN15-CTLCardinality-2024-07
Could not compute solution for formula : Sudoku-COL-AN15-CTLCardinality-2024-09
Could not compute solution for formula : Sudoku-COL-AN15-CTLCardinality-2024-10
Could not compute solution for formula : Sudoku-COL-AN15-CTLCardinality-2024-11
Could not compute solution for formula : Sudoku-COL-AN15-CTLCardinality-2024-13
Could not compute solution for formula : Sudoku-COL-AN15-CTLCardinality-2024-14
Could not compute solution for formula : Sudoku-COL-AN15-CTLCardinality-2024-15

BK_STOP 1717264237469

--------------------
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-COL-AN15-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/544/ctl_0_
ctl formula name Sudoku-COL-AN15-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/544/ctl_1_
ctl formula name Sudoku-COL-AN15-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/544/ctl_2_
ctl formula name Sudoku-COL-AN15-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/544/ctl_3_
ctl formula name Sudoku-COL-AN15-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/544/ctl_4_
ctl formula name Sudoku-COL-AN15-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/544/ctl_5_
ctl formula name Sudoku-COL-AN15-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/544/ctl_6_
ctl formula name Sudoku-COL-AN15-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/544/ctl_7_
ctl formula name Sudoku-COL-AN15-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/544/ctl_8_
ctl formula name Sudoku-COL-AN15-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/544/ctl_9_
ctl formula name Sudoku-COL-AN15-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/544/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-COL-AN15"
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-COL-AN15, 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-171690532500521"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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