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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 813K Apr 12 11:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.3M Apr 12 10:14 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 379K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Apr 12 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Apr 12 11:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.1M Apr 12 11:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 78K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 191K 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 1.2M 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-AN13-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717273626127

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-AN13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:27:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:27:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:27:07] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2024-06-01 20:27:07] [INFO ] Transformed 2704 places.
[2024-06-01 20:27:07] [INFO ] Transformed 2197 transitions.
[2024-06-01 20:27:07] [INFO ] Found NUPN structural information;
[2024-06-01 20:27:07] [INFO ] Parsed PT model containing 2704 places and 2197 transitions and 8788 arcs in 310 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 85 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN13-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 30 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-06-01 20:27:08] [INFO ] Computed 507 invariants in 40 ms
[2024-06-01 20:27:08] [INFO ] Implicit Places using invariants in 795 ms returned []
[2024-06-01 20:27:08] [INFO ] Invariant cache hit.
[2024-06-01 20:27:10] [INFO ] Implicit Places using invariants and state equation in 2011 ms returned []
Implicit Place search using SMT with State Equation took 2835 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 2886 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2704 out of 2704 places after structural reductions.
[2024-06-01 20:27:11] [INFO ] Flatten gal took : 244 ms
[2024-06-01 20:27:11] [INFO ] Flatten gal took : 142 ms
[2024-06-01 20:27:12] [INFO ] Input system was already deterministic with 2197 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (268 resets) in 12363 ms. (3 steps per ms) remains 9/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 572 ms. (69 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3025 ms. (13 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 530 ms. (75 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 514 ms. (77 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 802 ms. (49 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 517 ms. (77 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 830 ms. (48 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 549 ms. (72 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1021 ms. (39 steps per ms) remains 9/9 properties
[2024-06-01 20:27:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 2704/2704 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/2704 variables, 507/3211 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2704 variables, 0/3211 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2197/4901 variables, 2704/5915 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 5915 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5033 ms.
Refiners :[Domain max(s): 2704/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 2704/2704 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2704 variables, 507/3211 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2704 variables, 0/3211 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2197/4901 variables, 2704/5915 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4901/4901 variables, and 5915 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5029 ms.
Refiners :[Domain max(s): 2704/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10747ms problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 44 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 2704/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 8816 ms. (4 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 651 ms. (61 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3090 ms. (12 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 499 ms. (80 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 609 ms. (65 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 566 ms. (70 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 513 ms. (77 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 927 ms. (43 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 222403 steps, run timeout after 12001 ms. (steps per millisecond=18 ) properties seen :0 out of 7
Probabilistic random walk after 222403 steps, saw 216183 distinct states, run finished after 12005 ms. (steps per millisecond=18 ) properties seen :0
[2024-06-01 20:27:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 2704/2704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2704 variables, 507/3211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2704 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2197/4901 variables, 2704/5915 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4901 variables, 0/5915 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/4901 variables, 0/5915 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 5915 constraints, problems are : Problem set: 0 solved, 7 unsolved in 22542 ms.
Refiners :[Domain max(s): 2704/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 2704/2704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2704 variables, 507/3211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2704 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4901/4901 variables, and 5915 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45032 ms.
Refiners :[Domain max(s): 2704/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 68227ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 39 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 26 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:28:52] [INFO ] Invariant cache hit.
[2024-06-01 20:28:53] [INFO ] Implicit Places using invariants in 566 ms returned []
[2024-06-01 20:28:53] [INFO ] Invariant cache hit.
[2024-06-01 20:28:55] [INFO ] Implicit Places using invariants and state equation in 1912 ms returned []
Implicit Place search using SMT with State Equation took 2482 ms to find 0 implicit places.
[2024-06-01 20:28:55] [INFO ] Redundant transitions in 114 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2627 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-PT-AN13-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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' '!(X((p0&&((p1||F(p2)) U p3))))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 42 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:28:55] [INFO ] Invariant cache hit.
[2024-06-01 20:28:57] [INFO ] Implicit Places using invariants in 2131 ms returned []
[2024-06-01 20:28:57] [INFO ] Invariant cache hit.
[2024-06-01 20:29:00] [INFO ] Implicit Places using invariants and state equation in 3052 ms returned []
Implicit Place search using SMT with State Equation took 5186 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 5232 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-01
Product exploration timeout after 37320 steps with 18660 reset in 10003 ms.
Product exploration timeout after 37150 steps with 18575 reset in 10001 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 p3 (NOT p1) (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 20 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLCardinality-01 finished in 26905 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 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 74 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-06-01 20:29:22] [INFO ] Computed 38 invariants in 109 ms
[2024-06-01 20:29:25] [INFO ] Implicit Places using invariants in 2342 ms returned []
[2024-06-01 20:29:25] [INFO ] Invariant cache hit.
[2024-06-01 20:29:52] [INFO ] Implicit Places using invariants and state equation in 27814 ms returned []
Implicit Place search using SMT with State Equation took 30163 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 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30240 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-02
Product exploration timeout after 48630 steps with 24315 reset in 10001 ms.
Product exploration timeout after 48150 steps with 24075 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLCardinality-02 finished in 50771 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(F(p0)))))'
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 37 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-06-01 20:30:13] [INFO ] Computed 507 invariants in 17 ms
[2024-06-01 20:30:18] [INFO ] Implicit Places using invariants in 5180 ms returned []
[2024-06-01 20:30:18] [INFO ] Invariant cache hit.
[2024-06-01 20:30:24] [INFO ] Implicit Places using invariants and state equation in 5599 ms returned []
Implicit Place search using SMT with State Equation took 10784 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 10825 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-03
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 31 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-03 finished in 11015 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(p0)||X((p0 U (X(p1) U ((p1&&X(p1))||X(G(p1))))))))'
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 23 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:30:24] [INFO ] Invariant cache hit.
[2024-06-01 20:30:27] [INFO ] Implicit Places using invariants in 3286 ms returned []
[2024-06-01 20:30:27] [INFO ] Invariant cache hit.
[2024-06-01 20:30:32] [INFO ] Implicit Places using invariants and state equation in 4375 ms returned []
Implicit Place search using SMT with State Equation took 7664 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 7691 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-05
Product exploration timeout after 38840 steps with 262 reset in 10003 ms.
Product exploration timeout after 38930 steps with 262 reset in 10002 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 148 ms. Reduced automaton from 8 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
RANDOM walk for 40000 steps (268 resets) in 6462 ms. (6 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2427 ms. (16 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2191 ms. (18 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 494 ms. (80 steps per ms) remains 3/3 properties
[2024-06-01 20:30:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 2366/2366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 169/2535 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2366 variables, 0/2535 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/4901 variables, and 2873 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2857 ms.
Refiners :[Domain max(s): 2366/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 2366/2366 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 169/2535 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2366 variables, 0/2535 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 2873 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2224 ms.
Refiners :[Domain max(s): 2366/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5513ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 36 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 2704/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 6233 ms. (6 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2104 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 482 ms. (82 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 248643 steps, run timeout after 6054 ms. (steps per millisecond=41 ) properties seen :0 out of 2
Probabilistic random walk after 248643 steps, saw 221015 distinct states, run finished after 6055 ms. (steps per millisecond=41 ) properties seen :0
[2024-06-01 20:31:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 2366/2366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 169/2535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2366 variables, 0/2535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 338/2704 variables, 338/2873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2704 variables, 338/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2704 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2197/4901 variables, 2704/5915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4901 variables, 0/5915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/4901 variables, 0/5915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 5915 constraints, problems are : Problem set: 0 solved, 2 unsolved in 40000 ms.
Refiners :[Domain max(s): 2704/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 2366/2366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 169/2535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2366 variables, 0/2535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 2873 constraints, problems are : Problem set: 0 solved, 2 unsolved in 13444 ms.
Refiners :[Domain max(s): 2366/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 53658ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 47 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 34 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:32:04] [INFO ] Invariant cache hit.
[2024-06-01 20:32:07] [INFO ] Implicit Places using invariants in 3460 ms returned []
[2024-06-01 20:32:07] [INFO ] Invariant cache hit.
[2024-06-01 20:32:12] [INFO ] Implicit Places using invariants and state equation in 4229 ms returned []
Implicit Place search using SMT with State Equation took 7699 ms to find 0 implicit places.
[2024-06-01 20:32:12] [INFO ] Redundant transitions in 114 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7856 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 305 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 20 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:32:13] [INFO ] Invariant cache hit.
[2024-06-01 20:32:16] [INFO ] Implicit Places using invariants in 3296 ms returned []
[2024-06-01 20:32:16] [INFO ] Invariant cache hit.
[2024-06-01 20:32:20] [INFO ] Implicit Places using invariants and state equation in 4225 ms returned []
Implicit Place search using SMT with State Equation took 7525 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 7547 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 p1 p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 137 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
RANDOM walk for 40000 steps (268 resets) in 6619 ms. (6 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 493 ms. (80 steps per ms) remains 1/1 properties
[2024-06-01 20:32:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2197/2366 variables, 169/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/2366 variables, 2197/2535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2366 variables, 0/2535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/4901 variables, and 2873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1461 ms.
Refiners :[Domain max(s): 2366/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 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/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2197/2366 variables, 169/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2366 variables, 2197/2535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2366 variables, 0/2535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 2873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1212 ms.
Refiners :[Domain max(s): 2366/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2717ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.5 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 46 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 507/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 5506 ms. (7 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 478 ms. (83 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 223694 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 1
Probabilistic random walk after 223694 steps, saw 216407 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
// Phase 1: matrix 2197 rows 507 cols
[2024-06-01 20:32:30] [INFO ] Computed 38 invariants in 60 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 332/501 variables, 32/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 332/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/507 variables, 6/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 6/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2197/2704 variables, 507/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3334 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 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/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 332/501 variables, 32/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 332/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/507 variables, 6/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 6/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2197/2704 variables, 507/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2008 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5449ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 15 ms.
Knowledge obtained : [(AND p1 p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 228 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration timeout after 41270 steps with 278 reset in 10001 ms.
Product exploration timeout after 41150 steps with 277 reset in 10003 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 73 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:32:57] [INFO ] Redundant transitions in 33 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 113 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 20 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-06-01 20:32:57] [INFO ] Computed 507 invariants in 15 ms
[2024-06-01 20:33:01] [INFO ] Implicit Places using invariants in 3593 ms returned []
[2024-06-01 20:33:01] [INFO ] Invariant cache hit.
[2024-06-01 20:33:05] [INFO ] Implicit Places using invariants and state equation in 4214 ms returned []
Implicit Place search using SMT with State Equation took 7821 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 7844 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-PT-AN13-LTLCardinality-05 finished in 161466 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(((p0 U p1)&&G(F(p2)))))'
Support contains 338 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.4 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-06-01 20:33:05] [INFO ] Computed 38 invariants in 50 ms
[2024-06-01 20:33:07] [INFO ] Implicit Places using invariants in 1285 ms returned []
[2024-06-01 20:33:07] [INFO ] Invariant cache hit.
[2024-06-01 20:33:21] [INFO ] Implicit Places using invariants and state equation in 13991 ms returned []
Implicit Place search using SMT with State Equation took 15278 ms to find 0 implicit places.
[2024-06-01 20:33:21] [INFO ] Redundant transitions in 39 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 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15353 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-07
Product exploration timeout after 75160 steps with 507 reset in 10002 ms.
Product exploration timeout after 74470 steps with 502 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 p2 p1), (X p1), (X p2), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (268 resets) in 7006 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 569 ms. (70 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 445272 steps, run timeout after 6001 ms. (steps per millisecond=74 ) properties seen :0 out of 1
Probabilistic random walk after 445272 steps, saw 251824 distinct states, run finished after 6001 ms. (steps per millisecond=74 ) properties seen :0
[2024-06-01 20:33:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 975 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 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/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2588 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3600ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 30 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 507/507 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 6982 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 569 ms. (70 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 448013 steps, run timeout after 6001 ms. (steps per millisecond=74 ) properties seen :0 out of 1
Probabilistic random walk after 448013 steps, saw 252347 distinct states, run finished after 6001 ms. (steps per millisecond=74 ) properties seen :0
[2024-06-01 20:34:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2197/2704 variables, 507/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1001 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 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/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9351 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10387ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 30 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 507/507 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 22 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:34:12] [INFO ] Invariant cache hit.
[2024-06-01 20:34:14] [INFO ] Implicit Places using invariants in 2078 ms returned []
[2024-06-01 20:34:14] [INFO ] Invariant cache hit.
[2024-06-01 20:34:30] [INFO ] Implicit Places using invariants and state equation in 15937 ms returned []
Implicit Place search using SMT with State Equation took 18019 ms to find 0 implicit places.
[2024-06-01 20:34:30] [INFO ] Redundant transitions in 37 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18087 ms. Remains : 507/507 places, 2197/2197 transitions.
Knowledge obtained : [(AND p2 p1), (X p1), (X p2), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p2), (NOT p2)]
Support contains 169 out of 507 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 13 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:34:30] [INFO ] Invariant cache hit.
[2024-06-01 20:34:31] [INFO ] Implicit Places using invariants in 1099 ms returned []
[2024-06-01 20:34:31] [INFO ] Invariant cache hit.
[2024-06-01 20:34:45] [INFO ] Implicit Places using invariants and state equation in 13598 ms returned []
Implicit Place search using SMT with State Equation took 14700 ms to find 0 implicit places.
[2024-06-01 20:34:45] [INFO ] Redundant transitions in 39 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 14767 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (268 resets) in 7124 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 566 ms. (70 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 443948 steps, run timeout after 6001 ms. (steps per millisecond=73 ) properties seen :0 out of 1
Probabilistic random walk after 443948 steps, saw 251569 distinct states, run finished after 6001 ms. (steps per millisecond=73 ) properties seen :0
[2024-06-01 20:34:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1004 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 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/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2572 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3621ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 33 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 507/507 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 6976 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 625 ms. (63 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 445716 steps, run timeout after 6001 ms. (steps per millisecond=74 ) properties seen :0 out of 1
Probabilistic random walk after 445716 steps, saw 251892 distinct states, run finished after 6001 ms. (steps per millisecond=74 ) properties seen :0
[2024-06-01 20:35:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2197/2704 variables, 507/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1045 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 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/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9429 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10505ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 22 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 507/507 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 22 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:35:16] [INFO ] Invariant cache hit.
[2024-06-01 20:35:18] [INFO ] Implicit Places using invariants in 2098 ms returned []
[2024-06-01 20:35:18] [INFO ] Invariant cache hit.
[2024-06-01 20:35:35] [INFO ] Implicit Places using invariants and state equation in 16284 ms returned []
Implicit Place search using SMT with State Equation took 18386 ms to find 0 implicit places.
[2024-06-01 20:35:35] [INFO ] Redundant transitions in 40 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18455 ms. Remains : 507/507 places, 2197/2197 transitions.
Knowledge obtained : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (NOT p2)]
Product exploration timeout after 75250 steps with 507 reset in 10001 ms.
Product exploration timeout after 74640 steps with 503 reset in 10001 ms.
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 32 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:35:55] [INFO ] Invariant cache hit.
[2024-06-01 20:35:57] [INFO ] Implicit Places using invariants in 2257 ms returned []
[2024-06-01 20:35:57] [INFO ] Invariant cache hit.
[2024-06-01 20:36:14] [INFO ] Implicit Places using invariants and state equation in 16421 ms returned []
Implicit Place search using SMT with State Equation took 18680 ms to find 0 implicit places.
[2024-06-01 20:36:14] [INFO ] Redundant transitions in 39 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 18764 ms. Remains : 507/507 places, 2197/2197 transitions.
Treatment of property Sudoku-PT-AN13-LTLCardinality-07 finished in 188473 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(X((X(!F(!X(p0))) U p0)))))'
Support contains 2 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.5 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 54 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:36:14] [INFO ] Invariant cache hit.
[2024-06-01 20:36:17] [INFO ] Implicit Places using invariants in 3231 ms returned []
[2024-06-01 20:36:17] [INFO ] Invariant cache hit.
[2024-06-01 20:36:47] [INFO ] Implicit Places using invariants and state equation in 30169 ms returned []
Implicit Place search using SMT with State Equation took 33401 ms to find 0 implicit places.
[2024-06-01 20:36:47] [INFO ] Redundant transitions in 32 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 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33497 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-08
Stuttering criterion allowed to conclude after 1779 steps with 11 reset in 229 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-08 finished in 33784 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(G(p0))))'
Support contains 1 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 46 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:36:48] [INFO ] Invariant cache hit.
[2024-06-01 20:36:51] [INFO ] Implicit Places using invariants in 3349 ms returned []
[2024-06-01 20:36:51] [INFO ] Invariant cache hit.
[2024-06-01 20:37:22] [INFO ] Implicit Places using invariants and state equation in 30576 ms returned []
Implicit Place search using SMT with State Equation took 33928 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 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33974 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-09 finished in 34115 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)&&F(p1)&&F(G(p2)))))'
Support contains 4 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 508 are kept as prefixes of interest. Removing 2196 places using SCC suffix rule.6 ms
Discarding 2196 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 76 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2024-06-01 20:37:22] [INFO ] Computed 38 invariants in 83 ms
[2024-06-01 20:37:25] [INFO ] Implicit Places using invariants in 3405 ms returned []
[2024-06-01 20:37:25] [INFO ] Invariant cache hit.
[2024-06-01 20:37:57] [INFO ] Performed 403/508 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 20:37:59] [INFO ] Implicit Places using invariants and state equation in 33370 ms returned []
Implicit Place search using SMT with State Equation took 36782 ms to find 0 implicit places.
[2024-06-01 20:37:59] [INFO ] Redundant transitions in 38 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 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36908 ms. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-10
Stuttering criterion allowed to conclude after 149 steps with 0 reset in 23 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-10 finished in 37095 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(p1)||p0))))'
Support contains 2 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 508 are kept as prefixes of interest. Removing 2196 places using SCC suffix rule.7 ms
Discarding 2196 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 56 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2024-06-01 20:37:59] [INFO ] Computed 38 invariants in 54 ms
[2024-06-01 20:38:02] [INFO ] Implicit Places using invariants in 3325 ms returned []
[2024-06-01 20:38:02] [INFO ] Invariant cache hit.
[2024-06-01 20:38:45] [INFO ] Performed 3/508 implicitness test of which 0 returned IMPLICIT in 38 seconds.
[2024-06-01 20:39:18] [INFO ] Performed 17/508 implicitness test of which 0 returned IMPLICIT in 71 seconds.
[2024-06-01 20:39:25] [INFO ] Implicit Places using invariants and state equation in 82499 ms returned []
Implicit Place search using SMT with State Equation took 85825 ms to find 0 implicit places.
[2024-06-01 20:39:25] [INFO ] Redundant transitions in 33 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 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85923 ms. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-11
Stuttering criterion allowed to conclude after 735 steps with 4 reset in 96 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-11 finished in 86117 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 4 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 508 are kept as prefixes of interest. Removing 2196 places using SCC suffix rule.8 ms
Discarding 2196 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 59 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2024-06-01 20:39:25] [INFO ] Computed 38 invariants in 58 ms
[2024-06-01 20:39:28] [INFO ] Implicit Places using invariants in 3403 ms returned []
[2024-06-01 20:39:28] [INFO ] Invariant cache hit.
[2024-06-01 20:40:00] [INFO ] Performed 363/508 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 20:40:03] [INFO ] Implicit Places using invariants and state equation in 34212 ms returned []
Implicit Place search using SMT with State Equation took 37618 ms to find 0 implicit places.
[2024-06-01 20:40:03] [INFO ] Redundant transitions in 36 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 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37725 ms. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-12
Stuttering criterion allowed to conclude after 145 steps with 0 reset in 22 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-12 finished in 37801 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' '!((((p0&&X(p1)) U p2)||X(X(G(p3)))))'
Support contains 7 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2194 places and 0 transitions.
Iterating post reduction 0 with 2194 rules applied. Total rules applied 2194 place count 510 transition count 2197
Applied a total of 2194 rules in 48 ms. Remains 510 /2704 variables (removed 2194) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 510 cols
[2024-06-01 20:40:03] [INFO ] Computed 38 invariants in 143 ms
[2024-06-01 20:40:06] [INFO ] Implicit Places using invariants in 3172 ms returned []
[2024-06-01 20:40:06] [INFO ] Invariant cache hit.
[2024-06-01 20:40:41] [INFO ] Performed 1/510 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 20:40:51] [INFO ] Implicit Places using invariants and state equation in 44684 ms returned []
Implicit Place search using SMT with State Equation took 47857 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 : 510/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47907 ms. Remains : 510/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, (OR (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-13 finished in 48173 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(p0)||X((p0 U (X(p1) U ((p1&&X(p1))||X(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' '!(F(((p0 U p1)&&G(F(p2)))))'
[2024-06-01 20:40:51] [INFO ] Flatten gal took : 108 ms
[2024-06-01 20:40:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2024-06-01 20:40:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2704 places, 2197 transitions and 8788 arcs took 15 ms.
Total runtime 824555 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-AN13"
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-AN13, 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-171690532900667"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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