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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 53M
-rw-r--r-- 1 mcc users 604K Apr 12 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 12 11:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.4M Apr 12 11:05 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 308K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 810K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 393K Apr 12 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9M Apr 12 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29M Apr 12 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 207K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 963K 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-AN12-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717273192401

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-AN12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:19:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:19:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:19:53] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2024-06-01 20:19:53] [INFO ] Transformed 2160 places.
[2024-06-01 20:19:53] [INFO ] Transformed 1728 transitions.
[2024-06-01 20:19:53] [INFO ] Found NUPN structural information;
[2024-06-01 20:19:53] [INFO ] Parsed PT model containing 2160 places and 1728 transitions and 6912 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 69 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN12-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 27 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2024-06-01 20:19:54] [INFO ] Computed 432 invariants in 36 ms
[2024-06-01 20:19:54] [INFO ] Implicit Places using invariants in 677 ms returned []
[2024-06-01 20:19:54] [INFO ] Invariant cache hit.
[2024-06-01 20:19:56] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 2263 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 2309 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 2160 out of 2160 places after structural reductions.
[2024-06-01 20:19:56] [INFO ] Flatten gal took : 193 ms
[2024-06-01 20:19:57] [INFO ] Flatten gal took : 129 ms
[2024-06-01 20:19:57] [INFO ] Input system was already deterministic with 1728 transitions.
RANDOM walk for 40000 steps (316 resets) in 7832 ms. (5 steps per ms) remains 7/20 properties
BEST_FIRST walk for 40004 steps (8 resets) in 827 ms. (48 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 582 ms. (68 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 550 ms. (72 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 427 ms. (93 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 434 ms. (91 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 459 ms. (86 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 622 ms. (64 steps per ms) remains 7/7 properties
[2024-06-01 20:20:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 432/432 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp11 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2160/3888 variables, and 864 constraints, problems are : Problem set: 2 solved, 5 unsolved in 3446 ms.
Refiners :[Domain max(s): 432/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 0/2160 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 432/432 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/432 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1728/2160 variables, 432/864 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2160 variables, 1728/2592 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2160 variables, 0/2592 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3888/3888 variables, and 4752 constraints, problems are : Problem set: 2 solved, 5 unsolved in 4780 ms.
Refiners :[Domain max(s): 2160/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 2160/2160 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8616ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 144 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=18 )
Parikh walk visited 5 properties in 1575 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-PT-AN12-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 85 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:20:11] [INFO ] Invariant cache hit.
[2024-06-01 20:20:13] [INFO ] Implicit Places using invariants in 2407 ms returned []
[2024-06-01 20:20:13] [INFO ] Invariant cache hit.
[2024-06-01 20:20:17] [INFO ] Implicit Places using invariants and state equation in 3304 ms returned []
Implicit Place search using SMT with State Equation took 5728 ms to find 0 implicit places.
[2024-06-01 20:20:17] [INFO ] Redundant transitions in 84 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 5907 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-00
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 33 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-00 finished in 6183 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(F(p0))||G(p1))))'
Support contains 288 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.13 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 73 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2024-06-01 20:20:17] [INFO ] Computed 35 invariants in 96 ms
[2024-06-01 20:20:18] [INFO ] Implicit Places using invariants in 944 ms returned []
[2024-06-01 20:20:18] [INFO ] Invariant cache hit.
[2024-06-01 20:20:39] [INFO ] Implicit Places using invariants and state equation in 20733 ms returned []
Implicit Place search using SMT with State Equation took 21683 ms to find 0 implicit places.
[2024-06-01 20:20:39] [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 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21834 ms. Remains : 432/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-02
Product exploration timeout after 85390 steps with 677 reset in 10001 ms.
Product exploration timeout after 84430 steps with 670 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 225 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (316 resets) in 6934 ms. (5 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 854 ms. (46 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 694 ms. (57 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 464 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 159895 steps, run timeout after 6024 ms. (steps per millisecond=26 ) properties seen :0 out of 4
Probabilistic random walk after 159895 steps, saw 132413 distinct states, run finished after 6034 ms. (steps per millisecond=26 ) properties seen :0
[2024-06-01 20:22:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 288/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 144/432 variables, 31/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 144/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2160/2160 variables, and 899 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2805 ms.
Refiners :[Domain max(s): 432/432 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 288/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 144/432 variables, 31/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 144/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1728/2160 variables, 432/899 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2160/2160 variables, and 899 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1117 ms.
Refiners :[Domain max(s): 432/432 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4156ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 143 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=11 )
Parikh walk visited 4 properties in 644 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 416 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 288 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 49 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:22:14] [INFO ] Invariant cache hit.
[2024-06-01 20:22:15] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-06-01 20:22:15] [INFO ] Invariant cache hit.
[2024-06-01 20:22:48] [INFO ] Performed 148/432 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 20:22:50] [INFO ] Implicit Places using invariants and state equation in 35227 ms returned []
Implicit Place search using SMT with State Equation took 36032 ms to find 0 implicit places.
[2024-06-01 20:22:51] [INFO ] Redundant transitions in 31 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 36128 ms. Remains : 432/432 places, 1728/1728 transitions.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 215 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (315 resets) in 5199 ms. (7 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 546 ms. (73 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 522 ms. (76 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 79164 steps, run timeout after 3007 ms. (steps per millisecond=26 ) properties seen :0 out of 4
Probabilistic random walk after 79164 steps, saw 79088 distinct states, run finished after 3008 ms. (steps per millisecond=26 ) properties seen :0
[2024-06-01 20:23:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 288/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 144/432 variables, 31/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 144/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1728/2160 variables, 432/899 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2160/2160 variables, and 899 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1510 ms.
Refiners :[Domain max(s): 432/432 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 288/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 144/432 variables, 31/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 144/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1728/2160 variables, 432/899 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2160/2160 variables, and 899 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1093 ms.
Refiners :[Domain max(s): 432/432 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2797ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 143 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=20 )
Parikh walk visited 4 properties in 631 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 436 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 92250 steps with 731 reset in 10001 ms.
Product exploration timeout after 91810 steps with 728 reset in 10001 ms.
Support contains 288 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 11 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:24:13] [INFO ] Invariant cache hit.
[2024-06-01 20:24:14] [INFO ] Implicit Places using invariants in 889 ms returned []
[2024-06-01 20:24:14] [INFO ] Invariant cache hit.
[2024-06-01 20:24:44] [INFO ] Implicit Places using invariants and state equation in 29695 ms returned []
Implicit Place search using SMT with State Equation took 30610 ms to find 0 implicit places.
[2024-06-01 20:24:44] [INFO ] Redundant transitions in 28 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 30662 ms. Remains : 432/432 places, 1728/1728 transitions.
Treatment of property Sudoku-PT-AN12-LTLCardinality-02 finished in 267183 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(F(G(F(G((!(p0 U !p1)&&G(!p0))))))))'
Support contains 2016 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 27 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2024-06-01 20:24:44] [INFO ] Computed 432 invariants in 9 ms
[2024-06-01 20:24:46] [INFO ] Implicit Places using invariants in 1480 ms returned []
[2024-06-01 20:24:46] [INFO ] Invariant cache hit.
[2024-06-01 20:24:48] [INFO ] Implicit Places using invariants and state equation in 2227 ms returned []
Implicit Place search using SMT with State Equation took 3710 ms to find 0 implicit places.
[2024-06-01 20:24:48] [INFO ] Redundant transitions in 29 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 3776 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-03
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 27 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-03 finished in 3930 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)))'
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.6 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 50 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2024-06-01 20:24:48] [INFO ] Computed 35 invariants in 55 ms
[2024-06-01 20:24:50] [INFO ] Implicit Places using invariants in 1599 ms returned []
[2024-06-01 20:24:50] [INFO ] Invariant cache hit.
[2024-06-01 20:24:56] [INFO ] Implicit Places using invariants and state equation in 6722 ms returned []
Implicit Place search using SMT with State Equation took 8325 ms to find 0 implicit places.
[2024-06-01 20:24:56] [INFO ] Redundant transitions in 31 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 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8419 ms. Remains : 432/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-04
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 17 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-04 finished in 8516 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)&&X((p1 U (p1&&G(p2)))))))'
Support contains 2016 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 10 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2024-06-01 20:24:57] [INFO ] Computed 432 invariants in 16 ms
[2024-06-01 20:24:58] [INFO ] Implicit Places using invariants in 1129 ms returned []
[2024-06-01 20:24:58] [INFO ] Invariant cache hit.
[2024-06-01 20:25:00] [INFO ] Implicit Places using invariants and state equation in 2514 ms returned []
Implicit Place search using SMT with State Equation took 3648 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 3661 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-05
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 28 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-05 finished in 3992 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 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.6 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 34 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2024-06-01 20:25:01] [INFO ] Computed 35 invariants in 40 ms
[2024-06-01 20:25:02] [INFO ] Implicit Places using invariants in 1415 ms returned []
[2024-06-01 20:25:02] [INFO ] Invariant cache hit.
[2024-06-01 20:25:09] [INFO ] Implicit Places using invariants and state equation in 7221 ms returned []
Implicit Place search using SMT with State Equation took 8639 ms to find 0 implicit places.
[2024-06-01 20:25:09] [INFO ] Redundant transitions in 29 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 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8715 ms. Remains : 432/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-06
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 20 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-06 finished in 8834 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((F(p0)&&G((!p1||X(G(!p2)))))))'
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 9 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2024-06-01 20:25:09] [INFO ] Computed 432 invariants in 16 ms
[2024-06-01 20:25:10] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-06-01 20:25:10] [INFO ] Invariant cache hit.
[2024-06-01 20:25:11] [INFO ] Implicit Places using invariants and state equation in 1492 ms returned []
Implicit Place search using SMT with State Equation took 1984 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 1995 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) p2), (AND p1 p2), p2, true, (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2))]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-07
Product exploration timeout after 85340 steps with 677 reset in 10001 ms.
Product exploration timeout after 84480 steps with 670 reset in 10001 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 p0 (NOT p2) p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 372 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, p2, p2, p2]
RANDOM walk for 40000 steps (315 resets) in 4644 ms. (8 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 217571 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 1
Probabilistic random walk after 217571 steps, saw 165145 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2024-06-01 20:45:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1728/1872 variables, 144/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1872 variables, 1728/2016 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1872 variables, 0/2016 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2160/3888 variables, and 2304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1393 ms.
Refiners :[Domain max(s): 1872/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 0/2160 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/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1728/1872 variables, 144/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1872 variables, 1728/2016 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1872 variables, 0/2016 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2160/3888 variables, and 2304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1430 ms.
Refiners :[Domain max(s): 1872/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 0/2160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2872ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.1 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 26 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 432/2160 places, 1728/1728 transitions.
RANDOM walk for 40000 steps (316 resets) in 4925 ms. (8 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 435 ms. (91 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 214474 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 1
Probabilistic random walk after 214474 steps, saw 164746 distinct states, run finished after 3003 ms. (steps per millisecond=71 ) properties seen :0
// Phase 1: matrix 1728 rows 432 cols
[2024-06-01 20:45:16] [INFO ] Computed 35 invariants in 46 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 285/429 variables, 32/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 285/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/432 variables, 3/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 3/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1728/2160 variables, 432/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2160/2160 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 709 ms.
Refiners :[Domain max(s): 432/432 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 432/432 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/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 285/429 variables, 32/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 285/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/432 variables, 3/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 3/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1728/2160 variables, 432/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2160/2160 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 673 ms.
Refiners :[Domain max(s): 432/432 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1463ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 144 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 19 factoid took 460 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 129 ms :[true, p2, p2, p2]
Support contains 144 out of 2160 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 10 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2024-06-01 20:45:18] [INFO ] Computed 432 invariants in 7 ms
[2024-06-01 20:45:19] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-06-01 20:45:19] [INFO ] Invariant cache hit.
[2024-06-01 20:45:20] [INFO ] Implicit Places using invariants and state equation in 1481 ms returned []
Implicit Place search using SMT with State Equation took 1960 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 1973 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 : [(NOT p2), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, p2, p2, p2]
RANDOM walk for 40000 steps (316 resets) in 4875 ms. (8 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 504 ms. (79 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 201518 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 201518 steps, saw 161950 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-06-01 20:45:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1728/1872 variables, 144/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1872 variables, 1728/2016 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1872 variables, 0/2016 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2160/3888 variables, and 2304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1414 ms.
Refiners :[Domain max(s): 1872/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 0/2160 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/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1728/1872 variables, 144/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1872 variables, 1728/2016 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1872 variables, 0/2016 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2160/3888 variables, and 2304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1371 ms.
Refiners :[Domain max(s): 1872/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 0/2160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2836ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.5 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 34 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 432/2160 places, 1728/1728 transitions.
RANDOM walk for 40000 steps (316 resets) in 4724 ms. (8 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 423 ms. (94 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 222792 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 1
Probabilistic random walk after 222792 steps, saw 165988 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
// Phase 1: matrix 1728 rows 432 cols
[2024-06-01 20:46:02] [INFO ] Computed 35 invariants in 41 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 285/429 variables, 32/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 285/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/432 variables, 3/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 3/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1728/2160 variables, 432/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2160/2160 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 639 ms.
Refiners :[Domain max(s): 432/432 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 432/432 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/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 285/429 variables, 32/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 285/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/432 variables, 3/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 3/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1728/2160 variables, 432/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2160 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2160/2160 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 671 ms.
Refiners :[Domain max(s): 432/432 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1406ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 144 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(NOT p2), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 107 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 117 ms :[true, p2, p2, p2]
Product exploration timeout after 84720 steps with 672 reset in 10003 ms.
Product exploration timeout after 82660 steps with 655 reset in 10001 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 128 ms :[true, p2, p2, p2]
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.5 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 70 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:46:24] [INFO ] Redundant transitions in 26 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 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 432/2160 places, 1728/1728 transitions.
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1728 places and 0 transitions.
Iterating post reduction 0 with 1728 rules applied. Total rules applied 1728 place count 432 transition count 1728
Applied a total of 1728 rules in 27 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:46:24] [INFO ] Invariant cache hit.
[2024-06-01 20:46:26] [INFO ] Implicit Places using invariants in 1557 ms returned []
[2024-06-01 20:46:26] [INFO ] Invariant cache hit.
[2024-06-01 20:46:33] [INFO ] Implicit Places using invariants and state equation in 7537 ms returned []
Implicit Place search using SMT with State Equation took 9099 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Starting structural reductions in LTL mode, iteration 1 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9130 ms. Remains : 432/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-PT-AN12-LTLCardinality-07 finished in 1284100 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||G(p1))))'
Support contains 4 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1727 places and 0 transitions.
Iterating post reduction 0 with 1727 rules applied. Total rules applied 1727 place count 433 transition count 1728
Applied a total of 1727 rules in 47 ms. Remains 433 /2160 variables (removed 1727) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 433 cols
[2024-06-01 20:46:34] [INFO ] Computed 35 invariants in 62 ms
[2024-06-01 20:46:36] [INFO ] Implicit Places using invariants in 2361 ms returned []
[2024-06-01 20:46:36] [INFO ] Invariant cache hit.
[2024-06-01 20:47:07] [INFO ] Performed 3/433 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 20:47:11] [INFO ] Implicit Places using invariants and state equation in 34667 ms returned []
Implicit Place search using SMT with State Equation took 37030 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 : 433/2160 places, 1728/1728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37080 ms. Remains : 433/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-08 finished in 37245 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(F(p0)))'
Support contains 4 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1727 places and 0 transitions.
Iterating post reduction 0 with 1727 rules applied. Total rules applied 1727 place count 433 transition count 1728
Applied a total of 1727 rules in 37 ms. Remains 433 /2160 variables (removed 1727) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 433 cols
[2024-06-01 20:47:11] [INFO ] Computed 35 invariants in 47 ms
[2024-06-01 20:47:13] [INFO ] Implicit Places using invariants in 2278 ms returned []
[2024-06-01 20:47:13] [INFO ] Invariant cache hit.
[2024-06-01 20:47:21] [INFO ] Implicit Places using invariants and state equation in 8224 ms returned []
Implicit Place search using SMT with State Equation took 10504 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 : 433/2160 places, 1728/1728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10542 ms. Remains : 433/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-12
Stuttering criterion allowed to conclude after 188 steps with 33 reset in 30 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-12 finished in 10658 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((p0&&G(p1)))) U (p1&&(p2 U !p0))))'
Support contains 5 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1728 places and 0 transitions.
Iterating post reduction 0 with 1728 rules applied. Total rules applied 1728 place count 432 transition count 1728
Applied a total of 1728 rules in 37 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2024-06-01 20:47:21] [INFO ] Computed 35 invariants in 42 ms
[2024-06-01 20:47:24] [INFO ] Implicit Places using invariants in 2447 ms returned []
[2024-06-01 20:47:24] [INFO ] Invariant cache hit.
[2024-06-01 20:47:33] [INFO ] Implicit Places using invariants and state equation in 9117 ms returned []
Implicit Place search using SMT with State Equation took 11566 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 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11603 ms. Remains : 432/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p1) p0), (OR (NOT p0) (NOT p1)), p0, (OR (NOT p0) (NOT p1)), true, (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 332 steps with 27 reset in 56 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-13 finished in 11986 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)&&F(p1)))))'
Support contains 3 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1728 places and 0 transitions.
Iterating post reduction 0 with 1728 rules applied. Total rules applied 1728 place count 432 transition count 1728
Applied a total of 1728 rules in 33 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:47:33] [INFO ] Invariant cache hit.
[2024-06-01 20:47:36] [INFO ] Implicit Places using invariants in 2377 ms returned []
[2024-06-01 20:47:36] [INFO ] Invariant cache hit.
[2024-06-01 20:47:45] [INFO ] Implicit Places using invariants and state equation in 8934 ms returned []
Implicit Place search using SMT with State Equation took 11313 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 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11348 ms. Remains : 432/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-15
Stuttering criterion allowed to conclude after 237 steps with 1 reset in 37 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-15 finished in 11575 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(F(p0))||G(p1))))'
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((F(p0)&&G((!p1||X(G(!p2)))))))'
[2024-06-01 20:47:45] [INFO ] Flatten gal took : 86 ms
[2024-06-01 20:47:45] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 20:47:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2160 places, 1728 transitions and 6912 arcs took 10 ms.
Total runtime 1672338 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-AN12"
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-AN12, 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-171690532900659"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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