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-167912702900284.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-AN16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702900284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 107M
-rw-r--r-- 1 mcc users 1.8M Feb 26 10:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 8.0M Feb 26 10:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7M Feb 26 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 22M Feb 26 09:06 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 1014K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 3.1M Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.5M Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4M Feb 26 11:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15M Feb 26 11:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9M Feb 26 10:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32M Feb 26 10:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 142K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 343K Feb 25 17:17 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 2.3M 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-AN16-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679181260395

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-AN16
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 23:14:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:14:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:14:22] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2023-03-18 23:14:22] [INFO ] Transformed 4864 places.
[2023-03-18 23:14:22] [INFO ] Transformed 4096 transitions.
[2023-03-18 23:14:22] [INFO ] Parsed PT model containing 4864 places and 4096 transitions and 16384 arcs in 474 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 165 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN16-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 768 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 768 transition count 4096
Applied a total of 4096 rules in 90 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2023-03-18 23:14:29] [INFO ] Computed 47 place invariants in 488 ms
[2023-03-18 23:14:29] [INFO ] Implicit Places using invariants in 972 ms returned []
[2023-03-18 23:14:29] [INFO ] Invariant cache hit.
[2023-03-18 23:14:31] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 2417 ms to find 0 implicit places.
[2023-03-18 23:14:31] [INFO ] Invariant cache hit.
[2023-03-18 23:14:32] [INFO ] Dead Transitions using invariants and state equation in 1292 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3806 ms. Remains : 768/4864 places, 4096/4096 transitions.
Support contains 768 out of 768 places after structural reductions.
[2023-03-18 23:14:33] [INFO ] Flatten gal took : 585 ms
[2023-03-18 23:14:36] [INFO ] Flatten gal took : 570 ms
[2023-03-18 23:14:39] [INFO ] Input system was already deterministic with 4096 transitions.
Finished random walk after 224 steps, including 0 resets, run visited all 18 properties in 283 ms. (steps per millisecond=0 )
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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(G(p0)))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 33 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 23:14:47] [INFO ] Invariant cache hit.
[2023-03-18 23:14:47] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-18 23:14:47] [INFO ] Invariant cache hit.
[2023-03-18 23:14:48] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
[2023-03-18 23:14:48] [INFO ] Redundant transitions in 324 ms returned []
[2023-03-18 23:14:48] [INFO ] Invariant cache hit.
[2023-03-18 23:14:50] [INFO ] Dead Transitions using invariants and state equation in 1379 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2879 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s208 1) (GEQ s469 1) (GEQ s592 1)) (AND (GEQ s177 1) (GEQ s446 1) (GEQ s737 1)) (AND (GEQ s100 1) (GEQ s362 1) (GEQ s676 1)) (AND (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 223 steps with 0 reset in 159 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-01 finished in 3365 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&&F(G(p0)))))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 25 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 23:14:50] [INFO ] Invariant cache hit.
[2023-03-18 23:14:50] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-18 23:14:50] [INFO ] Invariant cache hit.
[2023-03-18 23:14:51] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
[2023-03-18 23:14:51] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-18 23:14:51] [INFO ] Invariant cache hit.
[2023-03-18 23:14:53] [INFO ] Dead Transitions using invariants and state equation in 1306 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2596 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s208 1) (GEQ s469 1) (GEQ s592 1)) (AND (GEQ s177 1) (GEQ s446 1) (GEQ s737 1)) (AND (GEQ s100 1) (GEQ s362 1) (GEQ s676 1)) (AND (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 221 steps with 0 reset in 72 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-02 finished in 3442 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(F((G(p0)||(p0&&F(!p0))))))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 6 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 23:14:53] [INFO ] Invariant cache hit.
[2023-03-18 23:14:54] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-18 23:14:54] [INFO ] Invariant cache hit.
[2023-03-18 23:14:55] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
[2023-03-18 23:14:55] [INFO ] Invariant cache hit.
[2023-03-18 23:14:56] [INFO ] Dead Transitions using invariants and state equation in 1364 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2474 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-03 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 s208 1) (GEQ s469 1) (GEQ s592 1)) (AND (GEQ s177 1) (GEQ s446 1) (GEQ s737 1)) (AND (GEQ s100 1) (GEQ s362 1) (GEQ s676 1)) (AND (GEQ s1...], 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 timeout after 25710 steps with 12855 reset in 10003 ms.
Product exploration timeout after 25610 steps with 12805 reset in 10004 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 60 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-PT-AN16-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN16-LTLFireability-03 finished in 27611 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(G(!p0))))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 6 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 23:15:21] [INFO ] Invariant cache hit.
[2023-03-18 23:15:21] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-18 23:15:21] [INFO ] Invariant cache hit.
[2023-03-18 23:15:22] [INFO ] Implicit Places using invariants and state equation in 1055 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
[2023-03-18 23:15:22] [INFO ] Invariant cache hit.
[2023-03-18 23:15:23] [INFO ] Dead Transitions using invariants and state equation in 1256 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2464 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, p0, p0, p0]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT 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 s208 1) (GEQ s469 1) (GEQ s592 1)) (AND (GEQ s177 1) (GEQ s446 1) (GEQ s737 1)) (AND (GEQ s100 1) (GEQ s362 1) (GEQ s676 1)) (AND (GEQ s1...], 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 2 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-05 finished in 2630 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||G(p0))))'
Support contains 0 out of 768 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 20 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 23:15:24] [INFO ] Invariant cache hit.
[2023-03-18 23:15:24] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-18 23:15:24] [INFO ] Invariant cache hit.
[2023-03-18 23:15:25] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
[2023-03-18 23:15:25] [INFO ] Redundant transitions in 229 ms returned []
[2023-03-18 23:15:25] [INFO ] Invariant cache hit.
[2023-03-18 23:15:27] [INFO ] Dead Transitions using invariants and state equation in 1747 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3145 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 13 ms :[false]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-07 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-07 TRUE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-07 finished in 3889 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(p0)))'
Support contains 3 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 185 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 23:15:28] [INFO ] Invariant cache hit.
[2023-03-18 23:15:29] [INFO ] Implicit Places using invariants in 857 ms returned []
[2023-03-18 23:15:29] [INFO ] Invariant cache hit.
[2023-03-18 23:15:34] [INFO ] Implicit Places using invariants and state equation in 5845 ms returned []
Implicit Place search using SMT with State Equation took 6711 ms to find 0 implicit places.
[2023-03-18 23:15:34] [INFO ] Invariant cache hit.
[2023-03-18 23:15:36] [INFO ] Dead Transitions using invariants and state equation in 1294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8209 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s185 1) (LT s432 1) (LT s521 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-08 finished in 8300 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' '!(((p0 U p1)&&X((F(p2) U p3))))'
Support contains 12 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 146 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 23:15:36] [INFO ] Invariant cache hit.
[2023-03-18 23:15:37] [INFO ] Implicit Places using invariants in 793 ms returned []
[2023-03-18 23:15:37] [INFO ] Invariant cache hit.
[2023-03-18 23:15:42] [INFO ] Implicit Places using invariants and state equation in 5218 ms returned []
Implicit Place search using SMT with State Equation took 6024 ms to find 0 implicit places.
[2023-03-18 23:15:42] [INFO ] Invariant cache hit.
[2023-03-18 23:15:43] [INFO ] Dead Transitions using invariants and state equation in 1329 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7517 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p3)), true, (NOT p1), (NOT p3), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s221 1) (GEQ s473 1) (GEQ s669 1) (GEQ s171 1) (GEQ s422 1) (GEQ s619 1)), p0:(AND (GEQ s171 1) (GEQ s422 1) (GEQ s619 1)), p3:(OR (AND (GEQ ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 25710 steps with 12855 reset in 10003 ms.
Product exploration timeout after 25610 steps with 12805 reset in 10002 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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 p3 p2), (X (NOT (AND (NOT p3) (NOT p2)))), (X p3), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
Property proved to be true thanks to knowledge :(X p3)
Knowledge based reduction with 7 factoid took 178 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN16-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN16-LTLFireability-09 finished in 28672 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((G(p0) U p1))))'
Support contains 6 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 112 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 23:16:05] [INFO ] Invariant cache hit.
[2023-03-18 23:16:05] [INFO ] Implicit Places using invariants in 780 ms returned []
[2023-03-18 23:16:05] [INFO ] Invariant cache hit.
[2023-03-18 23:16:11] [INFO ] Implicit Places using invariants and state equation in 5165 ms returned []
Implicit Place search using SMT with State Equation took 5974 ms to find 0 implicit places.
[2023-03-18 23:16:11] [INFO ] Invariant cache hit.
[2023-03-18 23:16:12] [INFO ] Dead Transitions using invariants and state equation in 1333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7444 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s15 1) (GEQ s266 1) (GEQ s687 1)), p0:(AND (GEQ s49 1) (GEQ s311 1) (GEQ s625 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 28 steps with 7 reset in 17 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-11 finished in 7612 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)||(!p1 U (p2||G(!p1))))) U (!p1||G(!p0))))'
Support contains 6 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 266 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 23:16:12] [INFO ] Invariant cache hit.
[2023-03-18 23:16:13] [INFO ] Implicit Places using invariants in 807 ms returned []
[2023-03-18 23:16:13] [INFO ] Invariant cache hit.
[2023-03-18 23:16:19] [INFO ] Implicit Places using invariants and state equation in 6133 ms returned []
Implicit Place search using SMT with State Equation took 6952 ms to find 0 implicit places.
[2023-03-18 23:16:20] [INFO ] Redundant transitions in 229 ms returned []
[2023-03-18 23:16:20] [INFO ] Invariant cache hit.
[2023-03-18 23:16:21] [INFO ] Dead Transitions using invariants and state equation in 1291 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8782 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND p0 p1), (AND p1 p0 (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s177 1) (GEQ s433 1) (GEQ s529 1)), p0:(AND (GEQ s89 1) (GEQ s348 1) (GEQ s713 1)), p2:(AND (NOT (AND (GEQ s89 1) (GEQ s348 1) (GEQ s713 1)))...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 24150 steps with 245 reset in 10004 ms.
Product exploration timeout after 23440 steps with 246 reset in 10002 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 5 factoid took 322 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN16-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN16-LTLFireability-12 finished in 29901 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 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 122 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 23:16:42] [INFO ] Invariant cache hit.
[2023-03-18 23:16:43] [INFO ] Implicit Places using invariants in 808 ms returned []
[2023-03-18 23:16:43] [INFO ] Invariant cache hit.
[2023-03-18 23:16:48] [INFO ] Implicit Places using invariants and state equation in 4669 ms returned []
Implicit Place search using SMT with State Equation took 5503 ms to find 0 implicit places.
[2023-03-18 23:16:48] [INFO ] Invariant cache hit.
[2023-03-18 23:16:49] [INFO ] Dead Transitions using invariants and state equation in 1322 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6975 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-13 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:(OR (LT s186 1) (LT s443 1) (LT s698 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]]
Product exploration timeout after 21180 steps with 325 reset in 10002 ms.
Product exploration timeout after 21520 steps with 316 reset in 10003 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN16-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN16-LTLFireability-13 finished in 27840 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(p0)&&F(p1)))'
Support contains 6 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 116 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 23:17:10] [INFO ] Invariant cache hit.
[2023-03-18 23:17:11] [INFO ] Implicit Places using invariants in 773 ms returned []
[2023-03-18 23:17:11] [INFO ] Invariant cache hit.
[2023-03-18 23:17:16] [INFO ] Implicit Places using invariants and state equation in 5065 ms returned []
Implicit Place search using SMT with State Equation took 5872 ms to find 0 implicit places.
[2023-03-18 23:17:16] [INFO ] Invariant cache hit.
[2023-03-18 23:17:17] [INFO ] Dead Transitions using invariants and state equation in 1309 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7321 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s77 1) (GEQ s321 1) (GEQ s541 1)), p0:(AND (GEQ s91 1) (GEQ s336 1) (GEQ s523 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 11 reset in 16 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-14 finished in 7459 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)&&(G(p1)||(X(G(p2))&&F(p3)))))'
Support contains 12 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 121 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 23:17:17] [INFO ] Invariant cache hit.
[2023-03-18 23:17:18] [INFO ] Implicit Places using invariants in 709 ms returned []
[2023-03-18 23:17:18] [INFO ] Invariant cache hit.
[2023-03-18 23:17:23] [INFO ] Implicit Places using invariants and state equation in 5222 ms returned []
Implicit Place search using SMT with State Equation took 5959 ms to find 0 implicit places.
[2023-03-18 23:17:23] [INFO ] Invariant cache hit.
[2023-03-18 23:17:25] [INFO ] Dead Transitions using invariants and state equation in 1246 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7343 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s238 1) (GEQ s485 1) (GEQ s606 1)), p1:(AND (GEQ s202 1) (GEQ s449 1) (GEQ s538 1)), p3:(OR (LT s45 1) (LT s290 1) (LT s557 1)), p2:(OR (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 200 steps with 3 reset in 120 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-15 finished in 7735 ms.
All properties solved by simple procedures.
Total runtime 183464 ms.
ITS solved all properties within timeout

BK_STOP 1679181446801

--------------------
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-AN16"
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-AN16, 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-167912702900284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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