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.r399-tall-171690530500531.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 greatspnxred
Input is Sudoku-COL-AN16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530500531
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.5K Apr 12 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 10:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 10:23 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 3.6K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 14:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 14:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN16-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717049046151

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 06:04:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 06:04:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 06:04:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 06:04:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 06:04:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 534 ms
[2024-05-30 06:04:08] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4864 PT places and 4096.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 06:04:08] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-05-30 06:04:08] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 7 formulas.
FORMULA Sudoku-COL-AN16-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40244 steps (152 resets) in 133 ms. (300 steps per ms) remains 6/17 properties
BEST_FIRST walk for 40244 steps (152 resets) in 44 ms. (894 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40244 steps (152 resets) in 31 ms. (1257 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40244 steps (152 resets) in 59 ms. (670 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40244 steps (152 resets) in 39 ms. (1006 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40244 steps (152 resets) in 29 ms. (1341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40244 steps (152 resets) in 36 ms. (1087 steps per ms) remains 6/6 properties
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 06:04:08] [INFO ] Computed 3 invariants in 4 ms
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 7 constraints, problems are : Problem set: 5 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5 variables, 1/8 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/5 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 8 constraints, problems are : Problem set: 5 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 199ms problems are : Problem set: 5 solved, 1 unsolved
Finished Parikh walk after 128 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=128 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
FORMULA Sudoku-COL-AN16-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 06:04:08] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-30 06:04:08] [INFO ] Flatten gal took : 13 ms
FORMULA Sudoku-COL-AN16-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 06:04:08] [INFO ] Flatten gal took : 1 ms
Domain [N(16), N(16)] of place Rows breaks symmetries in sort N
[2024-05-30 06:04:08] [INFO ] Unfolded HLPN to a Petri net with 4864 places and 4096 transitions 16384 arcs in 72 ms.
[2024-05-30 06:04:08] [INFO ] Unfolded 7 HLPN properties in 4 ms.
Support contains 4864 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 38 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2024-05-30 06:04:09] [INFO ] Computed 768 invariants in 78 ms
[2024-05-30 06:04:10] [INFO ] Implicit Places using invariants in 1099 ms returned []
[2024-05-30 06:04:10] [INFO ] Invariant cache hit.
[2024-05-30 06:04:20] [INFO ] Implicit Places using invariants and state equation in 9873 ms returned []
Implicit Place search using SMT with State Equation took 10985 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 11049 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Support contains 4864 out of 4864 places after structural reductions.
[2024-05-30 06:04:20] [INFO ] Flatten gal took : 388 ms
[2024-05-30 06:04:21] [INFO ] Flatten gal took : 231 ms
[2024-05-30 06:04:21] [INFO ] Input system was already deterministic with 4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 23803 ms. (1 steps per ms) remains 10/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1669 ms. (23 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 958 ms. (41 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1900 ms. (21 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1584 ms. (25 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 775 ms. (51 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1386 ms. (28 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9327 ms. (4 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 972 ms. (41 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 819 ms. (48 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 796 ms. (50 steps per ms) remains 10/10 properties
[2024-05-30 06:04:33] [INFO ] Invariant cache hit.
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 4 solved, 6 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4608 variables, 512/512 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4608 variables, 0/512 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 4 solved, 6 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11724ms problems are : Problem set: 4 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4608 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 130 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 18656 ms. (2 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 758 ms. (52 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 698 ms. (57 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8627 ms. (4 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 731 ms. (54 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 712 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 725 ms. (55 steps per ms) remains 6/6 properties
Probabilistic random walk after 143970 steps, saw 143930 distinct states, run finished after 21107 ms. (steps per millisecond=6 ) properties seen :0
[2024-05-30 06:05:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4608 variables, 512/512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4608 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4608 variables, 512/512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4608 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 91435ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4608 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 57 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 95 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:06:45] [INFO ] Invariant cache hit.
[2024-05-30 06:06:47] [INFO ] Implicit Places using invariants in 1852 ms returned []
[2024-05-30 06:06:47] [INFO ] Invariant cache hit.
[2024-05-30 06:06:58] [INFO ] Implicit Places using invariants and state equation in 11243 ms returned []
Implicit Place search using SMT with State Equation took 13096 ms to find 0 implicit places.
[2024-05-30 06:06:59] [INFO ] Redundant transitions in 253 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 13454 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Successfully simplified 4 atomic propositions for a total of 7 simplifications.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 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' '!(X((p0&&F(p1))))'
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 106 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:06:59] [INFO ] Invariant cache hit.
[2024-05-30 06:07:01] [INFO ] Implicit Places using invariants in 2563 ms returned []
[2024-05-30 06:07:01] [INFO ] Invariant cache hit.
[2024-05-30 06:07:15] [INFO ] Implicit Places using invariants and state equation in 13302 ms returned []
Implicit Place search using SMT with State Equation took 15872 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 15984 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Sudoku-COL-AN16-LTLCardinality-00
Stuttering criterion allowed to conclude after 228 steps with 0 reset in 103 ms.
FORMULA Sudoku-COL-AN16-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN16-LTLCardinality-00 finished in 16412 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)))'
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 31 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:07:15] [INFO ] Invariant cache hit.
[2024-05-30 06:07:18] [INFO ] Implicit Places using invariants in 2498 ms returned []
[2024-05-30 06:07:18] [INFO ] Invariant cache hit.
[2024-05-30 06:07:31] [INFO ] Implicit Places using invariants and state equation in 13458 ms returned []
Implicit Place search using SMT with State Equation took 15962 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 15997 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN16-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 129 steps with 0 reset in 77 ms.
FORMULA Sudoku-COL-AN16-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN16-LTLCardinality-03 finished in 16187 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 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 87 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:07:31] [INFO ] Invariant cache hit.
[2024-05-30 06:07:35] [INFO ] Implicit Places using invariants in 3304 ms returned []
[2024-05-30 06:07:35] [INFO ] Invariant cache hit.
[2024-05-30 06:07:49] [INFO ] Implicit Places using invariants and state equation in 14585 ms returned []
Implicit Place search using SMT with State Equation took 17901 ms to find 0 implicit places.
[2024-05-30 06:07:50] [INFO ] Redundant transitions in 248 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 18249 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN16-LTLCardinality-04
Product exploration timeout after 24310 steps with 107 reset in 10003 ms.
Product exploration timeout after 24040 steps with 106 reset in 10005 ms.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 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 81 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 31 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 15 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 114 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-30 06:08:14] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 83 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:08:29] [INFO ] Invariant cache hit.
[2024-05-30 06:08:32] [INFO ] Implicit Places using invariants in 3166 ms returned []
[2024-05-30 06:08:32] [INFO ] Invariant cache hit.
[2024-05-30 06:08:46] [INFO ] Implicit Places using invariants and state equation in 14461 ms returned []
Implicit Place search using SMT with State Equation took 17630 ms to find 0 implicit places.
[2024-05-30 06:08:47] [INFO ] Redundant transitions in 157 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 17888 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 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 120 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 27 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 23 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 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-30 06:08:51] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration timeout after 24270 steps with 107 reset in 10002 ms.
Product exploration timeout after 24300 steps with 107 reset in 10003 ms.
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 66 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:09:26] [INFO ] Invariant cache hit.
[2024-05-30 06:09:29] [INFO ] Implicit Places using invariants in 3218 ms returned []
[2024-05-30 06:09:29] [INFO ] Invariant cache hit.
[2024-05-30 06:09:44] [INFO ] Implicit Places using invariants and state equation in 14516 ms returned []
Implicit Place search using SMT with State Equation took 17742 ms to find 0 implicit places.
[2024-05-30 06:09:44] [INFO ] Redundant transitions in 162 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 17982 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Treatment of property Sudoku-COL-AN16-LTLCardinality-04 finished in 133095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||X(X(p1)))))'
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 29 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:09:44] [INFO ] Invariant cache hit.
[2024-05-30 06:09:47] [INFO ] Implicit Places using invariants in 2514 ms returned []
[2024-05-30 06:09:47] [INFO ] Invariant cache hit.
[2024-05-30 06:10:00] [INFO ] Implicit Places using invariants and state equation in 13219 ms returned []
Implicit Place search using SMT with State Equation took 15736 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 15767 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1)), (NOT p1), true, (AND (NOT p1) p0), p0]
Running random walk in product with property : Sudoku-COL-AN16-LTLCardinality-06
Product exploration timeout after 14990 steps with 3747 reset in 10006 ms.
Product exploration timeout after 15270 steps with 3817 reset in 10002 ms.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 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 p0), (X (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (176 resets) in 24361 ms. (1 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1393 ms. (28 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5032 ms. (7 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4906 ms. (8 steps per ms) remains 3/3 properties
[2024-05-30 06:10:32] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4352 variables, 256/256 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4352 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3116 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 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/4352 variables, 256/256 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4352 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2819 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 7141ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 58 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 20441 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1179 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4586 ms. (8 steps per ms) remains 2/2 properties
Probabilistic random walk after 185791 steps, saw 185739 distinct states, run finished after 21069 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-30 06:11:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4352 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4352 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 0 solved, 2 unsolved in 18915 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 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/4352 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4352 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 0 solved, 2 unsolved in 18853 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 38368ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 52 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 44 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:11:46] [INFO ] Invariant cache hit.
[2024-05-30 06:11:49] [INFO ] Implicit Places using invariants in 2615 ms returned []
[2024-05-30 06:11:49] [INFO ] Invariant cache hit.
[2024-05-30 06:12:02] [INFO ] Implicit Places using invariants and state equation in 13355 ms returned []
Implicit Place search using SMT with State Equation took 15972 ms to find 0 implicit places.
[2024-05-30 06:12:02] [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
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16186 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 30 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:12:03] [INFO ] Invariant cache hit.
[2024-05-30 06:12:06] [INFO ] Implicit Places using invariants in 2615 ms returned []
[2024-05-30 06:12:06] [INFO ] Invariant cache hit.
[2024-05-30 06:12:19] [INFO ] Implicit Places using invariants and state equation in 13324 ms returned []
Implicit Place search using SMT with State Equation took 15943 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 15975 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 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 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (176 resets) in 12513 ms. (3 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1001 ms. (39 steps per ms) remains 1/1 properties
[2024-05-30 06:12:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4096/4352 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4352 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1617 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 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/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4096/4352 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4352 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1664 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3360ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 256 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 768 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.4 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 147 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 768/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 11165 ms. (3 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 904 ms. (44 steps per ms) remains 1/1 properties
Probabilistic random walk after 389827 steps, saw 389673 distinct states, run finished after 9008 ms. (steps per millisecond=43 ) properties seen :0
// Phase 1: matrix 4096 rows 768 cols
[2024-05-30 06:12:40] [INFO ] Computed 47 invariants in 409 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 507/763 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/763 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/768 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/768 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4096/4864 variables, 768/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/4864 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4864 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4864/4864 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1623 ms.
Refiners :[Generalized P Invariants (flows): 47/47 constraints, State Equation: 768/768 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/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 507/763 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/763 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/768 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/768 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/4864 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8905 ms.
Refiners :[Generalized P Invariants (flows): 47/47 constraints, State Equation: 768/768 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10999ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 254 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 27 ms.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 334 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration timeout after 16690 steps with 4172 reset in 10001 ms.
Product exploration timeout after 16740 steps with 4185 reset in 10005 ms.
Applying partial POR strategy [true, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 117 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:13:13] [INFO ] Redundant transitions in 163 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 290 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 57 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2024-05-30 06:13:13] [INFO ] Computed 768 invariants in 27 ms
[2024-05-30 06:13:15] [INFO ] Implicit Places using invariants in 2614 ms returned []
[2024-05-30 06:13:15] [INFO ] Invariant cache hit.
[2024-05-30 06:13:29] [INFO ] Implicit Places using invariants and state equation in 13209 ms returned []
Implicit Place search using SMT with State Equation took 15826 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 15887 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Treatment of property Sudoku-COL-AN16-LTLCardinality-06 finished in 224558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 4608 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 20 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:13:29] [INFO ] Invariant cache hit.
[2024-05-30 06:13:31] [INFO ] Implicit Places using invariants in 1847 ms returned []
[2024-05-30 06:13:31] [INFO ] Invariant cache hit.
[2024-05-30 06:13:43] [INFO ] Implicit Places using invariants and state equation in 12384 ms returned []
Implicit Place search using SMT with State Equation took 14237 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 14261 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-COL-AN16-LTLCardinality-07
Product exploration timeout after 20860 steps with 10430 reset in 10003 ms.
Product exploration timeout after 21060 steps with 10530 reset in 10004 ms.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 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 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (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 19 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-COL-AN16-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN16-LTLCardinality-07 finished in 37476 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((F(p0)&&(p0||F(p1))))))'
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 50 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:14:07] [INFO ] Invariant cache hit.
[2024-05-30 06:14:09] [INFO ] Implicit Places using invariants in 2562 ms returned []
[2024-05-30 06:14:09] [INFO ] Invariant cache hit.
[2024-05-30 06:14:23] [INFO ] Implicit Places using invariants and state equation in 13907 ms returned []
Implicit Place search using SMT with State Equation took 16475 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 16539 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN16-LTLCardinality-14
Stuttering criterion allowed to conclude after 225 steps with 0 reset in 84 ms.
FORMULA Sudoku-COL-AN16-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN16-LTLCardinality-14 finished in 16793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F(p1))))))'
Support contains 512 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 768 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.5 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 42 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2024-05-30 06:14:24] [INFO ] Computed 47 invariants in 301 ms
[2024-05-30 06:14:24] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-05-30 06:14:24] [INFO ] Invariant cache hit.
[2024-05-30 06:15:12] [INFO ] Performed 257/768 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 06:15:45] [INFO ] Performed 259/768 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 06:15:49] [INFO ] Implicit Places using invariants and state equation in 85408 ms returned []
Implicit Place search using SMT with State Equation took 86090 ms to find 0 implicit places.
[2024-05-30 06:15:50] [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
Starting structural reductions in SI_LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86302 ms. Remains : 768/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN16-LTLCardinality-15
Stuttering criterion allowed to conclude after 224 steps with 0 reset in 71 ms.
FORMULA Sudoku-COL-AN16-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN16-LTLCardinality-15 finished in 86484 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((G(!p0)||X(X(p1)))))'
[2024-05-30 06:15:50] [INFO ] Flatten gal took : 259 ms
[2024-05-30 06:15:50] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2024-05-30 06:15:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4864 places, 4096 transitions and 16384 arcs took 20 ms.
Total runtime 703417 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-COL-AN16

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 4864
TRANSITIONS: 4096
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.104s, Sys 0.003s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.017s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1220
MODEL NAME: /home/mcc/execution/413/model
4864 places, 4096 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1717052642617

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN16"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Sudoku-COL-AN16, 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 r399-tall-171690530500531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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