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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 1.2M Apr 12 12:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Apr 12 12:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1M Apr 12 10:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 15M Apr 12 10:17 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 702K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.2M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.2M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5M Apr 12 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.0M Apr 12 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6M Apr 12 12:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22M Apr 12 12:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 98K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 237K 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 1.5M 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-AN14-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717275150364

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:52:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:52:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:52:31] [INFO ] Load time of PNML (sax parser for PT used): 281 ms
[2024-06-01 20:52:31] [INFO ] Transformed 3332 places.
[2024-06-01 20:52:31] [INFO ] Transformed 2744 transitions.
[2024-06-01 20:52:31] [INFO ] Found NUPN structural information;
[2024-06-01 20:52:31] [INFO ] Parsed PT model containing 3332 places and 2744 transitions and 10976 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 177 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Sudoku-PT-AN14-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 74 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2024-06-01 20:52:32] [INFO ] Computed 588 invariants in 59 ms
[2024-06-01 20:52:33] [INFO ] Implicit Places using invariants in 1111 ms returned []
[2024-06-01 20:52:33] [INFO ] Invariant cache hit.
[2024-06-01 20:52:39] [INFO ] Implicit Places using invariants and state equation in 5974 ms returned []
Implicit Place search using SMT with State Equation took 7117 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 7231 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Support contains 3332 out of 3332 places after structural reductions.
[2024-06-01 20:52:40] [INFO ] Flatten gal took : 274 ms
[2024-06-01 20:52:40] [INFO ] Flatten gal took : 171 ms
[2024-06-01 20:52:40] [INFO ] Input system was already deterministic with 2744 transitions.
RANDOM walk for 40000 steps (232 resets) in 10592 ms. (3 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1043 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 785 ms. (50 steps per ms) remains 2/2 properties
[2024-06-01 20:52:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 392/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 2 (OVERLAPS) 2744/3136 variables, 392/784 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3136 variables, 2744/3528 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3136 variables, 0/3528 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 3724 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1978 ms.
Refiners :[Domain max(s): 3136/3332 constraints, Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 196/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2744/2940 variables, 196/392 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2940 variables, 2744/3136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2940 variables, 0/3136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/6076 variables, and 3528 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1671 ms.
Refiners :[Domain max(s): 2940/3332 constraints, Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3877ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.8 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 120 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 588/3332 places, 2744/2744 transitions.
RANDOM walk for 40000 steps (229 resets) in 7790 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 586 ms. (68 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 368117 steps, run timeout after 6001 ms. (steps per millisecond=61 ) properties seen :0 out of 1
Probabilistic random walk after 368117 steps, saw 286700 distinct states, run finished after 6004 ms. (steps per millisecond=61 ) properties seen :0
// Phase 1: matrix 2744 rows 588 cols
[2024-06-01 20:52:56] [INFO ] Computed 41 invariants in 236 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 382/578 variables, 31/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 382/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/588 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 10/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2744/3332 variables, 588/1217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3332 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/3332 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 1217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3601 ms.
Refiners :[Domain max(s): 588/588 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 382/578 variables, 31/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 382/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/588 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 10/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2744/3332 variables, 588/1217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3332 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/3332 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 1217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2097 ms.
Refiners :[Domain max(s): 588/588 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5994ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 196 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 18 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.15 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 74 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 20:53:02] [INFO ] Invariant cache hit.
[2024-06-01 20:53:05] [INFO ] Implicit Places using invariants in 2739 ms returned []
[2024-06-01 20:53:05] [INFO ] Invariant cache hit.
[2024-06-01 20:53:39] [INFO ] Performed 197/588 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 20:54:13] [INFO ] Performed 201/588 implicitness test of which 0 returned IMPLICIT in 65 seconds.
[2024-06-01 20:54:45] [INFO ] Performed 203/588 implicitness test of which 0 returned IMPLICIT in 98 seconds.
[2024-06-01 20:55:17] [INFO ] Performed 205/588 implicitness test of which 0 returned IMPLICIT in 130 seconds.
[2024-06-01 20:55:17] [INFO ] Timeout of Implicit test with SMT after 130 seconds.
[2024-06-01 20:55:17] [INFO ] Implicit Places using invariants and state equation in 132154 ms returned []
Implicit Place search using SMT with State Equation took 134900 ms to find 0 implicit places.
[2024-06-01 20:55:17] [INFO ] Redundant transitions in 133 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135122 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-01
Stuttering criterion allowed to conclude after 170 steps with 0 reset in 40 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-01 finished in 135451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0))&&F(p1))))))'
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 42 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2024-06-01 20:55:17] [INFO ] Computed 588 invariants in 20 ms
[2024-06-01 20:55:20] [INFO ] Implicit Places using invariants in 2560 ms returned []
[2024-06-01 20:55:20] [INFO ] Invariant cache hit.
[2024-06-01 20:55:29] [INFO ] Implicit Places using invariants and state equation in 8511 ms returned []
Implicit Place search using SMT with State Equation took 11078 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 11125 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-07
Product exploration timeout after 30640 steps with 308 reset in 10002 ms.
Product exploration timeout after 30560 steps with 307 reset in 10002 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 396 steps (0 resets) in 251 ms. (1 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
[2024-06-01 20:55:52] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-06-01 20:56:08] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 27 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 20:56:23] [INFO ] Invariant cache hit.
[2024-06-01 20:56:26] [INFO ] Implicit Places using invariants in 2840 ms returned []
[2024-06-01 20:56:26] [INFO ] Invariant cache hit.
[2024-06-01 20:56:34] [INFO ] Implicit Places using invariants and state equation in 8103 ms returned []
Implicit Place search using SMT with State Equation took 10961 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 10989 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 396 steps (0 resets) in 369 ms. (1 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
[2024-06-01 20:56:38] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-06-01 20:56:54] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Product exploration timeout after 29760 steps with 299 reset in 10001 ms.
Product exploration timeout after 29780 steps with 299 reset in 10002 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 82 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 20:57:30] [INFO ] Redundant transitions in 185 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 13 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 20:57:30] [INFO ] Invariant cache hit.
[2024-06-01 20:57:33] [INFO ] Implicit Places using invariants in 2978 ms returned []
[2024-06-01 20:57:33] [INFO ] Invariant cache hit.
[2024-06-01 20:57:41] [INFO ] Implicit Places using invariants and state equation in 8192 ms returned []
Implicit Place search using SMT with State Equation took 11185 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 11204 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Treatment of property Sudoku-PT-AN14-LTLCardinality-07 finished in 144539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(p1))))'
Support contains 4 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 153 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2024-06-01 20:57:42] [INFO ] Computed 41 invariants in 140 ms
[2024-06-01 20:57:46] [INFO ] Implicit Places using invariants in 3951 ms returned []
[2024-06-01 20:57:46] [INFO ] Invariant cache hit.
[2024-06-01 20:58:30] [INFO ] Performed 4/588 implicitness test of which 0 returned IMPLICIT in 42 seconds.
[2024-06-01 20:59:04] [INFO ] Performed 8/588 implicitness test of which 0 returned IMPLICIT in 76 seconds.
[2024-06-01 20:59:36] [INFO ] Performed 10/588 implicitness test of which 0 returned IMPLICIT in 108 seconds.
[2024-06-01 21:00:12] [INFO ] Performed 13/588 implicitness test of which 0 returned IMPLICIT in 143 seconds.
[2024-06-01 21:00:12] [INFO ] Timeout of Implicit test with SMT after 143 seconds.
[2024-06-01 21:00:12] [INFO ] Implicit Places using invariants and state equation in 145894 ms returned []
Implicit Place search using SMT with State Equation took 149873 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 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150037 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 269 steps with 89 reset in 95 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-09 finished in 150324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.8 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 109 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 21:00:12] [INFO ] Invariant cache hit.
[2024-06-01 21:00:16] [INFO ] Implicit Places using invariants in 3955 ms returned []
[2024-06-01 21:00:16] [INFO ] Invariant cache hit.
[2024-06-01 21:00:51] [INFO ] Performed 1/588 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 21:01:21] [INFO ] Performed 490/588 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-06-01 21:01:22] [INFO ] Implicit Places using invariants and state equation in 66135 ms returned []
Implicit Place search using SMT with State Equation took 70099 ms to find 0 implicit places.
[2024-06-01 21:01:23] [INFO ] Redundant transitions in 66 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70288 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-11
Stuttering criterion allowed to conclude after 235 steps with 1 reset in 52 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-11 finished in 70429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.9 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 91 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 21:01:23] [INFO ] Invariant cache hit.
[2024-06-01 21:01:27] [INFO ] Implicit Places using invariants in 3984 ms returned []
[2024-06-01 21:01:27] [INFO ] Invariant cache hit.
[2024-06-01 21:02:01] [INFO ] Performed 1/588 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 21:02:33] [INFO ] Performed 3/588 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 21:03:10] [INFO ] Performed 18/588 implicitness test of which 0 returned IMPLICIT in 101 seconds.
[2024-06-01 21:03:47] [INFO ] Performed 32/588 implicitness test of which 0 returned IMPLICIT in 137 seconds.
[2024-06-01 21:03:47] [INFO ] Timeout of Implicit test with SMT after 137 seconds.
[2024-06-01 21:03:47] [INFO ] Implicit Places using invariants and state equation in 139862 ms returned []
Implicit Place search using SMT with State Equation took 143847 ms to find 0 implicit places.
[2024-06-01 21:03:47] [INFO ] Redundant transitions in 66 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144026 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-12
Stuttering criterion allowed to conclude after 5169 steps with 29 reset in 855 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-12 finished in 144994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U G(p1))||X(p0))))'
Support contains 4 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2743 places and 0 transitions.
Iterating post reduction 0 with 2743 rules applied. Total rules applied 2743 place count 589 transition count 2744
Applied a total of 2743 rules in 84 ms. Remains 589 /3332 variables (removed 2743) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 589 cols
[2024-06-01 21:03:48] [INFO ] Computed 41 invariants in 216 ms
[2024-06-01 21:03:52] [INFO ] Implicit Places using invariants in 4110 ms returned []
[2024-06-01 21:03:52] [INFO ] Invariant cache hit.
[2024-06-01 21:04:26] [INFO ] Performed 1/589 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 21:04:58] [INFO ] Performed 3/589 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 21:05:14] [INFO ] Implicit Places using invariants and state equation in 82563 ms returned []
Implicit Place search using SMT with State Equation took 86708 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 : 589/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86793 ms. Remains : 589/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 83 steps with 27 reset in 32 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-14 finished in 87035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(G(p1))))))'
Support contains 2 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 69 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2024-06-01 21:05:15] [INFO ] Computed 41 invariants in 120 ms
[2024-06-01 21:05:19] [INFO ] Implicit Places using invariants in 4076 ms returned []
[2024-06-01 21:05:19] [INFO ] Invariant cache hit.
[2024-06-01 21:06:04] [INFO ] Performed 4/588 implicitness test of which 0 returned IMPLICIT in 42 seconds.
[2024-06-01 21:06:34] [INFO ] Performed 411/588 implicitness test of which 0 returned IMPLICIT in 72 seconds.
[2024-06-01 21:06:38] [INFO ] Implicit Places using invariants and state equation in 78842 ms returned []
Implicit Place search using SMT with State Equation took 82953 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 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83024 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-15
Stuttering criterion allowed to conclude after 168 steps with 0 reset in 42 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-15 finished in 83307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0))&&F(p1))))))'
Found a Shortening insensitive property : Sudoku-PT-AN14-LTLCardinality-07
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 37 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2024-06-01 21:06:38] [INFO ] Computed 588 invariants in 10 ms
[2024-06-01 21:06:41] [INFO ] Implicit Places using invariants in 2557 ms returned []
[2024-06-01 21:06:41] [INFO ] Invariant cache hit.
[2024-06-01 21:06:49] [INFO ] Implicit Places using invariants and state equation in 7586 ms returned []
Implicit Place search using SMT with State Equation took 10155 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 LI_LTL mode , in 1 iterations and 10193 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-07
Product exploration timeout after 30910 steps with 311 reset in 10001 ms.
Product exploration timeout after 30450 steps with 306 reset in 10004 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 396 steps (0 resets) in 425 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
[2024-06-01 21:07:13] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-06-01 21:07:29] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 15 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 21:07:44] [INFO ] Invariant cache hit.
[2024-06-01 21:07:46] [INFO ] Implicit Places using invariants in 2654 ms returned []
[2024-06-01 21:07:46] [INFO ] Invariant cache hit.
[2024-06-01 21:07:54] [INFO ] Implicit Places using invariants and state equation in 7855 ms returned []
Implicit Place search using SMT with State Equation took 10527 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 10546 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 396 steps (0 resets) in 246 ms. (1 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
[2024-06-01 21:07:58] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-06-01 21:08:14] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Product exploration timeout after 31600 steps with 318 reset in 10004 ms.
Product exploration timeout after 31110 steps with 313 reset in 10003 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 42 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 21:08:50] [INFO ] Redundant transitions in 88 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 23 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 21:08:50] [INFO ] Invariant cache hit.
[2024-06-01 21:08:52] [INFO ] Implicit Places using invariants in 2620 ms returned []
[2024-06-01 21:08:52] [INFO ] Invariant cache hit.
[2024-06-01 21:09:00] [INFO ] Implicit Places using invariants and state equation in 7519 ms returned []
Implicit Place search using SMT with State Equation took 10177 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 10202 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Treatment of property Sudoku-PT-AN14-LTLCardinality-07 finished in 142006 ms.
[2024-06-01 21:09:00] [INFO ] Flatten gal took : 125 ms
[2024-06-01 21:09:00] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 21:09:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3332 places, 2744 transitions and 10976 arcs took 19 ms.
Total runtime 989138 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024

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-AN14"
export BK_EXAMINATION="LTLCardinality"
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-AN14, examination is LTLCardinality"
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-171690532900675"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN14.tgz
mv Sudoku-PT-AN14 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;