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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.3K Apr 12 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 10:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 10:16 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:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 12:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 12:06 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-AN14-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717263749011

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:42:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:42:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:42:30] [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 17:42:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:42:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 556 ms
[2024-06-01 17:42:30] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 3332 PT places and 2744.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 17:42:31] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2024-06-01 17:42:31] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
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).
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [N(14), N(14)] of place Rows breaks symmetries in sort N
[2024-06-01 17:42:31] [INFO ] Unfolded HLPN to a Petri net with 3332 places and 2744 transitions 10976 arcs in 66 ms.
[2024-06-01 17:42:31] [INFO ] Unfolded 16 HLPN properties in 13 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN14-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 588 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 59 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2024-06-01 17:42:36] [INFO ] Computed 41 invariants in 209 ms
[2024-06-01 17:42:36] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-06-01 17:42:36] [INFO ] Invariant cache hit.
[2024-06-01 17:42:38] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 3ms
Starting structural reductions in LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2072 ms. Remains : 588/3332 places, 2744/2744 transitions.
Support contains 588 out of 588 places after structural reductions.
[2024-06-01 17:42:40] [INFO ] Flatten gal took : 765 ms
[2024-06-01 17:42:46] [INFO ] Flatten gal took : 786 ms
[2024-06-01 17:42:52] [INFO ] Input system was already deterministic with 2744 transitions.
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 40000 steps (230 resets) in 9029 ms. (4 steps per ms) remains 1/3 properties
BEST_FIRST walk for 14984 steps (0 resets) in 22448 ms. (0 steps per ms) remains 1/1 properties
[2024-06-01 17:43:01] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 588/3332 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 250 ms.
Refiners :[Generalized P Invariants (flows): 0/41 constraints, State Equation: 0/588 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9277ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Sudoku-COL-AN14-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-COL-AN14-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 5 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:43:14] [INFO ] Invariant cache hit.
[2024-06-01 17:43:14] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 17:43:14] [INFO ] Invariant cache hit.
[2024-06-01 17:43:15] [INFO ] Implicit Places using invariants and state equation in 1395 ms returned []
Implicit Place search using SMT with State Equation took 1515 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 1522 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-00
Product exploration timeout after 37630 steps with 18815 reset in 10002 ms.
Product exploration timeout after 37980 steps with 18990 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN14-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN14-LTLFireability-00 finished in 24237 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(((p1 U X((p1&&F(!p1))))||p0))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 5 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:43:38] [INFO ] Invariant cache hit.
[2024-06-01 17:43:38] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 17:43:38] [INFO ] Invariant cache hit.
[2024-06-01 17:43:39] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned []
Implicit Place search using SMT with State Equation took 1353 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 1360 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-03
Stuttering criterion allowed to conclude after 171 steps with 0 reset in 37 ms.
FORMULA Sudoku-COL-AN14-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLFireability-03 finished in 1643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 23 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:43:40] [INFO ] Invariant cache hit.
[2024-06-01 17:43:40] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 17:43:40] [INFO ] Invariant cache hit.
[2024-06-01 17:43:41] [INFO ] Implicit Places using invariants and state equation in 1284 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
[2024-06-01 17:43:41] [INFO ] Redundant transitions in 143 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 1580 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-04
Product exploration timeout after 58980 steps with 342 reset in 10002 ms.
Product exploration timeout after 58590 steps with 340 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN14-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN14-LTLFireability-04 finished in 24004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 19 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:44:04] [INFO ] Invariant cache hit.
[2024-06-01 17:44:04] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 17:44:04] [INFO ] Invariant cache hit.
[2024-06-01 17:44:05] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 1559 ms to find 0 implicit places.
[2024-06-01 17:44:05] [INFO ] Redundant transitions in 109 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 1695 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 41 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-05
Product exploration timeout after 58330 steps with 338 reset in 10003 ms.
Product exploration timeout after 57870 steps with 335 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN14-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN14-LTLFireability-05 finished in 24126 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 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 21 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:44:28] [INFO ] Invariant cache hit.
[2024-06-01 17:44:28] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 17:44:28] [INFO ] Invariant cache hit.
[2024-06-01 17:44:29] [INFO ] Implicit Places using invariants and state equation in 1460 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
[2024-06-01 17:44:29] [INFO ] Redundant transitions in 66 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1690 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 39 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-06
Product exploration timeout after 55100 steps with 319 reset in 10001 ms.
Product exploration timeout after 56560 steps with 328 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN14-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN14-LTLFireability-06 finished in 24057 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 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 14 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:44:52] [INFO ] Invariant cache hit.
[2024-06-01 17:44:52] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 17:44:52] [INFO ] Invariant cache hit.
[2024-06-01 17:44:53] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
[2024-06-01 17:44:53] [INFO ] Redundant transitions in 138 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 1511 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-08
Stuttering criterion allowed to conclude after 172 steps with 0 reset in 32 ms.
FORMULA Sudoku-COL-AN14-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLFireability-08 finished in 1629 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((G(F(p0)) U (p0 U X(p0)))) U G(p0)))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 14 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:44:53] [INFO ] Invariant cache hit.
[2024-06-01 17:44:54] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 17:44:54] [INFO ] Invariant cache hit.
[2024-06-01 17:44:55] [INFO ] Implicit Places using invariants and state equation in 1289 ms returned []
Implicit Place search using SMT with State Equation took 1425 ms to find 0 implicit places.
[2024-06-01 17:44:55] [INFO ] Redundant transitions in 56 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 1502 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-10
Stuttering criterion allowed to conclude after 171 steps with 0 reset in 34 ms.
FORMULA Sudoku-COL-AN14-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLFireability-10 finished in 1845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p0))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 6 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:44:55] [INFO ] Invariant cache hit.
[2024-06-01 17:44:55] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 17:44:55] [INFO ] Invariant cache hit.
[2024-06-01 17:44:57] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 1519 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 1526 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-11
Product exploration timeout after 37240 steps with 18620 reset in 10002 ms.
Product exploration timeout after 37090 steps with 18545 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN14-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN14-LTLFireability-11 finished in 24534 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&&X(F(!p0))))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 7 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:45:20] [INFO ] Invariant cache hit.
[2024-06-01 17:45:20] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 17:45:20] [INFO ] Invariant cache hit.
[2024-06-01 17:45:21] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1437 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 1446 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 118 ms :[p0, true, true]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-12
Product exploration timeout after 58780 steps with 341 reset in 10003 ms.
Product exploration timeout after 58060 steps with 337 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 26 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN14-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN14-LTLFireability-12 finished in 24557 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 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 13 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:45:44] [INFO ] Invariant cache hit.
[2024-06-01 17:45:44] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 17:45:44] [INFO ] Invariant cache hit.
[2024-06-01 17:45:46] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
[2024-06-01 17:45:46] [INFO ] Redundant transitions in 57 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 1536 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 106 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-13
Product exploration timeout after 56400 steps with 327 reset in 10001 ms.
Product exploration timeout after 56780 steps with 329 reset in 10004 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN14-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN14-LTLFireability-13 finished in 23942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 11 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:46:08] [INFO ] Invariant cache hit.
[2024-06-01 17:46:08] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 17:46:08] [INFO ] Invariant cache hit.
[2024-06-01 17:46:10] [INFO ] Implicit Places using invariants and state equation in 1314 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
[2024-06-01 17:46:10] [INFO ] Redundant transitions in 56 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 1508 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-14
Product exploration timeout after 57570 steps with 334 reset in 10004 ms.
Product exploration timeout after 57650 steps with 334 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN14-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN14-LTLFireability-14 finished in 23980 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((X(!p1)&&p0))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 6 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:46:32] [INFO ] Invariant cache hit.
[2024-06-01 17:46:32] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 17:46:32] [INFO ] Invariant cache hit.
[2024-06-01 17:46:34] [INFO ] Implicit Places using invariants and state equation in 1365 ms returned []
Implicit Place search using SMT with State Equation took 1476 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 1483 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN14-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLFireability-15 finished in 1667 ms.
All properties solved by simple procedures.
Total runtime 244149 ms.
ITS solved all properties within timeout

BK_STOP 1717263994779

--------------------
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 LTLFireability -timeout 360 -rebuildPNML

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-AN14"
export BK_EXAMINATION="LTLFireability"
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-AN14, examination is LTLFireability"
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-171690532500516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN14.tgz
mv Sudoku-COL-AN14 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;