Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r399-tall-171690531000724.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Sudoku-PT-BN16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690531000724
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 95M
-rw-r--r-- 1 mcc users 1.7M Apr 12 13:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.3M Apr 12 13:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5M Apr 12 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 23M Apr 12 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 717K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 903K Apr 12 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Apr 12 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4M Apr 12 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31M Apr 12 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 72K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.7M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-00
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-01
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-02
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-03
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-04
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-05
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-06
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-07
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-08
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-09
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-10
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-11
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-12
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-13
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-14
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717087790491

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-BN16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 16:49:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 16:49:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 16:49:52] [INFO ] Load time of PNML (sax parser for PT used): 330 ms
[2024-05-30 16:49:52] [INFO ] Transformed 5120 places.
[2024-05-30 16:49:52] [INFO ] Transformed 4096 transitions.
[2024-05-30 16:49:52] [INFO ] Found NUPN structural information;
[2024-05-30 16:49:52] [INFO ] Parsed PT model containing 5120 places and 4096 transitions and 20480 arcs in 471 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 257 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-BN16-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1024 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 1024 transition count 4096
Applied a total of 4096 rules in 87 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2024-05-30 16:49:58] [INFO ] Computed 168 invariants in 875 ms
[2024-05-30 16:49:59] [INFO ] Implicit Places using invariants in 1466 ms returned []
[2024-05-30 16:49:59] [INFO ] Invariant cache hit.
[2024-05-30 16:50:55] [INFO ] Implicit Places using invariants and state equation in 56327 ms returned []
Implicit Place search using SMT with State Equation took 57827 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57942 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Support contains 1024 out of 1024 places after structural reductions.
[2024-05-30 16:50:58] [INFO ] Flatten gal took : 1012 ms
[2024-05-30 16:51:04] [INFO ] Flatten gal took : 977 ms
[2024-05-30 16:51:10] [INFO ] Input system was already deterministic with 4096 transitions.
Reduction of identical properties reduced properties to check from 23 to 17
RANDOM walk for 2693 steps (11 resets) in 2125 ms. (1 steps per ms) remains 0/17 properties
FORMULA Sudoku-PT-BN16-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 46 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 16:51:12] [INFO ] Invariant cache hit.
[2024-05-30 16:51:12] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-30 16:51:12] [INFO ] Invariant cache hit.
[2024-05-30 16:52:08] [INFO ] Implicit Places using invariants and state equation in 55539 ms returned []
Implicit Place search using SMT with State Equation took 55859 ms to find 0 implicit places.
[2024-05-30 16:52:08] [INFO ] Redundant transitions in 244 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 56168 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-02
Stuttering criterion allowed to conclude after 205 steps with 0 reset in 96 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-02 finished in 56538 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(p1)||p0) U G(p1)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 10 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 16:52:09] [INFO ] Invariant cache hit.
[2024-05-30 16:52:09] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-30 16:52:09] [INFO ] Invariant cache hit.
[2024-05-30 16:53:05] [INFO ] Implicit Places using invariants and state equation in 55923 ms returned []
Implicit Place search using SMT with State Equation took 56250 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 56264 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-03
Stuttering criterion allowed to conclude after 210 steps with 0 reset in 84 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-03 finished in 56578 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 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 28 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 16:53:05] [INFO ] Invariant cache hit.
[2024-05-30 16:53:05] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-30 16:53:05] [INFO ] Invariant cache hit.
[2024-05-30 16:54:01] [INFO ] Implicit Places using invariants and state equation in 55277 ms returned []
Implicit Place search using SMT with State Equation took 55594 ms to find 0 implicit places.
[2024-05-30 16:54:01] [INFO ] Redundant transitions in 163 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55797 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-05
Stuttering criterion allowed to conclude after 208 steps with 0 reset in 70 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-05 finished in 56015 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((X((F(G((X(p3)||p2)))&&p1))&&p0)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 7 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 16:54:01] [INFO ] Invariant cache hit.
[2024-05-30 16:54:01] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-30 16:54:01] [INFO ] Invariant cache hit.
[2024-05-30 16:54:59] [INFO ] Implicit Places using invariants and state equation in 57082 ms returned []
Implicit Place search using SMT with State Equation took 57390 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 57398 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-06
Stuttering criterion allowed to conclude after 207 steps with 0 reset in 71 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-06 finished in 57740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0&&X(p0))))||F(p1)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 9 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 16:54:59] [INFO ] Invariant cache hit.
[2024-05-30 16:54:59] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-30 16:54:59] [INFO ] Invariant cache hit.
[2024-05-30 16:55:54] [INFO ] Implicit Places using invariants and state equation in 54540 ms returned []
Implicit Place search using SMT with State Equation took 54844 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 54857 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-07
Product exploration timeout after 29780 steps with 141 reset in 10001 ms.
Product exploration timeout after 29790 steps with 141 reset in 10005 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 27 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-07 finished in 81946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1||G(p2)))||p0)))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 321 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 16:56:21] [INFO ] Invariant cache hit.
[2024-05-30 16:56:31] [INFO ] Implicit Places using invariants in 9529 ms returned []
[2024-05-30 16:56:31] [INFO ] Invariant cache hit.
[2024-05-30 16:57:58] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 16:58:30] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 16:59:03] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 16:59:11] [INFO ] Implicit Places using invariants and state equation in 160036 ms returned []
Implicit Place search using SMT with State Equation took 169566 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 169890 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-08
Product exploration timeout after 18930 steps with 9465 reset in 10002 ms.
Product exploration timeout after 18880 steps with 9440 reset in 10002 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 45 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-08 finished in 191113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 287 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 16:59:32] [INFO ] Invariant cache hit.
[2024-05-30 16:59:42] [INFO ] Implicit Places using invariants in 9509 ms returned []
[2024-05-30 16:59:42] [INFO ] Invariant cache hit.
[2024-05-30 17:01:08] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 17:01:41] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 17:02:13] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 17:02:22] [INFO ] Implicit Places using invariants and state equation in 160039 ms returned []
Implicit Place search using SMT with State Equation took 169550 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 169840 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-09
Entered a terminal (fully accepting) state of product in 216 steps with 1 reset in 72 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-09 finished in 170010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)&&X(p1)))))))'
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 140 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 17:02:22] [INFO ] Invariant cache hit.
[2024-05-30 17:02:31] [INFO ] Implicit Places using invariants in 9412 ms returned []
[2024-05-30 17:02:31] [INFO ] Invariant cache hit.
[2024-05-30 17:03:59] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 17:04:31] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 17:05:03] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 17:05:11] [INFO ] Implicit Places using invariants and state equation in 160023 ms returned []
Implicit Place search using SMT with State Equation took 169462 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 169604 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-10
Product exploration timeout after 30160 steps with 181 reset in 10005 ms.
Product exploration timeout after 29700 steps with 177 reset in 10007 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1063 steps (4 resets) in 631 ms. (1 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-30 17:05:34] [INFO ] Invariant cache hit.
[2024-05-30 17:05:43] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 5384 ms returned sat
[2024-05-30 17:05:49] [INFO ] [Real]Absence check using state equation in 6297 ms returned unknown
Could not prove EG (NOT p0)
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 310 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 17:05:49] [INFO ] Invariant cache hit.
[2024-05-30 17:05:59] [INFO ] Implicit Places using invariants in 9607 ms returned []
[2024-05-30 17:05:59] [INFO ] Invariant cache hit.
[2024-05-30 17:07:27] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 17:07:59] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 17:08:31] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 17:08:39] [INFO ] Implicit Places using invariants and state equation in 160032 ms returned []
Implicit Place search using SMT with State Equation took 169641 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 169955 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 435 steps (1 resets) in 392 ms. (1 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-30 17:08:41] [INFO ] Invariant cache hit.
[2024-05-30 17:08:50] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 5393 ms returned sat
[2024-05-30 17:08:56] [INFO ] [Real]Absence check using state equation in 6354 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 29510 steps with 179 reset in 10002 ms.
Stuttering criterion allowed to conclude after 3370 steps with 20 reset in 1144 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-10 finished in 405483 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 (p2 U X(p2)))&&p0))))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 144 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 17:09:08] [INFO ] Invariant cache hit.
[2024-05-30 17:09:17] [INFO ] Implicit Places using invariants in 9317 ms returned []
[2024-05-30 17:09:17] [INFO ] Invariant cache hit.
[2024-05-30 17:10:45] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 17:11:17] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 17:11:49] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 17:11:57] [INFO ] Implicit Places using invariants and state equation in 160051 ms returned []
Implicit Place search using SMT with State Equation took 169372 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 169518 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-11
Stuttering criterion allowed to conclude after 213 steps with 0 reset in 68 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-11 finished in 169834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p0)))&&(F(p2)||p1))))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 146 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 17:11:57] [INFO ] Invariant cache hit.
[2024-05-30 17:12:07] [INFO ] Implicit Places using invariants in 9790 ms returned []
[2024-05-30 17:12:07] [INFO ] Invariant cache hit.
[2024-05-30 17:13:37] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 17:14:09] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 17:14:41] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 17:14:47] [INFO ] Implicit Places using invariants and state equation in 160036 ms returned []
Implicit Place search using SMT with State Equation took 169828 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 169978 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-13
Entered a terminal (fully accepting) state of product in 529 steps with 18 reset in 378 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-13 finished in 170648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 156 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 17:14:48] [INFO ] Invariant cache hit.
[2024-05-30 17:14:58] [INFO ] Implicit Places using invariants in 9898 ms returned []
[2024-05-30 17:14:58] [INFO ] Invariant cache hit.
[2024-05-30 17:16:28] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 17:17:00] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 17:17:32] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 17:17:38] [INFO ] Implicit Places using invariants and state equation in 160030 ms returned []
Implicit Place search using SMT with State Equation took 169932 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 170091 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-14
Product exploration timeout after 17980 steps with 6442 reset in 10007 ms.
Product exploration timeout after 17780 steps with 6318 reset in 10002 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-14 finished in 191256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F((p1&&F(p2))))||p0)))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 166 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 17:17:59] [INFO ] Invariant cache hit.
[2024-05-30 17:18:09] [INFO ] Implicit Places using invariants in 9278 ms returned []
[2024-05-30 17:18:09] [INFO ] Invariant cache hit.
[2024-05-30 17:19:35] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 17:20:08] [INFO ] Performed 4/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 17:20:40] [INFO ] Performed 6/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 17:20:49] [INFO ] Implicit Places using invariants and state equation in 160024 ms returned []
Implicit Place search using SMT with State Equation took 169312 ms to find 0 implicit places.
[2024-05-30 17:20:49] [INFO ] Redundant transitions in 244 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 169733 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-15
Product exploration timeout after 16710 steps with 250 reset in 10003 ms.
Product exploration timeout after 16560 steps with 241 reset in 10003 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT p2)), (X (NOT p1)), (X p1)]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-15 finished in 191103 ms.
All properties solved by simple procedures.
Total runtime 1879049 ms.
ITS solved all properties within timeout

BK_STOP 1717089671063

--------------------
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-PT-BN16"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Sudoku-PT-BN16, 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 r399-tall-171690531000724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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