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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 31K Apr 12 11:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 12 11:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 12 11:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 12 11:10 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 24K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 92K Apr 12 11:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 505K Apr 12 11:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109K Apr 12 11:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 496K Apr 12 11:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K 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 53K 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-BN04-LTLCardinality-00
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-01
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-02
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-03
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-04
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-05
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-06
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-07
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-08
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-09
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-10
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-11
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-12
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-13
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-14
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717278664138

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-BN04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:51:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 21:51:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:51:05] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-06-01 21:51:05] [INFO ] Transformed 128 places.
[2024-06-01 21:51:05] [INFO ] Transformed 64 transitions.
[2024-06-01 21:51:05] [INFO ] Found NUPN structural information;
[2024-06-01 21:51:05] [INFO ] Parsed PT model containing 128 places and 64 transitions and 320 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-BN04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 128 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-06-01 21:51:05] [INFO ] Computed 64 invariants in 16 ms
[2024-06-01 21:51:05] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-01 21:51:05] [INFO ] Invariant cache hit.
[2024-06-01 21:51:05] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 309 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 333 ms. Remains : 128/128 places, 64/64 transitions.
Support contains 128 out of 128 places after structural reductions.
[2024-06-01 21:51:06] [INFO ] Flatten gal took : 26 ms
[2024-06-01 21:51:06] [INFO ] Flatten gal took : 14 ms
[2024-06-01 21:51:06] [INFO ] Input system was already deterministic with 64 transitions.
RANDOM walk for 40000 steps (2866 resets) in 1576 ms. (25 steps per ms) remains 5/20 properties
BEST_FIRST walk for 40004 steps (129 resets) in 203 ms. (196 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (128 resets) in 194 ms. (205 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (128 resets) in 272 ms. (146 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (129 resets) in 203 ms. (196 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (129 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
[2024-06-01 21:51:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 128/192 variables, and 192 constraints, problems are : Problem set: 5 solved, 0 unsolved in 126 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 64/64 constraints, State Equation: 0/128 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Sudoku-PT-BN04-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-BN04-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-BN04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Sudoku-PT-BN04-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 X(X((p1 U p2)))))'
Support contains 112 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 21:51:07] [INFO ] Invariant cache hit.
[2024-06-01 21:51:07] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 21:51:07] [INFO ] Invariant cache hit.
[2024-06-01 21:51:07] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 160 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 161 ms. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 368 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-00
Product exploration explored 100000 steps with 33333 reset in 910 ms.
Product exploration explored 100000 steps with 33333 reset in 859 ms.
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 transition count 64
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 p2 (NOT p1) (NOT p0)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 17 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN04-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN04-LTLCardinality-00 finished in 2522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 64 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 11 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 21:51:09] [INFO ] Invariant cache hit.
[2024-06-01 21:51:10] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 21:51:10] [INFO ] Invariant cache hit.
[2024-06-01 21:51:10] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-06-01 21:51:10] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 275 ms. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 867 ms.
Product exploration explored 100000 steps with 33333 reset in 934 ms.
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN04-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN04-LTLCardinality-03 finished in 2270 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||G(p1)))))'
Support contains 96 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 21:51:12] [INFO ] Invariant cache hit.
[2024-06-01 21:51:12] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 21:51:12] [INFO ] Invariant cache hit.
[2024-06-01 21:51:12] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-06-01 21:51:12] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-06
Stuttering criterion allowed to conclude after 123 steps with 8 reset in 3 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-06 finished in 271 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&&F(p1))))'
Support contains 80 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 21:51:12] [INFO ] Invariant cache hit.
[2024-06-01 21:51:12] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 21:51:12] [INFO ] Invariant cache hit.
[2024-06-01 21:51:12] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-06-01 21:51:12] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 869 ms.
Product exploration explored 100000 steps with 33333 reset in 892 ms.
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 transition count 64
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 (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN04-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN04-LTLCardinality-07 finished in 2161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 65 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.2 ms
Discarding 63 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 65 /128 variables (removed 63) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 65 cols
[2024-06-01 21:51:14] [INFO ] Computed 24 invariants in 7 ms
[2024-06-01 21:51:14] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 21:51:14] [INFO ] Invariant cache hit.
[2024-06-01 21:51:14] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-06-01 21:51:14] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/128 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 65/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-08
Stuttering criterion allowed to conclude after 309 steps with 21 reset in 9 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-08 finished in 282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 61 are kept as prefixes of interest. Removing 67 places using SCC suffix rule.1 ms
Discarding 67 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 61 /128 variables (removed 67) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 61 cols
[2024-06-01 21:51:14] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 21:51:15] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 21:51:15] [INFO ] Invariant cache hit.
[2024-06-01 21:51:15] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-06-01 21:51:15] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/128 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 61/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-09
Stuttering criterion allowed to conclude after 119 steps with 7 reset in 3 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-09 finished in 203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 61 are kept as prefixes of interest. Removing 67 places using SCC suffix rule.1 ms
Discarding 67 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 61 /128 variables (removed 67) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 61 cols
[2024-06-01 21:51:15] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 21:51:15] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 21:51:15] [INFO ] Invariant cache hit.
[2024-06-01 21:51:15] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-06-01 21:51:15] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/128 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 61/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-12
Stuttering criterion allowed to conclude after 85 steps with 7 reset in 2 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-12 finished in 234 ms.
All properties solved by simple procedures.
Total runtime 10066 ms.
ITS solved all properties within timeout

BK_STOP 1717278675751

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

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

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-BN04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-PT-BN04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690533000707"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-BN04.tgz
mv Sudoku-PT-BN04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;