About the Execution of LTSMin+red for Sudoku-COL-AN03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 517.132 | 15207.00 | 27177.00 | 185.70 | TFTFTFFFFFTTTTFT | normal |
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-171690532300427.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-AN03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532300427
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.9K Apr 12 10:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 10:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 10:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 10:06 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 4.0K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 10:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 10:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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-AN03-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN03-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN03-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN03-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN03-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN03-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN03-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN03-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN03-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN03-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN03-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN03-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN03-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN03-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN03-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN03-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717256567074
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-AN03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:42:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:42:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:42:48] [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:42:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 15:42:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 485 ms
[2024-06-01 15:42:48] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 54 PT places and 27.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 15:42:48] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-06-01 15:42:48] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-COL-AN03-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-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 11 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 40000 steps (3636 resets) in 503 ms. (79 steps per ms) remains 4/16 properties
BEST_FIRST walk for 40000 steps (3636 resets) in 395 ms. (101 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3636 resets) in 303 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3636 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3636 resets) in 190 ms. (209 steps per ms) remains 4/4 properties
// Phase 1: matrix 1 rows 4 cols
[2024-06-01 15:42:49] [INFO ] Computed 3 invariants in 3 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 4 solved, 0 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA Sudoku-COL-AN03-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:42:49] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-06-01 15:42:49] [INFO ] Flatten gal took : 13 ms
FORMULA Sudoku-COL-AN03-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:42:49] [INFO ] Flatten gal took : 1 ms
Domain [N(3), N(3)] of place Rows breaks symmetries in sort N
[2024-06-01 15:42:49] [INFO ] Unfolded HLPN to a Petri net with 54 places and 27 transitions 108 arcs in 8 ms.
[2024-06-01 15:42:49] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Support contains 54 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 54 cols
[2024-06-01 15:42:49] [INFO ] Computed 27 invariants in 4 ms
[2024-06-01 15:42:49] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 15:42:49] [INFO ] Invariant cache hit.
[2024-06-01 15:42:49] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 113 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 131 ms. Remains : 54/54 places, 27/27 transitions.
Support contains 54 out of 54 places after structural reductions.
[2024-06-01 15:42:49] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:42:49] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:42:49] [INFO ] Input system was already deterministic with 27 transitions.
RANDOM walk for 40000 steps (4685 resets) in 976 ms. (40 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40003 steps (439 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (439 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
[2024-06-01 15:42:50] [INFO ] Invariant cache hit.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Real declared 54/81 variables, and 27 constraints, problems are : Problem set: 2 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/54 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Sudoku-COL-AN03-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
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-COL-AN03-LTLCardinality-11 TRUE 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' '!(X(p0))'
Support contains 27 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 15:42:50] [INFO ] Invariant cache hit.
[2024-06-01 15:42:50] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 15:42:50] [INFO ] Invariant cache hit.
[2024-06-01 15:42:50] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 126 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 128 ms. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN03-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-LTLCardinality-01 finished in 415 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 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 15:42:50] [INFO ] Invariant cache hit.
[2024-06-01 15:42:51] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 15:42:51] [INFO ] Invariant cache hit.
[2024-06-01 15:42:51] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-06-01 15:42:51] [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 108 ms. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-LTLCardinality-02
Product exploration explored 100000 steps with 16440 reset in 473 ms.
Product exploration explored 100000 steps with 16454 reset in 344 ms.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
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 (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT 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 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:42:52] [INFO ] Invariant cache hit.
[2024-06-01 15:42:52] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2024-06-01 15:42:52] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 15:42:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:42:52] [INFO ] [Nat]Absence check using 27 positive place invariants in 6 ms returned sat
[2024-06-01 15:42:52] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 15:42:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 15:42:52] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 15:42:52] [INFO ] Invariant cache hit.
[2024-06-01 15:42:52] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 15:42:52] [INFO ] Invariant cache hit.
[2024-06-01 15:42:52] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-06-01 15:42:52] [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 95 ms. Remains : 54/54 places, 27/27 transitions.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
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 (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:42:53] [INFO ] Invariant cache hit.
[2024-06-01 15:42:53] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2024-06-01 15:42:53] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 15:42:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:42:53] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2024-06-01 15:42:53] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-06-01 15:42:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 15:42:53] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16461 reset in 292 ms.
Product exploration explored 100000 steps with 16475 reset in 292 ms.
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 15:42:54] [INFO ] Invariant cache hit.
[2024-06-01 15:42:54] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 15:42:54] [INFO ] Invariant cache hit.
[2024-06-01 15:42:54] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-06-01 15:42: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
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 54/54 places, 27/27 transitions.
Treatment of property Sudoku-COL-AN03-LTLCardinality-02 finished in 3223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (X(G(p0))||(!p1&&X((p0&&F(G(!p1)))))))))'
Support contains 9 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 15:42:54] [INFO ] Invariant cache hit.
[2024-06-01 15:42:54] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 15:42:54] [INFO ] Invariant cache hit.
[2024-06-01 15:42:54] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 100 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 101 ms. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN03-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-LTLCardinality-05 finished in 236 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&&G(p1)))))'
Support contains 54 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 15:42:54] [INFO ] Invariant cache hit.
[2024-06-01 15:42:54] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 15:42:54] [INFO ] Invariant cache hit.
[2024-06-01 15:42:54] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 77 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 77 ms. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN03-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-LTLCardinality-07 finished in 290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 45 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 15:42:54] [INFO ] Invariant cache hit.
[2024-06-01 15:42:54] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 15:42:54] [INFO ] Invariant cache hit.
[2024-06-01 15:42:54] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 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 83 ms. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN03-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-LTLCardinality-08 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' '!(X(F(p0)))'
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 15:42:54] [INFO ] Invariant cache hit.
[2024-06-01 15:42:54] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 15:42:54] [INFO ] Invariant cache hit.
[2024-06-01 15:42:55] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 89 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 92 ms. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-LTLCardinality-10
Product exploration explored 100000 steps with 16666 reset in 290 ms.
Product exploration explored 100000 steps with 16666 reset in 320 ms.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
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 (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 7 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:42:56] [INFO ] Invariant cache hit.
[2024-06-01 15:42:56] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2024-06-01 15:42:56] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 15:42:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:42:56] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2024-06-01 15:42:56] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 15:42:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 15:42:56] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 15:42:56] [INFO ] Invariant cache hit.
[2024-06-01 15:42:56] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 15:42:56] [INFO ] Invariant cache hit.
[2024-06-01 15:42:56] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-06-01 15:42:56] [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 94 ms. Remains : 54/54 places, 27/27 transitions.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
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 (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:42:57] [INFO ] Invariant cache hit.
[2024-06-01 15:42:57] [INFO ] [Real]Absence check using 27 positive place invariants in 3 ms returned sat
[2024-06-01 15:42:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 15:42:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:42:57] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2024-06-01 15:42:57] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 15:42:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 15:42:57] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 296 ms.
Product exploration explored 100000 steps with 16666 reset in 303 ms.
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 15:42:57] [INFO ] Invariant cache hit.
[2024-06-01 15:42:57] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 15:42:57] [INFO ] Invariant cache hit.
[2024-06-01 15:42:58] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-06-01 15:42:58] [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 109 ms. Remains : 54/54 places, 27/27 transitions.
Treatment of property Sudoku-COL-AN03-LTLCardinality-10 finished in 3135 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)))'
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)))'
Found a Shortening insensitive property : Sudoku-COL-AN03-LTLCardinality-10
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 15:42:58] [INFO ] Invariant cache hit.
[2024-06-01 15:42:58] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 15:42:58] [INFO ] Invariant cache hit.
[2024-06-01 15:42:58] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 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 LI_LTL mode , in 1 iterations and 86 ms. Remains : 54/54 places, 27/27 transitions.
Running random walk in product with property : Sudoku-COL-AN03-LTLCardinality-10
Product exploration explored 100000 steps with 16666 reset in 314 ms.
Product exploration explored 100000 steps with 16666 reset in 290 ms.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
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 (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:42:59] [INFO ] Invariant cache hit.
[2024-06-01 15:42:59] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2024-06-01 15:42:59] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 15:42:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:42:59] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2024-06-01 15:42:59] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 15:42:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 15:42:59] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 15:42:59] [INFO ] Invariant cache hit.
[2024-06-01 15:42:59] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 15:42:59] [INFO ] Invariant cache hit.
[2024-06-01 15:42:59] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-06-01 15:42:59] [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 77 ms. Remains : 54/54 places, 27/27 transitions.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
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 (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 266 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:43:00] [INFO ] Invariant cache hit.
[2024-06-01 15:43:00] [INFO ] [Real]Absence check using 27 positive place invariants in 3 ms returned sat
[2024-06-01 15:43:00] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 15:43:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:43:00] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2024-06-01 15:43:00] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 15:43:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 15:43:00] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 293 ms.
Product exploration explored 100000 steps with 16666 reset in 302 ms.
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 15:43:01] [INFO ] Invariant cache hit.
[2024-06-01 15:43:01] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 15:43:01] [INFO ] Invariant cache hit.
[2024-06-01 15:43:01] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-06-01 15:43:01] [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 95 ms. Remains : 54/54 places, 27/27 transitions.
Treatment of property Sudoku-COL-AN03-LTLCardinality-10 finished in 3128 ms.
[2024-06-01 15:43:01] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:43:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 15:43:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 27 transitions and 108 arcs took 3 ms.
Total runtime 13167 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Sudoku-COL-AN03-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Sudoku-COL-AN03-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717256582281
--------------------
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-AN03-LTLCardinality-02
ltl formula formula --ltl=/tmp/1051/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 54 places, 27 transitions and 108 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1051/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1051/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1051/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1051/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 29 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 55, there are 30 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( 3/ 4): ~10 levels ~10000 states ~45956 transitions
pnml2lts-mc( 3/ 4): ~10 levels ~20000 states ~118964 transitions
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: 20263
pnml2lts-mc( 0/ 4): unique states count: 20263
pnml2lts-mc( 0/ 4): unique transitions count: 128748
pnml2lts-mc( 0/ 4): - self-loop count: 390
pnml2lts-mc( 0/ 4): - claim dead count: 108373
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 20366
pnml2lts-mc( 0/ 4): - cum. max stack depth: 40
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20366 states 130786 transitions, fanout: 6.422
pnml2lts-mc( 0/ 4): Total exploration time 0.160 sec (0.160 sec minimum, 0.160 sec on average)
pnml2lts-mc( 0/ 4): States per second: 127288, Transitions per second: 817412
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.5MB, 24.6 B/state, compr.: 11.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.5MB (~256.0MB paged-in)
ltl formula name Sudoku-COL-AN03-LTLCardinality-10
ltl formula formula --ltl=/tmp/1051/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
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 54 places, 27 transitions and 108 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1051/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1051/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1051/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1051/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 29 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 55, there are 29 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: 8488
pnml2lts-mc( 0/ 4): unique states count: 8488
pnml2lts-mc( 0/ 4): unique transitions count: 35883
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 27501
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8537
pnml2lts-mc( 0/ 4): - cum. max stack depth: 24
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8537 states 36563 transitions, fanout: 4.283
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 106712, Transitions per second: 457038
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 29.7 B/state, compr.: 13.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~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-AN03"
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-AN03, 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-171690532300427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN03.tgz
mv Sudoku-COL-AN03 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 '
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 ;