About the Execution of 2023-gold for Sudoku-COL-AN05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.264 | 3600000.00 | 3359634.00 | 574485.30 | FTTFF?FFFFTTFTFF | 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.r417-tall-171690556100278.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 gold2023
Input is Sudoku-COL-AN05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556100278
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 6.0K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 11:30 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.6K 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.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 11:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 11:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 11:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 11:36 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-AN05-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN05-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN05-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN05-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN05-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN05-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN05-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN05-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN05-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN05-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN05-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN05-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN05-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN05-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN05-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717132739937
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN05
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-31 05:19:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 05:19:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 05:19:01] [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-05-31 05:19:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 05:19:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 646 ms
[2024-05-31 05:19:02] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 200 PT places and 125.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 05:19:02] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-05-31 05:19:02] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
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 3 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN05-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLFireability-15 FALSE 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).
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2024-05-31 05:19:02] [INFO ] Flatten gal took : 11 ms
[2024-05-31 05:19:02] [INFO ] Flatten gal took : 1 ms
Domain [N(5), N(5)] of place Rows breaks symmetries in sort N
[2024-05-31 05:19:02] [INFO ] Unfolded HLPN to a Petri net with 200 places and 125 transitions 500 arcs in 12 ms.
[2024-05-31 05:19:02] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-AN05-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 9 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2024-05-31 05:19:02] [INFO ] Computed 14 invariants in 14 ms
[2024-05-31 05:19:02] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-31 05:19:02] [INFO ] Invariant cache hit.
[2024-05-31 05:19:02] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-05-31 05:19:02] [INFO ] Invariant cache hit.
[2024-05-31 05:19:02] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 75/200 places, 125/125 transitions.
Support contains 75 out of 75 places after structural reductions.
[2024-05-31 05:19:03] [INFO ] Flatten gal took : 42 ms
[2024-05-31 05:19:03] [INFO ] Flatten gal took : 58 ms
[2024-05-31 05:19:03] [INFO ] Input system was already deterministic with 125 transitions.
Finished random walk after 19 steps, including 0 resets, run visited all 5 properties in 175 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
FORMULA Sudoku-COL-AN05-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-COL-AN05-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-COL-AN05-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p2)&&p1))&&p0)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:19:03] [INFO ] Invariant cache hit.
[2024-05-31 05:19:04] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-31 05:19:04] [INFO ] Invariant cache hit.
[2024-05-31 05:19:04] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-31 05:19:04] [INFO ] Invariant cache hit.
[2024-05-31 05:19:04] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 75/75 places, 125/125 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 348 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (OR (LT s13 1) (LT s36 1) (LT s58 1)) (OR (LT s18 1) (LT s41 1) (LT s58 1)) (OR (LT s21 1) (LT s47 1) (LT s61 1)) (OR (LT s3 1) (LT s26 1) (LT s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLFireability-00 finished in 726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:19:04] [INFO ] Invariant cache hit.
[2024-05-31 05:19:04] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-31 05:19:04] [INFO ] Invariant cache hit.
[2024-05-31 05:19:04] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-31 05:19:04] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 05:19:04] [INFO ] Invariant cache hit.
[2024-05-31 05:19:04] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s36 1) (GEQ s58 1)) (AND (GEQ s18 1) (GEQ s41 1) (GEQ s58 1)) (AND (GEQ s21 1) (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s3 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLFireability-04 finished in 261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p1))||p0) U G(!p1)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:19:04] [INFO ] Invariant cache hit.
[2024-05-31 05:19:04] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-31 05:19:04] [INFO ] Invariant cache hit.
[2024-05-31 05:19:04] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-31 05:19:04] [INFO ] Invariant cache hit.
[2024-05-31 05:19:05] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 251 ms :[p1, (NOT p1), false, (NOT p1), true, false, p1]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (GEQ s13 1) (GEQ s36 1) (GEQ s58 1)) (AND (GEQ s18 1) (GEQ s41 1) (GEQ s58 1)) (AND (GEQ s21 1) (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s3 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4548 reset in 1188 ms.
Product exploration explored 100000 steps with 4547 reset in 1154 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 134 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[p1, (NOT p1), false, (NOT p1), true, false, p1]
Incomplete random walk after 10000 steps, including 455 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 05:19:08] [INFO ] Invariant cache hit.
[2024-05-31 05:19:08] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 11 factoid took 274 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[p1, false, (NOT p1), true, false, p1]
Stuttering acceptance computed with spot in 215 ms :[p1, false, (NOT p1), true, false, p1]
[2024-05-31 05:19:09] [INFO ] Invariant cache hit.
[2024-05-31 05:19:10] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 13 ms returned sat
[2024-05-31 05:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:19:10] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-31 05:19:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:19:10] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 8 ms returned sat
[2024-05-31 05:19:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:19:10] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-31 05:19:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-31 05:19:10] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG p1
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:19:10] [INFO ] Invariant cache hit.
[2024-05-31 05:19:10] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-31 05:19:10] [INFO ] Invariant cache hit.
[2024-05-31 05:19:10] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-31 05:19:10] [INFO ] Invariant cache hit.
[2024-05-31 05:19:10] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 75/75 places, 125/125 transitions.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 123 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[p1, false, (NOT p1), true, false, p1]
Finished random walk after 21 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 158 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[p1, false, (NOT p1), true, false, p1]
Stuttering acceptance computed with spot in 183 ms :[p1, false, (NOT p1), true, false, p1]
[2024-05-31 05:19:11] [INFO ] Invariant cache hit.
[2024-05-31 05:19:12] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 12 ms returned sat
[2024-05-31 05:19:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:19:12] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-31 05:19:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:19:12] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 6 ms returned sat
[2024-05-31 05:19:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:19:12] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-31 05:19:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 05:19:12] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 212 ms :[p1, false, (NOT p1), true, false, p1]
Product exploration explored 100000 steps with 4547 reset in 911 ms.
Product exploration explored 100000 steps with 4549 reset in 942 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 209 ms :[p1, false, (NOT p1), true, false, p1]
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:19:15] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 05:19:15] [INFO ] Invariant cache hit.
[2024-05-31 05:19:16] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 75/75 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin10605941095711852455
[2024-05-31 05:19:16] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10605941095711852455
Running compilation step : cd /tmp/ltsmin10605941095711852455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 409 ms.
Running link step : cd /tmp/ltsmin10605941095711852455;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10605941095711852455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4060770171867276409.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:19:31] [INFO ] Invariant cache hit.
[2024-05-31 05:19:31] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 05:19:31] [INFO ] Invariant cache hit.
[2024-05-31 05:19:31] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-31 05:19:31] [INFO ] Invariant cache hit.
[2024-05-31 05:19:31] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 75/75 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin10056380119284238983
[2024-05-31 05:19:31] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10056380119284238983
Running compilation step : cd /tmp/ltsmin10056380119284238983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 287 ms.
Running link step : cd /tmp/ltsmin10056380119284238983;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10056380119284238983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11658132914766436594.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 05:19:46] [INFO ] Flatten gal took : 11 ms
[2024-05-31 05:19:46] [INFO ] Flatten gal took : 9 ms
[2024-05-31 05:19:46] [INFO ] Time to serialize gal into /tmp/LTL9232125897415286332.gal : 3 ms
[2024-05-31 05:19:46] [INFO ] Time to serialize properties into /tmp/LTL3265170697693518871.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9232125897415286332.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4137911360993658031.hoa' '-atoms' '/tmp/LTL3265170697693518871.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3265170697693518871.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4137911360993658031.hoa
Detected timeout of ITS tools.
[2024-05-31 05:20:01] [INFO ] Flatten gal took : 12 ms
[2024-05-31 05:20:01] [INFO ] Flatten gal took : 12 ms
[2024-05-31 05:20:01] [INFO ] Time to serialize gal into /tmp/LTL18113837642609329212.gal : 2 ms
[2024-05-31 05:20:01] [INFO ] Time to serialize properties into /tmp/LTL15875985788603855523.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18113837642609329212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15875985788603855523.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((((((((X(X("((((((((((Rows_13>=1)&&(Cells_11>=1))&&(Columns_8>=1))||(((Rows_18>=1)&&(Cells_16>=1))&&(Columns_8>=1)))||((((Rows_21>...19117
Formula 0 simplified : (!"(((((((((Rows_7>=1)&&(Cells_5>=1))&&(Columns_2>=1))||(((Rows_22>=1)&&(Cells_24>=1))&&(Columns_22>=1)))||((((Rows_4>=1)&&(Cells_3>...19092
Detected timeout of ITS tools.
[2024-05-31 05:20:16] [INFO ] Flatten gal took : 25 ms
[2024-05-31 05:20:16] [INFO ] Applying decomposition
[2024-05-31 05:20:16] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15880159227580642175.txt' '-o' '/tmp/graph15880159227580642175.bin' '-w' '/tmp/graph15880159227580642175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15880159227580642175.bin' '-l' '-1' '-v' '-w' '/tmp/graph15880159227580642175.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:20:16] [INFO ] Decomposing Gal with order
[2024-05-31 05:20:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:20:16] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-31 05:20:16] [INFO ] Flatten gal took : 35 ms
[2024-05-31 05:20:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-31 05:20:17] [INFO ] Time to serialize gal into /tmp/LTL9549938438246808349.gal : 71 ms
[2024-05-31 05:20:17] [INFO ] Time to serialize properties into /tmp/LTL14184049700899380744.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9549938438246808349.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14184049700899380744.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((((((((X(X("((((((((((u13.Rows_13>=1)&&(u36.Cells_11>=1))&&(u58.Columns_8>=1))||(((u18.Rows_18>=1)&&(u41.Cells_16>=1))&&(u58.Colum...23467
Formula 0 simplified : (!"(((((((((u7.Rows_7>=1)&&(u30.Cells_5>=1))&&(u52.Columns_2>=1))||(((u22.Rows_22>=1)&&(u49.Cells_24>=1))&&(u72.Columns_22>=1)))||((...23442
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17932311701915856794
[2024-05-31 05:20:32] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17932311701915856794
Running compilation step : cd /tmp/ltsmin17932311701915856794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 300 ms.
Running link step : cd /tmp/ltsmin17932311701915856794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17932311701915856794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(X((LTLAPp1==true)))||(LTLAPp0==true)) U [](!(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN05-LTLFireability-05 finished in 102300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:20:47] [INFO ] Invariant cache hit.
[2024-05-31 05:20:47] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-31 05:20:47] [INFO ] Invariant cache hit.
[2024-05-31 05:20:47] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-31 05:20:47] [INFO ] Invariant cache hit.
[2024-05-31 05:20:47] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s36 1) (GEQ s58 1)) (AND (GEQ s18 1) (GEQ s41 1) (GEQ s58 1)) (AND (GEQ s21 1) (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s3 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLFireability-07 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:20:47] [INFO ] Invariant cache hit.
[2024-05-31 05:20:47] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-31 05:20:47] [INFO ] Invariant cache hit.
[2024-05-31 05:20:47] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-31 05:20:47] [INFO ] Invariant cache hit.
[2024-05-31 05:20:47] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s36 1) (GEQ s58 1)) (AND (GEQ s18 1) (GEQ s41 1) (GEQ s58 1)) (AND (GEQ s21 1) (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s3 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 855 ms.
Product exploration explored 100000 steps with 50000 reset in 834 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN05-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLFireability-11 finished in 2017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)&&(G(F(p1))||(F(!p0)&&X(F(p1)))))))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:20:49] [INFO ] Invariant cache hit.
[2024-05-31 05:20:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-31 05:20:49] [INFO ] Invariant cache hit.
[2024-05-31 05:20:49] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-31 05:20:49] [INFO ] Invariant cache hit.
[2024-05-31 05:20:49] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 133 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s36 1) (GEQ s58 1)) (AND (GEQ s18 1) (GEQ s41 1) (GEQ s58 1)) (AND (GEQ s21 1) (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s3 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLFireability-14 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p1))||p0) U G(!p1)))'
[2024-05-31 05:20:49] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17558236261065208595
[2024-05-31 05:20:49] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2024-05-31 05:20:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:20:49] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2024-05-31 05:20:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:20:49] [INFO ] Applying decomposition
[2024-05-31 05:20:49] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9013709856601145387.txt' '-o' '/tmp/graph9013709856601145387.bin' '-w' '/tmp/graph9013709856601145387.weights'
[2024-05-31 05:20:49] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2024-05-31 05:20:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:20:49] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17558236261065208595
Running compilation step : cd /tmp/ltsmin17558236261065208595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9013709856601145387.bin' '-l' '-1' '-v' '-w' '/tmp/graph9013709856601145387.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:20:49] [INFO ] Decomposing Gal with order
[2024-05-31 05:20:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:20:49] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-31 05:20:50] [INFO ] Flatten gal took : 18 ms
[2024-05-31 05:20:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-31 05:20:50] [INFO ] Time to serialize gal into /tmp/LTLFireability18217693155703102926.gal : 2 ms
[2024-05-31 05:20:50] [INFO ] Time to serialize properties into /tmp/LTLFireability12775399041169631249.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18217693155703102926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12775399041169631249.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !(((("(((((((((u13.Rows_13>=1)&&(u36.Cells_11>=1))&&(u58.Columns_8>=1))||(((u18.Rows_18>=1)&&(u41.Cells_16>=1))&&(u58.Columns_8>=1)))|...23463
Formula 0 simplified : (!"(((((((((u13.Rows_13>=1)&&(u36.Cells_11>=1))&&(u58.Columns_8>=1))||(((u18.Rows_18>=1)&&(u41.Cells_16>=1))&&(u58.Columns_8>=1)))||...23440
Compilation finished in 326 ms.
Running link step : cd /tmp/ltsmin17558236261065208595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin17558236261065208595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(X((LTLAPp1==true)))||(LTLAPp0==true)) U [](!(LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: LTL layer: formula: ((X(X((LTLAPp1==true)))||(LTLAPp0==true)) U [](!(LTLAPp1==true)))
pins2lts-mc-linux64( 1/ 8), 0.002: "((X(X((LTLAPp1==true)))||(LTLAPp0==true)) U [](!(LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.036: There are 128 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.036: State length is 76, there are 141 groups
pins2lts-mc-linux64( 0/ 8), 0.036: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.036: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.036: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.036: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.207: [Blue] ~23 levels ~960 states ~8896 transitions
pins2lts-mc-linux64( 0/ 8), 0.230: [Blue] ~24 levels ~1920 states ~11408 transitions
pins2lts-mc-linux64( 2/ 8), 0.268: [Blue] ~27 levels ~3840 states ~18440 transitions
pins2lts-mc-linux64( 0/ 8), 0.348: [Blue] ~25 levels ~7680 states ~31488 transitions
pins2lts-mc-linux64( 2/ 8), 0.504: [Blue] ~27 levels ~15360 states ~74728 transitions
pins2lts-mc-linux64( 0/ 8), 0.793: [Blue] ~26 levels ~30720 states ~132000 transitions
pins2lts-mc-linux64( 0/ 8), 1.403: [Blue] ~26 levels ~61440 states ~302648 transitions
pins2lts-mc-linux64( 0/ 8), 1.974: [Blue] ~26 levels ~122880 states ~609208 transitions
pins2lts-mc-linux64( 0/ 8), 4.135: [Blue] ~27 levels ~245760 states ~1215272 transitions
pins2lts-mc-linux64( 0/ 8), 5.457: [Blue] ~27 levels ~491520 states ~2882888 transitions
pins2lts-mc-linux64( 5/ 8), 7.276: [Blue] ~27 levels ~983040 states ~5715648 transitions
pins2lts-mc-linux64( 6/ 8), 10.409: [Blue] ~30 levels ~1966080 states ~12901792 transitions
pins2lts-mc-linux64( 6/ 8), 16.547: [Blue] ~30 levels ~3932160 states ~26854096 transitions
pins2lts-mc-linux64( 6/ 8), 29.167: [Blue] ~30 levels ~7864320 states ~55359736 transitions
pins2lts-mc-linux64( 6/ 8), 55.548: [Blue] ~30 levels ~15728640 states ~115699120 transitions
pins2lts-mc-linux64( 6/ 8), 112.270: [Blue] ~30 levels ~31457280 states ~243360736 transitions
pins2lts-mc-linux64( 7/ 8), 172.516: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 172.560:
pins2lts-mc-linux64( 0/ 8), 172.560: Explored 43768616 states 352867705 transitions, fanout: 8.062
pins2lts-mc-linux64( 0/ 8), 172.560: Total exploration time 172.470 sec (172.440 sec minimum, 172.455 sec on average)
pins2lts-mc-linux64( 0/ 8), 172.560: States per second: 253775, Transitions per second: 2045966
pins2lts-mc-linux64( 0/ 8), 172.560:
pins2lts-mc-linux64( 0/ 8), 172.560: State space has 43773665 states, 6156179 are accepting
pins2lts-mc-linux64( 0/ 8), 172.560: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 172.560: blue states: 43768616 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 172.560: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 172.560: all-red states: 6156179 (14.06%), bogus 4 (0.00%)
pins2lts-mc-linux64( 0/ 8), 172.560:
pins2lts-mc-linux64( 0/ 8), 172.560: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 172.560:
pins2lts-mc-linux64( 0/ 8), 172.560: Queue width: 8B, total height: 222, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 172.560: Tree memory: 590.0MB, 14.1 B/state, compr.: 4.6%
pins2lts-mc-linux64( 0/ 8), 172.560: Tree fill ratio (roots/leafs): 32.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 172.560: Stored 125 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 172.560: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 172.560: Est. total memory use: 590.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17558236261065208595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(X((LTLAPp1==true)))||(LTLAPp0==true)) U [](!(LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17558236261065208595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(X((LTLAPp1==true)))||(LTLAPp0==true)) U [](!(LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-31 05:41:48] [INFO ] Applying decomposition
[2024-05-31 05:41:49] [INFO ] Flatten gal took : 121 ms
[2024-05-31 05:41:49] [INFO ] Decomposing Gal with order
[2024-05-31 05:41:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:41:49] [INFO ] Removed a total of 205 redundant transitions.
[2024-05-31 05:41:49] [INFO ] Flatten gal took : 103 ms
[2024-05-31 05:41:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 28 ms.
[2024-05-31 05:41:49] [INFO ] Time to serialize gal into /tmp/LTLFireability5974637769234423472.gal : 30 ms
[2024-05-31 05:41:49] [INFO ] Time to serialize properties into /tmp/LTLFireability337857620249749218.ltl : 26 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5974637769234423472.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability337857620249749218.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((("(((((((((NN13.Rows_13>=1)&&(NN11.Cells_11>=1))&&(NN8.Columns_8>=1))||(((NN18.Rows_18>=1)&&(NN16.Cells_16>=1))&&(NN8.Columns_8>=1...24288
Formula 0 simplified : (!"(((((((((NN13.Rows_13>=1)&&(NN11.Cells_11>=1))&&(NN8.Columns_8>=1))||(((NN18.Rows_18>=1)&&(NN16.Cells_16>=1))&&(NN8.Columns_8>=1)...24265
Detected timeout of ITS tools.
[2024-05-31 06:02:34] [INFO ] Flatten gal took : 187 ms
[2024-05-31 06:02:35] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-31 06:02:35] [INFO ] Transformed 75 places.
[2024-05-31 06:02:35] [INFO ] Transformed 125 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
java.lang.NullPointerException: Cannot read the array length because "order" is null
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.computeOrderWithGreatSPN(MultiOrderRunner.java:60)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:143)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:855)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 06:02:35] [INFO ] Time to serialize gal into /tmp/LTLFireability7461161160162211878.gal : 4 ms
[2024-05-31 06:02:35] [INFO ] Time to serialize properties into /tmp/LTLFireability12595463927422188019.ltl : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7461161160162211878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12595463927422188019.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((("(((((((((Rows_13>=1)&&(Cells_11>=1))&&(Columns_8>=1))||(((Rows_18>=1)&&(Cells_16>=1))&&(Columns_8>=1)))||((((Rows_21>=1)&&(Cells...19113
Formula 0 simplified : (!"(((((((((Rows_13>=1)&&(Cells_11>=1))&&(Columns_8>=1))||(((Rows_18>=1)&&(Cells_16>=1))&&(Columns_8>=1)))||((((Rows_21>=1)&&(Cells_...19090
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 147820 kB
After kill :
MemTotal: 16393216 kB
MemFree: 13668964 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-AN05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is Sudoku-COL-AN05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556100278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN05.tgz
mv Sudoku-COL-AN05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;