Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r489-tall-167912706300100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Sudoku-COL-AN13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706300100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 8.1K Feb 26 09:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 09:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 08:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 08:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 09:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 09:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 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-AN13-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679188081814

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-AN13
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 01:08:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 01:08:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 01:08:03] [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.
[2023-03-19 01:08:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 01:08:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 593 ms
[2023-03-19 01:08:03] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2704 PT places and 2197.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 01:08:04] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2023-03-19 01:08:04] [INFO ] Skeletonized 16 HLPN properties in 2 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).
Remains 2 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN13-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLFireability-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).
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2023-03-19 01:08:04] [INFO ] Flatten gal took : 10 ms
[2023-03-19 01:08:04] [INFO ] Flatten gal took : 0 ms
Domain [N(13), N(13)] of place Rows breaks symmetries in sort N
[2023-03-19 01:08:04] [INFO ] Unfolded HLPN to a Petri net with 2704 places and 2197 transitions 8788 arcs in 51 ms.
[2023-03-19 01:08:04] [INFO ] Unfolded 14 HLPN properties in 10 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-AN13-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 49 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-19 01:08:06] [INFO ] Computed 38 place invariants in 131 ms
[2023-03-19 01:08:06] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-19 01:08:06] [INFO ] Invariant cache hit.
[2023-03-19 01:08:07] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
[2023-03-19 01:08:07] [INFO ] Invariant cache hit.
[2023-03-19 01:08:08] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2313 ms. Remains : 507/2704 places, 2197/2197 transitions.
Support contains 507 out of 507 places after structural reductions.
[2023-03-19 01:08:09] [INFO ] Flatten gal took : 476 ms
[2023-03-19 01:08:12] [INFO ] Flatten gal took : 507 ms
[2023-03-19 01:08:14] [INFO ] Input system was already deterministic with 2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1472 ms. (steps per millisecond=6 ) properties (out of 3) seen :2
Interrupted Best-First random walk after 5361 steps, including 1 resets, run timeout after 5112 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 1 properties.
[2023-03-19 01:08:21] [INFO ] Invariant cache hit.
[2023-03-19 01:08:29] [INFO ] After 869ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:08:29] [INFO ] Invariant cache hit.
[2023-03-19 01:08:30] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-19 01:08:30] [INFO ] Invariant cache hit.
[2023-03-19 01:08:30] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2023-03-19 01:08:30] [INFO ] Invariant cache hit.
[2023-03-19 01:08:31] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1414 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-00 finished in 1765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:08:31] [INFO ] Invariant cache hit.
[2023-03-19 01:08:31] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-19 01:08:31] [INFO ] Invariant cache hit.
[2023-03-19 01:08:32] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2023-03-19 01:08:32] [INFO ] Invariant cache hit.
[2023-03-19 01:08:33] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1565 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 48280 steps with 24140 reset in 10002 ms.
Product exploration timeout after 46920 steps with 23460 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 65 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-AN13-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLFireability-02 finished in 23399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||G(F(!p0)))))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:08:55] [INFO ] Invariant cache hit.
[2023-03-19 01:08:55] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-19 01:08:55] [INFO ] Invariant cache hit.
[2023-03-19 01:08:55] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2023-03-19 01:08:55] [INFO ] Invariant cache hit.
[2023-03-19 01:08:56] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1379 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 233 ms :[false, false, false, false, p0, p0]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 149 steps with 0 reset in 21 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-04 finished in 1684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:08:56] [INFO ] Invariant cache hit.
[2023-03-19 01:08:56] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-19 01:08:56] [INFO ] Invariant cache hit.
[2023-03-19 01:08:57] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2023-03-19 01:08:57] [INFO ] Invariant cache hit.
[2023-03-19 01:08:58] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1385 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 146 steps with 0 reset in 23 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-06 finished in 1541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:08:58] [INFO ] Invariant cache hit.
[2023-03-19 01:08:58] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-19 01:08:58] [INFO ] Invariant cache hit.
[2023-03-19 01:08:58] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2023-03-19 01:08:58] [INFO ] Invariant cache hit.
[2023-03-19 01:08:59] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1255 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 48560 steps with 24280 reset in 10002 ms.
Product exploration timeout after 47600 steps with 23800 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 59 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-AN13-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLFireability-08 finished in 23037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 19 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:09:21] [INFO ] Invariant cache hit.
[2023-03-19 01:09:21] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-19 01:09:21] [INFO ] Invariant cache hit.
[2023-03-19 01:09:22] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-03-19 01:09:22] [INFO ] Redundant transitions in 124 ms returned []
[2023-03-19 01:09:22] [INFO ] Invariant cache hit.
[2023-03-19 01:09:22] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1618 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 37 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 149 steps with 0 reset in 21 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-10 finished in 1721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 28 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:09:23] [INFO ] Invariant cache hit.
[2023-03-19 01:09:23] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-19 01:09:23] [INFO ] Invariant cache hit.
[2023-03-19 01:09:23] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2023-03-19 01:09:23] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-19 01:09:23] [INFO ] Invariant cache hit.
[2023-03-19 01:09:24] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1544 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 73170 steps with 493 reset in 10001 ms.
Product exploration timeout after 71840 steps with 485 reset in 10003 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 78 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-AN13-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLFireability-11 finished in 23358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(((p1||X(G(p1))) U (!p1&&(p1||X(G(p1))))))||p0))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 7 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:09:46] [INFO ] Invariant cache hit.
[2023-03-19 01:09:46] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-19 01:09:46] [INFO ] Invariant cache hit.
[2023-03-19 01:09:47] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2023-03-19 01:09:47] [INFO ] Invariant cache hit.
[2023-03-19 01:09:47] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1378 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 149 steps with 0 reset in 22 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-13 finished in 1675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:09:48] [INFO ] Invariant cache hit.
[2023-03-19 01:09:48] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-19 01:09:48] [INFO ] Invariant cache hit.
[2023-03-19 01:09:48] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2023-03-19 01:09:48] [INFO ] Invariant cache hit.
[2023-03-19 01:09:49] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1324 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 110 ms :[p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 37830 steps with 12610 reset in 10005 ms.
Product exploration timeout after 36970 steps with 12323 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[p0, p0, p0]
Finished random walk after 144 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 118 ms :[p0, p0, p0]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:10:11] [INFO ] Invariant cache hit.
[2023-03-19 01:10:12] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-19 01:10:12] [INFO ] Invariant cache hit.
[2023-03-19 01:10:12] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2023-03-19 01:10:12] [INFO ] Invariant cache hit.
[2023-03-19 01:10:13] [INFO ] Dead Transitions using invariants and state equation in 911 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1537 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[p0, p0, p0]
Finished random walk after 148 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 104 ms :[p0, p0, p0]
Product exploration timeout after 36760 steps with 12253 reset in 10003 ms.
Product exploration timeout after 36960 steps with 12320 reset in 10003 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 103 ms :[p0, p0, p0]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 16 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:10:36] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-19 01:10:36] [INFO ] Invariant cache hit.
[2023-03-19 01:10:37] [INFO ] Dead Transitions using invariants and state equation in 828 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 894 ms. Remains : 507/507 places, 2197/2197 transitions.
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 3 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:10:37] [INFO ] Invariant cache hit.
[2023-03-19 01:10:37] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-19 01:10:37] [INFO ] Invariant cache hit.
[2023-03-19 01:10:37] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2023-03-19 01:10:37] [INFO ] Invariant cache hit.
[2023-03-19 01:10:38] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1323 ms. Remains : 507/507 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLFireability-15 finished in 51300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Found a Shortening insensitive property : Sudoku-COL-AN13-LTLFireability-15
Stuttering acceptance computed with spot in 112 ms :[p0, p0, p0]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 14 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:10:39] [INFO ] Invariant cache hit.
[2023-03-19 01:10:39] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-19 01:10:39] [INFO ] Invariant cache hit.
[2023-03-19 01:10:40] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-19 01:10:40] [INFO ] Invariant cache hit.
[2023-03-19 01:10:40] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1316 ms. Remains : 507/507 places, 2197/2197 transitions.
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 35910 steps with 11970 reset in 10004 ms.
Product exploration timeout after 36810 steps with 12270 reset in 10005 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[p0, p0, p0]
Finished random walk after 149 steps, including 0 resets, run visited all 1 properties in 22 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 110 ms :[p0, p0, p0]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 7 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:11:03] [INFO ] Invariant cache hit.
[2023-03-19 01:11:03] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-19 01:11:03] [INFO ] Invariant cache hit.
[2023-03-19 01:11:03] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2023-03-19 01:11:03] [INFO ] Invariant cache hit.
[2023-03-19 01:11:04] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1360 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[p0, p0, p0]
Finished random walk after 148 steps, including 0 resets, run visited all 1 properties in 22 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 110 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 120 ms :[p0, p0, p0]
Product exploration timeout after 37180 steps with 12393 reset in 10001 ms.
Product exploration timeout after 37030 steps with 12343 reset in 10002 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 115 ms :[p0, p0, p0]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 10 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:11:27] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-19 01:11:27] [INFO ] Invariant cache hit.
[2023-03-19 01:11:27] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 771 ms. Remains : 507/507 places, 2197/2197 transitions.
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:11:27] [INFO ] Invariant cache hit.
[2023-03-19 01:11:28] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-19 01:11:28] [INFO ] Invariant cache hit.
[2023-03-19 01:11:28] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2023-03-19 01:11:28] [INFO ] Invariant cache hit.
[2023-03-19 01:11:29] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1364 ms. Remains : 507/507 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLFireability-15 finished in 50733 ms.
[2023-03-19 01:11:30] [INFO ] Flatten gal took : 107 ms
[2023-03-19 01:11:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 16 ms.
[2023-03-19 01:11:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 507 places, 2197 transitions and 6591 arcs took 8 ms.
Total runtime 206945 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1108/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 2686652 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16062232 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023

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-AN13"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-COL-AN13, 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 r489-tall-167912706300100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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