Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r487-tall-167912702700188.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Sudoku-PT-AN04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702700188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 38K Feb 26 09:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 224K Feb 26 09:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Feb 26 09:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 152K Feb 26 09:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 134K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 65K Feb 26 09:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 358K Feb 26 09:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 135K Feb 26 09:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 674K Feb 26 09:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 44K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679172731049

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 20:52:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:52:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:52:12] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-18 20:52:12] [INFO ] Transformed 112 places.
[2023-03-18 20:52:12] [INFO ] Transformed 64 transitions.
[2023-03-18 20:52:12] [INFO ] Parsed PT model containing 112 places and 64 transitions and 256 arcs in 92 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 10 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2023-03-18 20:52:12] [INFO ] Computed 11 place invariants in 12 ms
[2023-03-18 20:52:13] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-18 20:52:13] [INFO ] Invariant cache hit.
[2023-03-18 20:52:13] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-03-18 20:52:13] [INFO ] Invariant cache hit.
[2023-03-18 20:52:13] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 601 ms. Remains : 48/112 places, 64/64 transitions.
Support contains 48 out of 48 places after structural reductions.
[2023-03-18 20:52:13] [INFO ] Flatten gal took : 26 ms
[2023-03-18 20:52:13] [INFO ] Flatten gal took : 21 ms
[2023-03-18 20:52:13] [INFO ] Input system was already deterministic with 64 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 15 properties in 10 ms. (steps per millisecond=1 )
FORMULA Sudoku-PT-AN04-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:52:14] [INFO ] Invariant cache hit.
[2023-03-18 20:52:14] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 20:52:14] [INFO ] Invariant cache hit.
[2023-03-18 20:52:14] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-18 20:52:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:52:14] [INFO ] Invariant cache hit.
[2023-03-18 20:52:14] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 128 ms :[p0]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s17 1) (GEQ s37 1)) (AND (GEQ s10 1) (GEQ s26 1) (GEQ s42 1)) (AND (GEQ s12 1) (GEQ s31 1) (GEQ s44 1)) (AND (GEQ s9 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6947 reset in 528 ms.
Product exploration explored 100000 steps with 6951 reset in 473 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-00 finished in 1494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(p0)))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:52:15] [INFO ] Invariant cache hit.
[2023-03-18 20:52:15] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 20:52:15] [INFO ] Invariant cache hit.
[2023-03-18 20:52:15] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-18 20:52:15] [INFO ] Invariant cache hit.
[2023-03-18 20:52:15] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s17 1) (GEQ s37 1)) (AND (GEQ s10 1) (GEQ s26 1) (GEQ s42 1)) (AND (GEQ s12 1) (GEQ s31 1) (GEQ s44 1)) (AND (GEQ s9 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-02 finished in 189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:52:15] [INFO ] Invariant cache hit.
[2023-03-18 20:52:15] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 20:52:15] [INFO ] Invariant cache hit.
[2023-03-18 20:52:15] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-18 20:52:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:52:15] [INFO ] Invariant cache hit.
[2023-03-18 20:52:15] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-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 s1 1) (GEQ s17 1) (GEQ s37 1)) (AND (GEQ s10 1) (GEQ s26 1) (GEQ s42 1)) (AND (GEQ s12 1) (GEQ s31 1) (GEQ s44 1)) (AND (GEQ s9 1) (GEQ s...], 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 14 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-04 finished in 239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:52:15] [INFO ] Invariant cache hit.
[2023-03-18 20:52:15] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-18 20:52:15] [INFO ] Invariant cache hit.
[2023-03-18 20:52:16] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-18 20:52:16] [INFO ] Invariant cache hit.
[2023-03-18 20:52:16] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s17 1) (GEQ s37 1)) (AND (GEQ s10 1) (GEQ s26 1) (GEQ s42 1)) (AND (GEQ s12 1) (GEQ s31 1) (GEQ s44 1)) (AND (GEQ s9 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 460 ms.
Product exploration explored 100000 steps with 50000 reset in 463 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 136 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN04-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-05 finished in 1384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:52:17] [INFO ] Invariant cache hit.
[2023-03-18 20:52:17] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-18 20:52:17] [INFO ] Invariant cache hit.
[2023-03-18 20:52:17] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-18 20:52:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:52:17] [INFO ] Invariant cache hit.
[2023-03-18 20:52:17] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 36 ms :[false]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s17 1) (GEQ s37 1)) (AND (GEQ s10 1) (GEQ s26 1) (GEQ s42 1)) (AND (GEQ s12 1) (GEQ s31 1) (GEQ s44 1)) (AND (GEQ s9 1) (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6952 reset in 504 ms.
Product exploration explored 100000 steps with 6940 reset in 497 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN04-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-07 finished in 1311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 7 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:52:18] [INFO ] Invariant cache hit.
[2023-03-18 20:52:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-18 20:52:18] [INFO ] Invariant cache hit.
[2023-03-18 20:52:18] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-18 20:52:18] [INFO ] Invariant cache hit.
[2023-03-18 20:52:18] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (AND (GEQ s10 1) (GEQ s27 1) (GEQ s46 1)) (AND (GEQ s11 1) (GEQ s27 1) (GEQ s47 1))), p0:(AND (GEQ s11 1) (GEQ s24 1) (GEQ s35 1))], 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, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 50 steps with 12 reset in 1 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-09 finished in 365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:52:18] [INFO ] Invariant cache hit.
[2023-03-18 20:52:19] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 20:52:19] [INFO ] Invariant cache hit.
[2023-03-18 20:52:19] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-18 20:52:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:52:19] [INFO ] Invariant cache hit.
[2023-03-18 20:52:19] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s8 1) (LT s27 1) (LT s44 1)), p0:(AND (GEQ s5 1) (GEQ s20 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-10 finished in 380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&X(X(!p0)))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:52:19] [INFO ] Invariant cache hit.
[2023-03-18 20:52:19] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-18 20:52:19] [INFO ] Invariant cache hit.
[2023-03-18 20:52:19] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-18 20:52:19] [INFO ] Invariant cache hit.
[2023-03-18 20:52:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 218 ms :[p0, p0, p0, p0]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 2}, { cond=p0, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s2 1) (GEQ s18 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12723 reset in 509 ms.
Product exploration explored 100000 steps with 12799 reset in 520 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN04-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-11 finished in 1572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:52:20] [INFO ] Invariant cache hit.
[2023-03-18 20:52:20] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-18 20:52:20] [INFO ] Invariant cache hit.
[2023-03-18 20:52:21] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-18 20:52:21] [INFO ] Invariant cache hit.
[2023-03-18 20:52:21] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s6 1) (GEQ s23 1) (GEQ s46 1))], 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, null][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 1 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-12 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(!(X(!X((F(p0)||p1))) U !p1))))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:52:21] [INFO ] Invariant cache hit.
[2023-03-18 20:52:21] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-18 20:52:21] [INFO ] Invariant cache hit.
[2023-03-18 20:52:21] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-18 20:52:21] [INFO ] Invariant cache hit.
[2023-03-18 20:52:21] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 4}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s10 1) (GEQ s25 1) (GEQ s38 1)), p0:(AND (GEQ s1 1) (GEQ s16 1) (GEQ s33 1))], 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 46 steps with 11 reset in 1 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-13 finished in 411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((F(p1)||p0))||G(p2))))'
Support contains 8 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:52:21] [INFO ] Invariant cache hit.
[2023-03-18 20:52:21] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-18 20:52:21] [INFO ] Invariant cache hit.
[2023-03-18 20:52:21] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-18 20:52:21] [INFO ] Invariant cache hit.
[2023-03-18 20:52:21] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (LT s3 1) (LT s19 1) (LT s47 1)), p0:(OR (LT s2 1) (LT s19 1) (LT s46 1)), p1:(OR (LT s15 1) (LT s29 1) (LT s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 25633 reset in 571 ms.
Product exploration explored 100000 steps with 25753 reset in 588 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (F (G p2)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 4 factoid took 263 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-14 finished in 1718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 8 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:52:23] [INFO ] Invariant cache hit.
[2023-03-18 20:52:23] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-18 20:52:23] [INFO ] Invariant cache hit.
[2023-03-18 20:52:23] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-18 20:52:23] [INFO ] Invariant cache hit.
[2023-03-18 20:52:23] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s5 1) (GEQ s20 1) (GEQ s33 1)), p0:(OR (AND (GEQ s4 1) (GEQ s23 1) (GEQ s44 1)) (AND (GEQ s5 1) (GEQ s22 1) (GEQ s41 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 26 steps with 10 reset in 1 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-15 finished in 310 ms.
All properties solved by simple procedures.
Total runtime 11239 ms.
ITS solved all properties within timeout

BK_STOP 1679172744942

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is Sudoku-PT-AN04, 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 r487-tall-167912702700188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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