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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 44M
-rw-r--r-- 1 mcc users 603K Apr 12 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 11:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.3M Apr 12 11:47 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 354K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 616K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.3M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.1M Apr 12 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Apr 12 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6M Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18M Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 82K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 203K Apr 23 08:00 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 746K 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-AN11-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717272833334

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:13:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:13:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:13:54] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2024-06-01 20:13:54] [INFO ] Transformed 1694 places.
[2024-06-01 20:13:54] [INFO ] Transformed 1331 transitions.
[2024-06-01 20:13:54] [INFO ] Found NUPN structural information;
[2024-06-01 20:13:54] [INFO ] Parsed PT model containing 1694 places and 1331 transitions and 5324 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 90 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN11-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 363 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 40 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2024-06-01 20:13:56] [INFO ] Computed 32 invariants in 83 ms
[2024-06-01 20:13:56] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-06-01 20:13:56] [INFO ] Invariant cache hit.
[2024-06-01 20:13:57] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1119 ms. Remains : 363/1694 places, 1331/1331 transitions.
Support contains 363 out of 363 places after structural reductions.
[2024-06-01 20:13:58] [INFO ] Flatten gal took : 254 ms
[2024-06-01 20:13:59] [INFO ] Flatten gal took : 349 ms
[2024-06-01 20:14:01] [INFO ] Input system was already deterministic with 1331 transitions.
Reduction of identical properties reduced properties to check from 20 to 17
RANDOM walk for 40000 steps (376 resets) in 4552 ms. (8 steps per ms) remains 1/17 properties
BEST_FIRST walk for 36560 steps (8 resets) in 20692 ms. (1 steps per ms) remains 1/1 properties
[2024-06-01 20:14:08] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 363/1694 variables, and 363 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1063 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 0/32 constraints, State Equation: 0/363 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
After SMT solving in domain Int declared 363/1694 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 563 ms.
Refiners :[Domain max(s): 0/363 constraints, Generalized P Invariants (flows): 0/32 constraints, State Equation: 0/363 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5514ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Sudoku-PT-AN11-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-PT-AN11-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
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' '!(G((F((G(F(p1))||(!p1&&F(p1))))||p0)))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 13 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:14:14] [INFO ] Invariant cache hit.
[2024-06-01 20:14:14] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 20:14:14] [INFO ] Invariant cache hit.
[2024-06-01 20:14:15] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2024-06-01 20:14:15] [INFO ] Redundant transitions in 75 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 732 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-00
Stuttering criterion allowed to conclude after 103 steps with 0 reset in 18 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-00 finished in 1040 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 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 9 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:14:15] [INFO ] Invariant cache hit.
[2024-06-01 20:14:15] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 20:14:15] [INFO ] Invariant cache hit.
[2024-06-01 20:14:16] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2024-06-01 20:14:16] [INFO ] Redundant transitions in 46 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 728 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 52 ms :[p0, p0]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-02
Product exploration explored 100000 steps with 945 reset in 7891 ms.
Product exploration explored 100000 steps with 945 reset in 7860 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 26 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-PT-AN11-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-02 finished in 25769 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(G(p0)))))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 5 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:14:41] [INFO ] Invariant cache hit.
[2024-06-01 20:14:41] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 20:14:41] [INFO ] Invariant cache hit.
[2024-06-01 20:14:41] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 679 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 685 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-03
Entered a terminal (fully accepting) state of product in 105 steps with 0 reset in 15 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-03 finished in 917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 3 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:14:42] [INFO ] Invariant cache hit.
[2024-06-01 20:14:42] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 20:14:42] [INFO ] Invariant cache hit.
[2024-06-01 20:14:42] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 676 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 682 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-04
Product exploration timeout after 62790 steps with 20930 reset in 10003 ms.
Product exploration timeout after 63640 steps with 21213 reset in 10002 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
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 (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 20 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-PT-AN11-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-04 finished in 29405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 9 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:15:11] [INFO ] Invariant cache hit.
[2024-06-01 20:15:11] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 20:15:11] [INFO ] Invariant cache hit.
[2024-06-01 20:15:12] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 689 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 699 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-05
Product exploration timeout after 81920 steps with 40960 reset in 10001 ms.
Product exploration timeout after 81310 steps with 40655 reset in 10001 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 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-PT-AN11-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-05 finished in 29348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 3 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:15:40] [INFO ] Invariant cache hit.
[2024-06-01 20:15:40] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 20:15:40] [INFO ] Invariant cache hit.
[2024-06-01 20:15:41] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 688 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 695 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-06
Product exploration timeout after 82830 steps with 41415 reset in 10001 ms.
Product exploration timeout after 82950 steps with 41475 reset in 10002 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 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-PT-AN11-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-06 finished in 29273 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 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 3 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:16:10] [INFO ] Invariant cache hit.
[2024-06-01 20:16:10] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 20:16:10] [INFO ] Invariant cache hit.
[2024-06-01 20:16:10] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 650 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 654 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-07
Product exploration timeout after 83420 steps with 41710 reset in 10002 ms.
Product exploration timeout after 82560 steps with 41280 reset in 10002 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p1)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 21 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-AN11-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-07 finished in 29387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 74 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:16:39] [INFO ] Invariant cache hit.
[2024-06-01 20:16:41] [INFO ] Implicit Places using invariants in 1546 ms returned []
[2024-06-01 20:16:41] [INFO ] Invariant cache hit.
[2024-06-01 20:16:45] [INFO ] Implicit Places using invariants and state equation in 4585 ms returned []
Implicit Place search using SMT with State Equation took 6138 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 6213 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-08
Stuttering criterion allowed to conclude after 109 steps with 2 reset in 14 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-08 finished in 6325 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 6 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 35 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:16:45] [INFO ] Invariant cache hit.
[2024-06-01 20:16:47] [INFO ] Implicit Places using invariants in 1506 ms returned []
[2024-06-01 20:16:47] [INFO ] Invariant cache hit.
[2024-06-01 20:16:51] [INFO ] Implicit Places using invariants and state equation in 4171 ms returned []
Implicit Place search using SMT with State Equation took 5679 ms to find 0 implicit places.
[2024-06-01 20:16:51] [INFO ] Redundant transitions in 19 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 5745 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-10
Product exploration explored 100000 steps with 1281 reset in 8918 ms.
Product exploration explored 100000 steps with 1263 reset in 8889 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
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, (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 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-PT-AN11-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-10 finished in 31315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))||X(p2)))'
Support contains 9 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 24 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:17:17] [INFO ] Invariant cache hit.
[2024-06-01 20:17:18] [INFO ] Implicit Places using invariants in 1470 ms returned []
[2024-06-01 20:17:18] [INFO ] Invariant cache hit.
[2024-06-01 20:17:23] [INFO ] Implicit Places using invariants and state equation in 4792 ms returned []
Implicit Place search using SMT with State Equation took 6266 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 6292 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-11
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 12 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-11 finished in 6577 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(!p0))&&G(!p1))||G(F(!p0)))) U X(G(!p1))))'
Support contains 6 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 27 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:17:23] [INFO ] Invariant cache hit.
[2024-06-01 20:17:25] [INFO ] Implicit Places using invariants in 1509 ms returned []
[2024-06-01 20:17:25] [INFO ] Invariant cache hit.
[2024-06-01 20:17:29] [INFO ] Implicit Places using invariants and state equation in 4642 ms returned []
Implicit Place search using SMT with State Equation took 6153 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 6180 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND p0 p1), p1, p0, (AND p0 (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-13
Product exploration timeout after 70300 steps with 3859 reset in 10003 ms.
Product exploration timeout after 68470 steps with 3717 reset in 10002 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN11-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-13 finished in 34206 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(p0))&&F(p1)))&&(G(p2) U !p3)))'
Support contains 9 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 20 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:17:57] [INFO ] Invariant cache hit.
[2024-06-01 20:17:59] [INFO ] Implicit Places using invariants in 1478 ms returned []
[2024-06-01 20:17:59] [INFO ] Invariant cache hit.
[2024-06-01 20:18:04] [INFO ] Implicit Places using invariants and state equation in 5007 ms returned []
Implicit Place search using SMT with State Equation took 6487 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 6509 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p1) p3), true, (OR (NOT p0) (NOT p1)), (NOT p2), p3, (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-14
Entered a terminal (fully accepting) state of product in 34 steps with 0 reset in 9 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-14 finished in 6841 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 U !((X(p2)||p3)&&p1))))'
Support contains 9 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 23 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:18:04] [INFO ] Invariant cache hit.
[2024-06-01 20:18:06] [INFO ] Implicit Places using invariants in 1581 ms returned []
[2024-06-01 20:18:06] [INFO ] Invariant cache hit.
[2024-06-01 20:18:11] [INFO ] Implicit Places using invariants and state equation in 4982 ms returned []
Implicit Place search using SMT with State Equation took 6565 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 6590 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-15
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 12 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-15 finished in 6726 ms.
All properties solved by simple procedures.
Total runtime 257061 ms.
ITS solved all properties within timeout

BK_STOP 1717273091871

--------------------
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-AN11"
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-PT-AN11, 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-171690532800652"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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