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-171690532300419.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Sudoku-COL-AN02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532300419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.0K Apr 12 10:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 10:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 10:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 10:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 10:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 10:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717256505165

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:41:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:41:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:41:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 15:41:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 15:41:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 503 ms
[2024-06-01 15:41:46] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 20 PT places and 8.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 15:41:47] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-06-01 15:41:47] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN02-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40004 steps (6664 resets) in 922 ms. (43 steps per ms) remains 8/23 properties
BEST_FIRST walk for 40004 steps (6664 resets) in 285 ms. (139 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (6664 resets) in 235 ms. (169 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (6664 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (6664 resets) in 290 ms. (137 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (6664 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (6664 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (6664 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (6664 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
// Phase 1: matrix 1 rows 4 cols
[2024-06-01 15:41:48] [INFO ] Computed 3 invariants in 2 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 8 solved, 0 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 243ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-AN02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:41:48] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2024-06-01 15:41:48] [INFO ] Flatten gal took : 12 ms
[2024-06-01 15:41:48] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA Sudoku-COL-AN02-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:41:48] [INFO ] Flatten gal took : 1 ms
Domain [N(2), N(2)] of place Rows breaks symmetries in sort N
[2024-06-01 15:41:48] [INFO ] Unfolded HLPN to a Petri net with 20 places and 8 transitions 32 arcs in 6 ms.
[2024-06-01 15:41:48] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Support contains 20 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2024-06-01 15:41:48] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 15:41:48] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 15:41:48] [INFO ] Invariant cache hit.
[2024-06-01 15:41:48] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 174 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 194 ms. Remains : 20/20 places, 8/8 transitions.
Support contains 20 out of 20 places after structural reductions.
[2024-06-01 15:41:48] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:41:48] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:41:48] [INFO ] Input system was already deterministic with 8 transitions.
RANDOM walk for 22 steps (2 resets) in 6 ms. (3 steps per ms) remains 0/9 properties
Computed a total of 20 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 15:41:48] [INFO ] Invariant cache hit.
[2024-06-01 15:41:48] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 15:41:48] [INFO ] Invariant cache hit.
[2024-06-01 15:41:49] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 87 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 88 ms. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLCardinality-02 finished in 354 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((p0&&X((p0 U (p1||G(p0))))))&&(p2||(!p1&&F(p0))))))'
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 15:41:49] [INFO ] Invariant cache hit.
[2024-06-01 15:41:49] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 15:41:49] [INFO ] Invariant cache hit.
[2024-06-01 15:41:49] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 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 66 ms. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLCardinality-03 finished in 263 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 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 12 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 15:41:49] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 15:41:49] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 15:41:49] [INFO ] Invariant cache hit.
[2024-06-01 15:41:49] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-06-01 15:41:49] [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 : 12/20 places, 8/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 12/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLCardinality-06
Stuttering criterion allowed to conclude after 14 steps with 3 reset in 1 ms.
FORMULA Sudoku-COL-AN02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLCardinality-06 finished in 193 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(F((p1||G(p2)))))))'
Support contains 16 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2024-06-01 15:41:49] [INFO ] Computed 12 invariants in 0 ms
[2024-06-01 15:41:49] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 15:41:49] [INFO ] Invariant cache hit.
[2024-06-01 15:41:49] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-06-01 15:41:49] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN02-LTLCardinality-07
Product exploration explored 100000 steps with 22211 reset in 245 ms.
Product exploration explored 100000 steps with 22198 reset in 167 ms.
Computed a total of 20 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 8
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 p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND p2 (NOT p1) 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 : []
Knowledge based reduction with 18 factoid took 756 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8919 resets) in 228 ms. (174 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (2216 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2224 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
[2024-06-01 15:41:51] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4/20 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/28 variables, 20/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 32 constraints, problems are : Problem set: 1 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 16/28 variables, and 8 constraints, problems are : Problem set: 2 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 8/12 constraints, State Equation: 0/20 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND p2 (NOT p1) 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)))), (G (OR (NOT p0) p2 p1)), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 20 factoid took 1754 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
[2024-06-01 15:41:53] [INFO ] Invariant cache hit.
[2024-06-01 15:41:53] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2024-06-01 15:41:53] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 15:41:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:41:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 15:41:53] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 15:41:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 15:41:53] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p1))
Support contains 8 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 15:41:53] [INFO ] Invariant cache hit.
[2024-06-01 15:41:53] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 15:41:53] [INFO ] Invariant cache hit.
[2024-06-01 15:41:53] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-06-01 15:41:53] [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 58 ms. Remains : 20/20 places, 8/8 transitions.
Computed a total of 20 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 8
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 p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 19 steps (1 resets) in 4 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 11 factoid took 422 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-06-01 15:41:54] [INFO ] Invariant cache hit.
[2024-06-01 15:41:54] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 15:41:54] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 15:41:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:41:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 15:41:54] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 15:41:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 15:41:54] [INFO ] Added : 0 causal constraints over 0 iterations in 33 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 22213 reset in 106 ms.
Product exploration explored 100000 steps with 22284 reset in 110 ms.
Support contains 8 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 12 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 15:41:54] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 15:41:54] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 15:41:54] [INFO ] Invariant cache hit.
[2024-06-01 15:41:54] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-06-01 15:41:54] [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 : 12/20 places, 8/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 12/20 places, 8/8 transitions.
Treatment of property Sudoku-COL-AN02-LTLCardinality-07 finished in 5290 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 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 12 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
[2024-06-01 15:41:55] [INFO ] Invariant cache hit.
[2024-06-01 15:41:55] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 15:41:55] [INFO ] Invariant cache hit.
[2024-06-01 15:41:55] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-06-01 15:41:55] [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 : 12/20 places, 8/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58 ms. Remains : 12/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLCardinality-11
Product exploration explored 100000 steps with 22238 reset in 100 ms.
Product exploration explored 100000 steps with 22233 reset in 119 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-06-01 15:41:55] [INFO ] Invariant cache hit.
[2024-06-01 15:41:55] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-01 15:41:55] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 15:41:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:41:55] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 0 ms returned sat
[2024-06-01 15:41:55] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 15:41:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 15:41:55] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 15:41:55] [INFO ] Invariant cache hit.
[2024-06-01 15:41:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 15:41:55] [INFO ] Invariant cache hit.
[2024-06-01 15:41:55] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 15:41:55] [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 64 ms. Remains : 12/12 places, 8/8 transitions.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-06-01 15:41:56] [INFO ] Invariant cache hit.
[2024-06-01 15:41:56] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-01 15:41:56] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 15:41:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:41:56] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 0 ms returned sat
[2024-06-01 15:41:56] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 15:41:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 15:41:56] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22249 reset in 84 ms.
Product exploration explored 100000 steps with 22204 reset in 89 ms.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 15:41:56] [INFO ] Invariant cache hit.
[2024-06-01 15:41:56] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 15:41:56] [INFO ] Invariant cache hit.
[2024-06-01 15:41:56] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-06-01 15:41:56] [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 65 ms. Remains : 12/12 places, 8/8 transitions.
Treatment of property Sudoku-COL-AN02-LTLCardinality-11 finished in 1504 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(X(F(p1))))))'
Support contains 8 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2024-06-01 15:41:56] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 15:41:56] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 15:41:56] [INFO ] Invariant cache hit.
[2024-06-01 15:41:56] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 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 59 ms. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : Sudoku-COL-AN02-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN02-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLCardinality-12 finished in 279 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(F((p1||G(p2)))))))'
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)))'
[2024-06-01 15:41:57] [INFO ] Flatten gal took : 2 ms
[2024-06-01 15:41:57] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 15:41:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20 places, 8 transitions and 32 arcs took 4 ms.
Total runtime 10779 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Sudoku-COL-AN02-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Sudoku-COL-AN02-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717256517757

--------------------
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
mcc2024
ltl formula name Sudoku-COL-AN02-LTLCardinality-07
ltl formula formula --ltl=/tmp/911/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 20 places, 8 transitions and 32 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/911/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/911/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/911/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/911/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 13 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 21, there are 19 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 73
pnml2lts-mc( 0/ 4): unique states count: 73
pnml2lts-mc( 0/ 4): unique transitions count: 230
pnml2lts-mc( 0/ 4): - self-loop count: 12
pnml2lts-mc( 0/ 4): - claim dead count: 190
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 104
pnml2lts-mc( 0/ 4): - cum. max stack depth: 19
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 104 states 437 transitions, fanout: 4.202
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 28.2 B/state, compr.: 32.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Sudoku-COL-AN02-LTLCardinality-11
ltl formula formula --ltl=/tmp/911/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 20 places, 8 transitions and 32 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/911/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/911/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/911/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/911/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 13 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 21, there are 12 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 39
pnml2lts-mc( 0/ 4): unique states count: 39
pnml2lts-mc( 0/ 4): unique transitions count: 82
pnml2lts-mc( 0/ 4): - self-loop count: 6
pnml2lts-mc( 0/ 4): - claim dead count: 55
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 50
pnml2lts-mc( 0/ 4): - cum. max stack depth: 17
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 50 states 140 transitions, fanout: 2.800
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 35.1 B/state, compr.: 40.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN02"
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-COL-AN02, 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-171690532300419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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