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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 95M
-rw-r--r-- 1 mcc users 1.7M Apr 12 13:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.3M Apr 12 13:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5M Apr 12 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 23M Apr 12 11:56 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 717K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 903K Apr 12 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Apr 12 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4M Apr 12 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31M Apr 12 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 72K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.7M 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-BN16-LTLCardinality-00
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-01
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-02
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-03
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-04
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-05
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-06
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-07
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-08
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-09
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-10
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-11
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-12
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-13
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-14
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717279095544

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-BN16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:58:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 21:58:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:58:17] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2024-06-01 21:58:17] [INFO ] Transformed 5120 places.
[2024-06-01 21:58:17] [INFO ] Transformed 4096 transitions.
[2024-06-01 21:58:17] [INFO ] Found NUPN structural information;
[2024-06-01 21:58:17] [INFO ] Parsed PT model containing 5120 places and 4096 transitions and 20480 arcs in 438 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 104 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-BN16-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5120 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 42 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2024-06-01 21:58:17] [INFO ] Computed 1024 invariants in 72 ms
[2024-06-01 21:58:21] [INFO ] Implicit Places using invariants in 3451 ms returned []
[2024-06-01 21:58:21] [INFO ] Invariant cache hit.
[2024-06-01 21:58:36] [INFO ] Implicit Places using invariants and state equation in 15559 ms returned []
Implicit Place search using SMT with State Equation took 19042 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 4ms
Finished structural reductions in LTL mode , in 1 iterations and 19116 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Support contains 5120 out of 5120 places after structural reductions.
[2024-06-01 21:58:37] [INFO ] Flatten gal took : 409 ms
[2024-06-01 21:58:37] [INFO ] Flatten gal took : 268 ms
[2024-06-01 21:58:38] [INFO ] Input system was already deterministic with 4096 transitions.
RANDOM walk for 40000 steps (188 resets) in 22919 ms. (1 steps per ms) remains 8/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2856 ms. (14 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1470 ms. (27 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1170 ms. (34 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1508 ms. (26 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1121 ms. (35 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1607 ms. (24 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1507 ms. (26 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1453 ms. (27 steps per ms) remains 8/8 properties
[2024-06-01 21:58:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1024 variables, 1024/1024 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1024 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5120/9216 variables, and 2048 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5033 ms.
Refiners :[Domain max(s): 1024/5120 constraints, Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 0/5120 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1024 variables, 1024/1024 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1024 variables, 0/1024 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5120/9216 variables, and 2048 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5024 ms.
Refiners :[Domain max(s): 1024/5120 constraints, Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 0/5120 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10692ms problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1024 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Graph (complete) has 16384 edges and 5120 vertex of which 1024 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.13 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 89 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 1024/5120 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (188 resets) in 23440 ms. (1 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1184 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1760 ms. (22 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1245 ms. (32 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1792 ms. (22 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1533 ms. (26 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1406 ms. (28 steps per ms) remains 6/6 properties
Probabilistic random walk after 277725 steps, saw 277631 distinct states, run finished after 27066 ms. (steps per millisecond=10 ) properties seen :0
// Phase 1: matrix 4096 rows 1024 cols
[2024-06-01 21:59:36] [INFO ] Computed 168 invariants in 961 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1024 variables, 1024/1024 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1024 variables, 168/1192 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 0/1192 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4096/5120 variables, 1024/2216 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5120 variables, 0/2216 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/5120 variables, 0/2216 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5120/5120 variables, and 2216 constraints, problems are : Problem set: 4 solved, 2 unsolved in 3848 ms.
Refiners :[Domain max(s): 1024/1024 constraints, Generalized P Invariants (flows): 168/168 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 512/512 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/512 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 462/974 variables, 118/630 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/974 variables, 462/1092 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/974 variables, 0/1092 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/1024 variables, 50/1142 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1024 variables, 50/1192 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 0/1192 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4096/5120 variables, 1024/2216 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5120 variables, 0/2216 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/5120 variables, 0/2216 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5120/5120 variables, and 2216 constraints, problems are : Problem set: 4 solved, 2 unsolved in 2322 ms.
Refiners :[Domain max(s): 1024/1024 constraints, Generalized P Invariants (flows): 168/168 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 7495ms problems are : Problem set: 4 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 256 steps, including 0 resets, run visited all 2 properties in 25 ms. (steps per millisecond=10 )
Parikh walk visited 2 properties in 31 ms.
Successfully simplified 6 atomic propositions for a total of 9 simplifications.
FORMULA Sudoku-PT-BN16-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
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' '!(F((G(p0)||G(F(p1)))))'
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 178 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2024-06-01 21:59:43] [INFO ] Computed 1024 invariants in 23 ms
[2024-06-01 21:59:53] [INFO ] Implicit Places using invariants in 9605 ms returned []
[2024-06-01 21:59:53] [INFO ] Invariant cache hit.
[2024-06-01 22:00:16] [INFO ] Implicit Places using invariants and state equation in 23076 ms returned []
Implicit Place search using SMT with State Equation took 32687 ms to find 0 implicit places.
[2024-06-01 22:00:16] [INFO ] Redundant transitions in 282 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 33161 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-01
Stuttering criterion allowed to conclude after 211 steps with 0 reset in 113 ms.
FORMULA Sudoku-PT-BN16-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLCardinality-01 finished in 33543 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 4352 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 107 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:00:16] [INFO ] Invariant cache hit.
[2024-06-01 22:00:31] [INFO ] Implicit Places using invariants in 14723 ms returned []
[2024-06-01 22:00:31] [INFO ] Invariant cache hit.
[2024-06-01 22:00:58] [INFO ] Implicit Places using invariants and state equation in 26438 ms returned []
Implicit Place search using SMT with State Equation took 41171 ms to find 0 implicit places.
[2024-06-01 22:00:58] [INFO ] Redundant transitions in 142 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 41432 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-02
Product exploration timeout after 18780 steps with 89 reset in 10004 ms.
Product exploration timeout after 18670 steps with 88 reset in 10002 ms.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 516 steps (0 resets) in 356 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
[2024-06-01 22:01:23] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 4352 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 234 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:01:38] [INFO ] Invariant cache hit.
[2024-06-01 22:01:52] [INFO ] Implicit Places using invariants in 13733 ms returned []
[2024-06-01 22:01:52] [INFO ] Invariant cache hit.
[2024-06-01 22:02:20] [INFO ] Implicit Places using invariants and state equation in 28858 ms returned []
Implicit Place search using SMT with State Equation took 42599 ms to find 0 implicit places.
[2024-06-01 22:02:21] [INFO ] Redundant transitions in 313 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 43153 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 516 steps (0 resets) in 479 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2024-06-01 22:02:26] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration timeout after 17740 steps with 84 reset in 10005 ms.
Product exploration timeout after 17710 steps with 84 reset in 10005 ms.
Support contains 4352 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 116 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:03:01] [INFO ] Invariant cache hit.
[2024-06-01 22:03:14] [INFO ] Implicit Places using invariants in 13508 ms returned []
[2024-06-01 22:03:14] [INFO ] Invariant cache hit.
[2024-06-01 22:03:44] [INFO ] Implicit Places using invariants and state equation in 30123 ms returned []
Implicit Place search using SMT with State Equation took 43639 ms to find 0 implicit places.
[2024-06-01 22:03:45] [INFO ] Redundant transitions in 174 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 43944 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-PT-BN16-LTLCardinality-02 finished in 209032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0))) U G(p1)))'
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 34 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:03:45] [INFO ] Invariant cache hit.
[2024-06-01 22:03:54] [INFO ] Implicit Places using invariants in 8926 ms returned []
[2024-06-01 22:03:54] [INFO ] Invariant cache hit.
[2024-06-01 22:04:20] [INFO ] Implicit Places using invariants and state equation in 25517 ms returned []
Implicit Place search using SMT with State Equation took 34450 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 34490 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-04
Product exploration timeout after 9650 steps with 2208 reset in 10016 ms.
Product exploration timeout after 9350 steps with 2141 reset in 10010 ms.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT 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 4 factoid took 127 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 33 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
[2024-06-01 22:04:45] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 43 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:05:01] [INFO ] Invariant cache hit.
[2024-06-01 22:05:10] [INFO ] Implicit Places using invariants in 9358 ms returned []
[2024-06-01 22:05:10] [INFO ] Invariant cache hit.
[2024-06-01 22:05:35] [INFO ] Implicit Places using invariants and state equation in 25142 ms returned []
Implicit Place search using SMT with State Equation took 34504 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 34550 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT 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 4 factoid took 105 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 21 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
[2024-06-01 22:05:41] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration timeout after 9420 steps with 2149 reset in 10007 ms.
Product exploration timeout after 9580 steps with 2199 reset in 10008 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 228 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:06:17] [INFO ] Redundant transitions in 177 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 417 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 81 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:06:17] [INFO ] Invariant cache hit.
[2024-06-01 22:06:26] [INFO ] Implicit Places using invariants in 8772 ms returned []
[2024-06-01 22:06:26] [INFO ] Invariant cache hit.
[2024-06-01 22:06:52] [INFO ] Implicit Places using invariants and state equation in 26091 ms returned []
Implicit Place search using SMT with State Equation took 34866 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 34949 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-PT-BN16-LTLCardinality-04 finished in 186754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 512 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 1024 transition count 4096
Applied a total of 4096 rules in 205 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2024-06-01 22:06:53] [INFO ] Computed 168 invariants in 634 ms
[2024-06-01 22:06:57] [INFO ] Implicit Places using invariants in 4899 ms returned []
[2024-06-01 22:06:57] [INFO ] Invariant cache hit.
[2024-06-01 22:08:24] [INFO ] Performed 257/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:08:56] [INFO ] Performed 259/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 22:09:28] [INFO ] Performed 261/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 22:09:37] [INFO ] Implicit Places using invariants and state equation in 160042 ms returned []
Implicit Place search using SMT with State Equation took 164947 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 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165164 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-05
Product exploration timeout after 17570 steps with 8785 reset in 10002 ms.
Product exploration timeout after 16960 steps with 8480 reset in 10006 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
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 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLCardinality-05 finished in 186732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 82 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2024-06-01 22:09:59] [INFO ] Computed 1024 invariants in 30 ms
[2024-06-01 22:10:11] [INFO ] Implicit Places using invariants in 12047 ms returned []
[2024-06-01 22:10:11] [INFO ] Invariant cache hit.
[2024-06-01 22:10:37] [INFO ] Implicit Places using invariants and state equation in 26352 ms returned []
Implicit Place search using SMT with State Equation took 38409 ms to find 0 implicit places.
[2024-06-01 22:10:37] [INFO ] Redundant transitions in 164 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 38667 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-07
Product exploration timeout after 14890 steps with 115 reset in 10003 ms.
Product exploration timeout after 14750 steps with 114 reset in 10006 ms.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 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 50 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 512 steps (0 resets) in 604 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
[2024-06-01 22:11:07] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 68 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:11:22] [INFO ] Invariant cache hit.
[2024-06-01 22:11:33] [INFO ] Implicit Places using invariants in 11091 ms returned []
[2024-06-01 22:11:33] [INFO ] Invariant cache hit.
[2024-06-01 22:11:59] [INFO ] Implicit Places using invariants and state equation in 26480 ms returned []
Implicit Place search using SMT with State Equation took 37589 ms to find 0 implicit places.
[2024-06-01 22:11:59] [INFO ] Redundant transitions in 169 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 37843 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 512 steps (0 resets) in 460 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 85 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-06-01 22:12:07] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 13950 steps with 108 reset in 10003 ms.
Product exploration timeout after 14400 steps with 111 reset in 10001 ms.
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 70 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:12:43] [INFO ] Invariant cache hit.
[2024-06-01 22:12:54] [INFO ] Implicit Places using invariants in 11824 ms returned []
[2024-06-01 22:12:54] [INFO ] Invariant cache hit.
[2024-06-01 22:13:21] [INFO ] Implicit Places using invariants and state equation in 26854 ms returned []
Implicit Place search using SMT with State Equation took 38694 ms to find 0 implicit places.
[2024-06-01 22:13:21] [INFO ] Redundant transitions in 167 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 38939 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-PT-BN16-LTLCardinality-07 finished in 202974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Graph (complete) has 16384 edges and 5120 vertex of which 978 are kept as prefixes of interest. Removing 4142 places using SCC suffix rule.12 ms
Discarding 4142 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 432 ms. Remains 978 /5120 variables (removed 4142) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 978 cols
[2024-06-01 22:13:22] [INFO ] Computed 133 invariants in 125 ms
[2024-06-01 22:13:26] [INFO ] Implicit Places using invariants in 3536 ms returned []
[2024-06-01 22:13:26] [INFO ] Invariant cache hit.
[2024-06-01 22:14:06] [INFO ] Performed 1/978 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:14:39] [INFO ] Performed 3/978 implicitness test of which 0 returned IMPLICIT in 65 seconds.
[2024-06-01 22:15:13] [INFO ] Performed 6/978 implicitness test of which 0 returned IMPLICIT in 98 seconds.
[2024-06-01 22:15:50] [INFO ] Performed 97/978 implicitness test of which 0 returned IMPLICIT in 136 seconds.
[2024-06-01 22:15:50] [INFO ] Timeout of Implicit test with SMT after 136 seconds.
[2024-06-01 22:15:50] [INFO ] Implicit Places using invariants and state equation in 144138 ms returned []
Implicit Place search using SMT with State Equation took 147692 ms to find 0 implicit places.
[2024-06-01 22:15:50] [INFO ] Redundant transitions in 158 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 : 978/5120 places, 4096/4096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148292 ms. Remains : 978/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-09
Stuttering criterion allowed to conclude after 309 steps with 4 reset in 156 ms.
FORMULA Sudoku-PT-BN16-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLCardinality-09 finished in 148547 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 2 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 1024 transition count 4096
Applied a total of 4096 rules in 263 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2024-06-01 22:15:51] [INFO ] Computed 168 invariants in 643 ms
[2024-06-01 22:16:00] [INFO ] Implicit Places using invariants in 9643 ms returned []
[2024-06-01 22:16:00] [INFO ] Invariant cache hit.
[2024-06-01 22:17:28] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:18:01] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 22:18:33] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 97 seconds.
[2024-06-01 22:18:40] [INFO ] Implicit Places using invariants and state equation in 160025 ms returned []
Implicit Place search using SMT with State Equation took 169682 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 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169948 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-BN16-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLCardinality-12 finished in 170081 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0))) U G(p1)))'
Found a Shortening insensitive property : Sudoku-PT-BN16-LTLCardinality-04
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 62 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2024-06-01 22:18:41] [INFO ] Computed 1024 invariants in 30 ms
[2024-06-01 22:18:51] [INFO ] Implicit Places using invariants in 9784 ms returned []
[2024-06-01 22:18:51] [INFO ] Invariant cache hit.
[2024-06-01 22:19:16] [INFO ] Implicit Places using invariants and state equation in 25227 ms returned []
Implicit Place search using SMT with State Equation took 35018 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 35084 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-04
Product exploration timeout after 9560 steps with 2199 reset in 10022 ms.
Product exploration timeout after 9740 steps with 2243 reset in 10003 ms.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT 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 4 factoid took 126 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 25 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
[2024-06-01 22:19:42] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 43 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:19:57] [INFO ] Invariant cache hit.
[2024-06-01 22:20:06] [INFO ] Implicit Places using invariants in 8921 ms returned []
[2024-06-01 22:20:06] [INFO ] Invariant cache hit.
[2024-06-01 22:20:31] [INFO ] Implicit Places using invariants and state equation in 24957 ms returned []
Implicit Place search using SMT with State Equation took 33905 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 33949 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT 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 4 factoid took 240 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 29 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 393 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
[2024-06-01 22:20:39] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration timeout after 9400 steps with 2168 reset in 10003 ms.
Product exploration timeout after 9630 steps with 2225 reset in 10018 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 56 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:21:15] [INFO ] Redundant transitions in 159 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 228 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Support contains 4608 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 36 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:21:15] [INFO ] Invariant cache hit.
[2024-06-01 22:21:23] [INFO ] Implicit Places using invariants in 8771 ms returned []
[2024-06-01 22:21:23] [INFO ] Invariant cache hit.
[2024-06-01 22:21:48] [INFO ] Implicit Places using invariants and state equation in 24521 ms returned []
Implicit Place search using SMT with State Equation took 33294 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 33331 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-PT-BN16-LTLCardinality-04 finished in 187628 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)))'
[2024-06-01 22:21:48] [INFO ] Flatten gal took : 218 ms
[2024-06-01 22:21:48] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 9 ms.
[2024-06-01 22:21:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5120 places, 4096 transitions and 20480 arcs took 25 ms.
Total runtime 1412367 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-BN16"
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-BN16, 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-171690533000723"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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