About the Execution of ITS-Tools for Sudoku-COL-AN03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 10391.00 | 0.00 | 0.00 | TFFFFTTTFTFFFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r226-smll-174903491200337.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is Sudoku-COL-AN03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903491200337
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_pt
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 5 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 6.5K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-00
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-01
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-02
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-03
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-04
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-05
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-06
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-07
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-08
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-09
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-10
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-11
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-12
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-13
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-14
FORMULA_NAME Sudoku-COL-AN03-CTLCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1749208276221
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202505121319
[2025-06-06 11:11:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 11:11:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 11:11:18] [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.
[2025-06-06 11:11:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-06 11:11:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1041 ms
[2025-06-06 11:11:19] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 54 PT places and 27.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 56 ms.
[2025-06-06 11:11:19] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 10 ms.
[2025-06-06 11:11:19] [INFO ] Skeletonized 16 HLPN properties in 4 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 2 formulas.
Remains 16 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 40000 steps (3636 resets) in 1257 ms. (31 steps per ms) remains 63/71 properties
BEST_FIRST walk for 4000 steps (360 resets) in 141 ms. (28 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 92 ms. (43 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 88 ms. (44 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 29 ms. (133 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 35 ms. (111 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 34 ms. (114 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 29 ms. (133 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 51 ms. (76 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 33 ms. (117 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 51 ms. (76 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 26 ms. (148 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 37 ms. (105 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 30 ms. (129 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 34 ms. (114 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 23 ms. (166 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 23 ms. (166 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 30 ms. (129 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 60 ms. (65 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 36 ms. (108 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 29 ms. (133 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 36 ms. (108 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 30 ms. (129 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 33 ms. (117 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 30 ms. (129 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 34 ms. (114 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 25 ms. (153 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 23 ms. (166 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 28 ms. (137 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 26 ms. (148 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 29 ms. (133 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 30 ms. (129 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 24 ms. (160 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 26 ms. (148 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 23 ms. (166 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (360 resets) in 24 ms. (160 steps per ms) remains 63/63 properties
// Phase 1: matrix 1 rows 4 cols
[2025-06-06 11:11:21] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 63 solved, 0 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 374ms problems are : Problem set: 63 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 63 atomic propositions for a total of 16 simplifications.
FORMULA Sudoku-COL-AN03-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 11:11:21] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-06-06 11:11:21] [INFO ] Flatten gal took : 26 ms
[2025-06-06 11:11:21] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Sudoku-COL-AN03-CTLCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 11:11:21] [INFO ] Flatten gal took : 2 ms
Domain [N(3), N(3)] of place Rows breaks symmetries in sort N
[2025-06-06 11:11:21] [INFO ] Unfolded HLPN to a Petri net with 54 places and 27 transitions 108 arcs in 16 ms.
[2025-06-06 11:11:21] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Support contains 54 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 8 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 54 cols
[2025-06-06 11:11:21] [INFO ] Computed 27 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:11:21] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-06 11:11:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:11:21] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 204 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 231 ms. Remains : 54/54 places, 27/27 transitions.
Support contains 54 out of 54 places after structural reductions.
[2025-06-06 11:11:21] [INFO ] Flatten gal took : 16 ms
[2025-06-06 11:11:21] [INFO ] Flatten gal took : 16 ms
[2025-06-06 11:11:22] [INFO ] Input system was already deterministic with 27 transitions.
RANDOM walk for 40000 steps (4683 resets) in 3652 ms. (10 steps per ms) remains 25/29 properties
BEST_FIRST walk for 4004 steps (44 resets) in 68 ms. (58 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (41 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (41 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (40 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (40 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (42 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (44 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (42 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (43 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (41 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (44 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (42 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (43 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (41 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (42 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (42 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (41 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (41 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (42 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (43 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (43 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (42 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (43 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (42 resets) in 66 ms. (59 steps per ms) remains 25/25 properties
[2025-06-06 11:11:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
After SMT solving in domain Real declared 54/81 variables, and 27 constraints, problems are : Problem set: 25 solved, 0 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/54 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 155ms problems are : Problem set: 25 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 25 atomic propositions for a total of 6 simplifications.
[2025-06-06 11:11:23] [INFO ] Flatten gal took : 7 ms
[2025-06-06 11:11:23] [INFO ] Flatten gal took : 7 ms
[2025-06-06 11:11:23] [INFO ] Input system was already deterministic with 27 transitions.
Support contains 36 out of 54 places (down from 45) after GAL structural reductions.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
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-COL-AN03-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-CTLCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 27 transition count 27
Applied a total of 27 rules in 12 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2025-06-06 11:11:23] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:11:23] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-06 11:11:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:11:23] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 27/54 places, 27/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 27/54 places, 27/27 transitions.
[2025-06-06 11:11:23] [INFO ] Flatten gal took : 5 ms
[2025-06-06 11:11:23] [INFO ] Flatten gal took : 4 ms
[2025-06-06 11:11:23] [INFO ] Input system was already deterministic with 27 transitions.
[2025-06-06 11:11:23] [INFO ] Flatten gal took : 4 ms
[2025-06-06 11:11:23] [INFO ] Flatten gal took : 4 ms
[2025-06-06 11:11:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality18220832300307772248.gal : 3 ms
[2025-06-06 11:11:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality14267810387293336589.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18220832300307772248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14267810387293336589.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,10712,0.106641,6492,2,3419,5,13148,6,0,111,13916,0
Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.108055,6492,1,0,6,13148,7,1,210,13916,1
FORMULA Sudoku-COL-AN03-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 27 transition count 27
Applied a total of 27 rules in 2 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
[2025-06-06 11:11:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:11:23] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-06 11:11:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:11:24] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 27/54 places, 27/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 27/54 places, 27/27 transitions.
[2025-06-06 11:11:24] [INFO ] Flatten gal took : 6 ms
[2025-06-06 11:11:24] [INFO ] Flatten gal took : 5 ms
[2025-06-06 11:11:24] [INFO ] Input system was already deterministic with 27 transitions.
[2025-06-06 11:11:24] [INFO ] Flatten gal took : 4 ms
[2025-06-06 11:11:24] [INFO ] Flatten gal took : 3 ms
[2025-06-06 11:11:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality6079353766786193781.gal : 2 ms
[2025-06-06 11:11:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality92290687897193664.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6079353766786193781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality92290687897193664.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,10712,0.099146,6540,2,3419,5,13148,6,0,111,13916,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.10032,6540,1,0,6,13148,7,1,210,13916,1
FORMULA Sudoku-COL-AN03-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 27 transition count 27
Applied a total of 27 rules in 3 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
[2025-06-06 11:11:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:11:24] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-06 11:11:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:11:24] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 27/54 places, 27/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 27/54 places, 27/27 transitions.
[2025-06-06 11:11:24] [INFO ] Flatten gal took : 6 ms
[2025-06-06 11:11:24] [INFO ] Flatten gal took : 3 ms
[2025-06-06 11:11:24] [INFO ] Input system was already deterministic with 27 transitions.
[2025-06-06 11:11:24] [INFO ] Flatten gal took : 3 ms
[2025-06-06 11:11:24] [INFO ] Flatten gal took : 3 ms
[2025-06-06 11:11:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality10808749332095689930.gal : 2 ms
[2025-06-06 11:11:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality1627144695272583172.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10808749332095689930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1627144695272583172.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,10712,0.100039,6540,2,3419,5,13148,6,0,111,13916,0
Converting to forward existential form...Done !
original formula: AX(AX(EX(TRUE)))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...284
(forward)formula 0,1,0.767888,21048,1,0,92,122983,64,31,738,93924,59
FORMULA Sudoku-COL-AN03-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 54 cols
[2025-06-06 11:11:25] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:11:25] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-06 11:11:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:11:25] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 200 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 201 ms. Remains : 54/54 places, 27/27 transitions.
[2025-06-06 11:11:25] [INFO ] Flatten gal took : 4 ms
[2025-06-06 11:11:25] [INFO ] Flatten gal took : 4 ms
[2025-06-06 11:11:25] [INFO ] Input system was already deterministic with 27 transitions.
[2025-06-06 11:11:25] [INFO ] Flatten gal took : 4 ms
[2025-06-06 11:11:25] [INFO ] Flatten gal took : 4 ms
[2025-06-06 11:11:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality3490432996674436108.gal : 2 ms
[2025-06-06 11:11:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality18264917460914195713.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3490432996674436108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18264917460914195713.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,11776,0.105593,7436,2,7293,5,19941,6,0,138,7924,0
Converting to forward existential form...Done !
original formula: EX(AG((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+Cells_8)>(((((Board_0+Board_1)+(Board_2+Board_3))+(...400
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+Cells_...457
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.02277,29464,1,0,7,135475,15,1,3551,53314,5
FORMULA Sudoku-COL-AN03-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-06 11:11:26] [INFO ] Flatten gal took : 4 ms
[2025-06-06 11:11:26] [INFO ] Flatten gal took : 3 ms
Total runtime 8091 ms.
BK_STOP 1749208286612
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-AN03"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN03, 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 r226-smll-174903491200337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN03.tgz
mv Sudoku-COL-AN03 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.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 '
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 ;