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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 6.0K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 11:30 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:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 11:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 11:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 11:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 11:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 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-AN05-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717256711136

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:45:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:45:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:45:12] [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-06-01 15:45:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 15:45:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 543 ms
[2024-06-01 15:45:13] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 200 PT places and 125.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 15:45:13] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-06-01 15:45:13] [INFO ] Skeletonized 16 HLPN properties in 10 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-COL-AN05-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-09 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 11 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).
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40064 steps (1480 resets) in 590 ms. (67 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40064 steps (1480 resets) in 84 ms. (471 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40064 steps (1480 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
// Phase 1: matrix 1 rows 4 cols
[2024-06-01 15:45:13] [INFO ] Computed 3 invariants in 3 ms
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 2 solved, 0 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 251ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2024-06-01 15:45:13] [INFO ] Flatten gal took : 13 ms
[2024-06-01 15:45:13] [INFO ] Flatten gal took : 2 ms
Domain [N(5), N(5)] of place Rows breaks symmetries in sort N
[2024-06-01 15:45:13] [INFO ] Unfolded HLPN to a Petri net with 200 places and 125 transitions 500 arcs in 13 ms.
[2024-06-01 15:45:13] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 200 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 19 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2024-06-01 15:45:14] [INFO ] Computed 75 invariants in 7 ms
[2024-06-01 15:45:14] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 15:45:14] [INFO ] Invariant cache hit.
[2024-06-01 15:45:14] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 291 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 326 ms. Remains : 200/200 places, 125/125 transitions.
Support contains 200 out of 200 places after structural reductions.
[2024-06-01 15:45:14] [INFO ] Flatten gal took : 44 ms
[2024-06-01 15:45:14] [INFO ] Flatten gal took : 29 ms
[2024-06-01 15:45:14] [INFO ] Input system was already deterministic with 125 transitions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (1820 resets) in 3056 ms. (13 steps per ms) remains 2/14 properties
BEST_FIRST walk for 40004 steps (40 resets) in 226 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 531 ms. (75 steps per ms) remains 2/2 properties
[2024-06-01 15:45:15] [INFO ] Invariant cache hit.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 200/325 variables, and 75 constraints, problems are : Problem set: 2 solved, 0 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 0/200 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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(F((G((p0&&F(p1)))||(p0&&G(F(p1))&&F(!p0))))))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 15:45:16] [INFO ] Invariant cache hit.
[2024-06-01 15:45:16] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 15:45:16] [INFO ] Invariant cache hit.
[2024-06-01 15:45:16] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 256 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 262 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 465 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-02
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-02 finished in 806 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 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 12 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 15:45:17] [INFO ] Invariant cache hit.
[2024-06-01 15:45:17] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 15:45:17] [INFO ] Invariant cache hit.
[2024-06-01 15:45:17] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-06-01 15:45:17] [INFO ] Redundant transitions in 4 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 260 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-03
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-03 finished in 326 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||G(p1))))))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 15:45:17] [INFO ] Invariant cache hit.
[2024-06-01 15:45:17] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 15:45:17] [INFO ] Invariant cache hit.
[2024-06-01 15:45:17] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 196 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 201 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-05 finished in 373 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&&(p1||X(F(p0))))))))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 15:45:17] [INFO ] Invariant cache hit.
[2024-06-01 15:45:17] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 15:45:17] [INFO ] Invariant cache hit.
[2024-06-01 15:45:17] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 223 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 229 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-06
Product exploration explored 100000 steps with 33333 reset in 1343 ms.
Product exploration explored 100000 steps with 33333 reset in 1294 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 27 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN05-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLCardinality-06 finished in 3259 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 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 15:45:21] [INFO ] Invariant cache hit.
[2024-06-01 15:45:21] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 15:45:21] [INFO ] Invariant cache hit.
[2024-06-01 15:45:21] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-06-01 15:45:21] [INFO ] Redundant transitions in 3 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 258 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-07
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-07 finished in 308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 50 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 14 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2024-06-01 15:45:21] [INFO ] Computed 14 invariants in 6 ms
[2024-06-01 15:45:21] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 15:45:21] [INFO ] Invariant cache hit.
[2024-06-01 15:45:21] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 5288 steps with 240 reset in 45 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-10 finished in 344 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 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2024-06-01 15:45:21] [INFO ] Computed 75 invariants in 3 ms
[2024-06-01 15:45:21] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 15:45:21] [INFO ] Invariant cache hit.
[2024-06-01 15:45:21] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-01 15:45:21] [INFO ] Redundant transitions in 3 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 234 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 43 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-11
Product exploration explored 100000 steps with 4555 reset in 1275 ms.
Product exploration explored 100000 steps with 4547 reset in 1308 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 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 :[p0]
RANDOM walk for 52 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 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 37 ms :[p0]
Stuttering acceptance computed with spot in 38 ms :[p0]
[2024-06-01 15:45:25] [INFO ] Invariant cache hit.
[2024-06-01 15:45:25] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2024-06-01 15:45:25] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-01 15:45:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:45:25] [INFO ] [Nat]Absence check using 75 positive place invariants in 41 ms returned sat
[2024-06-01 15:45:25] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-06-01 15:45:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 15:45:25] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG p0
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 15:45:25] [INFO ] Invariant cache hit.
[2024-06-01 15:45:25] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 15:45:25] [INFO ] Invariant cache hit.
[2024-06-01 15:45:25] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-06-01 15:45:25] [INFO ] Redundant transitions in 3 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 243 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 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 :[p0]
RANDOM walk for 52 steps (0 resets) in 8 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 119 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 :[p0]
Stuttering acceptance computed with spot in 38 ms :[p0]
[2024-06-01 15:45:26] [INFO ] Invariant cache hit.
[2024-06-01 15:45:26] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2024-06-01 15:45:26] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-06-01 15:45:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:45:26] [INFO ] [Nat]Absence check using 75 positive place invariants in 37 ms returned sat
[2024-06-01 15:45:26] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-06-01 15:45:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 15:45:26] [INFO ] Added : 0 causal constraints over 0 iterations in 33 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 35 ms :[p0]
Product exploration explored 100000 steps with 4546 reset in 1250 ms.
Product exploration explored 100000 steps with 4549 reset in 1265 ms.
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 15:45:29] [INFO ] Invariant cache hit.
[2024-06-01 15:45:29] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 15:45:29] [INFO ] Invariant cache hit.
[2024-06-01 15:45:29] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-06-01 15:45:29] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 200/200 places, 125/125 transitions.
Treatment of property Sudoku-COL-AN05-LTLCardinality-11 finished in 8100 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(G(p0))&&F(p1))))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 10 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 15:45:29] [INFO ] Invariant cache hit.
[2024-06-01 15:45:29] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 15:45:29] [INFO ] Invariant cache hit.
[2024-06-01 15:45:30] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-06-01 15:45:30] [INFO ] Redundant transitions in 1 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 224 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-12
Stuttering criterion allowed to conclude after 65 steps with 3 reset in 3 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-12 finished in 429 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((X(p0)||(F(G(p1))&&(p0 U p1)))))'
Support contains 50 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 3 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2024-06-01 15:45:30] [INFO ] Computed 14 invariants in 5 ms
[2024-06-01 15:45:30] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 15:45:30] [INFO ] Invariant cache hit.
[2024-06-01 15:45:30] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 116 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 : 75/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-13
Product exploration explored 100000 steps with 33430 reset in 1185 ms.
Product exploration explored 100000 steps with 33250 reset in 1212 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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 (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 156 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 17403 steps (787 resets) in 226 ms. (76 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 355 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 50 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 15:45:34] [INFO ] Invariant cache hit.
[2024-06-01 15:45:34] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 15:45:34] [INFO ] Invariant cache hit.
[2024-06-01 15:45:34] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 122 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 125 ms. Remains : 75/75 places, 125/125 transitions.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 152 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 17159 steps (777 resets) in 262 ms. (65 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 357 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 33320 reset in 1205 ms.
Product exploration explored 100000 steps with 33360 reset in 1231 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 50 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 15:45:39] [INFO ] Redundant transitions in 1 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 11 ms. Remains : 75/75 places, 125/125 transitions.
Support contains 50 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 0 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 15:45:39] [INFO ] Invariant cache hit.
[2024-06-01 15:45:39] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 15:45:39] [INFO ] Invariant cache hit.
[2024-06-01 15:45:39] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 126 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 127 ms. Remains : 75/75 places, 125/125 transitions.
Treatment of property Sudoku-COL-AN05-LTLCardinality-13 finished in 9025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G((p0||G(p1)))||(G(p2)&&(p0||G(p1))))))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2024-06-01 15:45:39] [INFO ] Computed 75 invariants in 5 ms
[2024-06-01 15:45:39] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 15:45:39] [INFO ] Invariant cache hit.
[2024-06-01 15:45:39] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-06-01 15:45:39] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 43 steps with 1 reset in 1 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-14 finished in 430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 25 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 5 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2024-06-01 15:45:39] [INFO ] Computed 14 invariants in 5 ms
[2024-06-01 15:45:39] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 15:45:39] [INFO ] Invariant cache hit.
[2024-06-01 15:45:39] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 147 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 : 75/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 332 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 870 ms.
Product exploration explored 100000 steps with 50000 reset in 849 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN05-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLCardinality-15 finished in 2301 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' '!(G((X(p0)||(F(G(p1))&&(p0 U p1)))))'
Found a Lengthening insensitive property : Sudoku-COL-AN05-LTLCardinality-13
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 50 out of 200 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Graph (complete) has 375 edges and 200 vertex of which 75 are kept as prefixes of interest. Removing 125 places using SCC suffix rule.3 ms
Discarding 125 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
[2024-06-01 15:45:42] [INFO ] Invariant cache hit.
[2024-06-01 15:45:42] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 15:45:42] [INFO ] Invariant cache hit.
[2024-06-01 15:45:42] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 114 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 LI_LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 122 ms. Remains : 75/200 places, 125/125 transitions.
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-13
Product exploration explored 100000 steps with 33226 reset in 1175 ms.
Product exploration explored 100000 steps with 33404 reset in 1199 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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 (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 379 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 5754 steps (256 resets) in 79 ms. (71 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 371 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 50 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 15:45:46] [INFO ] Invariant cache hit.
[2024-06-01 15:45:46] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 15:45:46] [INFO ] Invariant cache hit.
[2024-06-01 15:45:46] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 125 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 127 ms. Remains : 75/75 places, 125/125 transitions.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 7708 steps (347 resets) in 125 ms. (61 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 354 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 33242 reset in 1199 ms.
Product exploration explored 100000 steps with 33202 reset in 1225 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 50 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 15:45:50] [INFO ] Redundant transitions in 0 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 10 ms. Remains : 75/75 places, 125/125 transitions.
Support contains 50 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 0 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 15:45:50] [INFO ] Invariant cache hit.
[2024-06-01 15:45:51] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 15:45:51] [INFO ] Invariant cache hit.
[2024-06-01 15:45:51] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 112 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 112 ms. Remains : 75/75 places, 125/125 transitions.
Treatment of property Sudoku-COL-AN05-LTLCardinality-13 finished in 9061 ms.
[2024-06-01 15:45:51] [INFO ] Flatten gal took : 13 ms
[2024-06-01 15:45:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 15:45:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 200 places, 125 transitions and 500 arcs took 5 ms.
Total runtime 38759 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Sudoku-COL-AN05-LTLCardinality-11
FORMULA Sudoku-COL-AN05-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717256776981

--------------------
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
ltl formula name Sudoku-COL-AN05-LTLCardinality-11
ltl formula formula --ltl=/tmp/1438/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 200 places, 125 transitions and 500 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1438/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1438/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1438/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1438/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 76 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 201, there are 129 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~22 levels ~10000 states ~51156 transitions
pnml2lts-mc( 2/ 4): ~22 levels ~20000 states ~102812 transitions
pnml2lts-mc( 3/ 4): ~24 levels ~40000 states ~205204 transitions
pnml2lts-mc( 2/ 4): ~22 levels ~80000 states ~455624 transitions
pnml2lts-mc( 1/ 4): ~24 levels ~160000 states ~923348 transitions
pnml2lts-mc( 2/ 4): ~22 levels ~320000 states ~1999608 transitions
pnml2lts-mc( 2/ 4): ~24 levels ~640000 states ~4135272 transitions
pnml2lts-mc( 1/ 4): ~24 levels ~1280000 states ~8549612 transitions
pnml2lts-mc( 1/ 4): ~24 levels ~2560000 states ~17793228 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2965085
pnml2lts-mc( 0/ 4): unique states count: 2965146
pnml2lts-mc( 0/ 4): unique transitions count: 21351026
pnml2lts-mc( 0/ 4): - self-loop count: 11966
pnml2lts-mc( 0/ 4): - claim dead count: 18371119
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2965150
pnml2lts-mc( 0/ 4): - cum. max stack depth: 98
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2965150 states 21351512 transitions, fanout: 7.201
pnml2lts-mc( 0/ 4): Total exploration time 21.690 sec (21.650 sec minimum, 21.667 sec on average)
pnml2lts-mc( 0/ 4): States per second: 136706, Transitions per second: 984394
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 86.6MB, 30.6 B/state, compr.: 3.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 8.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 125 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 86.6MB (~256.0MB paged-in)
ltl formula name Sudoku-COL-AN05-LTLCardinality-13
ltl formula formula --ltl=/tmp/1438/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 200 places, 125 transitions and 500 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1438/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1438/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1438/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1438/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 76 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 201, there are 138 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~25 levels ~10000 states ~71428 transitions
pnml2lts-mc( 1/ 4): ~25 levels ~20000 states ~147964 transitions
pnml2lts-mc( 1/ 4): ~25 levels ~40000 states ~304564 transitions
pnml2lts-mc( 1/ 4): ~25 levels ~80000 states ~619456 transitions
pnml2lts-mc( 1/ 4): ~25 levels ~160000 states ~1357804 transitions
pnml2lts-mc( 1/ 4): ~25 levels ~320000 states ~2787496 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~26!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 316615
pnml2lts-mc( 0/ 4): unique states count: 316686
pnml2lts-mc( 0/ 4): unique transitions count: 2825957
pnml2lts-mc( 0/ 4): - self-loop count: 1094
pnml2lts-mc( 0/ 4): - claim dead count: 2499072
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 316689
pnml2lts-mc( 0/ 4): - cum. max stack depth: 101
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 316689 states 2827086 transitions, fanout: 8.927
pnml2lts-mc( 0/ 4): Total exploration time 2.010 sec (2.010 sec minimum, 2.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 157557, Transitions per second: 1406510
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 8.9MB, 29.0 B/state, compr.: 3.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/10.0%
pnml2lts-mc( 0/ 4): Stored 125 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 8.9MB (~256.0MB paged-in)

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-AN05"
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-COL-AN05, 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-171690532300443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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