fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r536-tall-171690532900676
Last Updated
July 7, 2024

About the Execution of LTSMin+red for Sudoku-PT-AN14

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12503.331 1202290.00 1351670.00 2404.60 TFFFTTTTTFFFFTFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 1.2M Apr 12 12:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Apr 12 12:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1M Apr 12 10:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 15M Apr 12 10:17 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 702K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.2M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.2M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5M Apr 12 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.0M Apr 12 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6M Apr 12 12:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22M Apr 12 12:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 98K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 237K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M 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-PT-AN14-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717275215452

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:53:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:53:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:53:36] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2024-06-01 20:53:36] [INFO ] Transformed 3332 places.
[2024-06-01 20:53:36] [INFO ] Transformed 2744 transitions.
[2024-06-01 20:53:36] [INFO ] Found NUPN structural information;
[2024-06-01 20:53:36] [INFO ] Parsed PT model containing 3332 places and 2744 transitions and 10976 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 197 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN14-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 588 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 67 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2024-06-01 20:53:40] [INFO ] Computed 41 invariants in 256 ms
[2024-06-01 20:53:40] [INFO ] Implicit Places using invariants in 873 ms returned []
[2024-06-01 20:53:40] [INFO ] Invariant cache hit.
[2024-06-01 20:53:42] [INFO ] Implicit Places using invariants and state equation in 2109 ms returned []
Implicit Place search using SMT with State Equation took 3020 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 3ms
Starting structural reductions in LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3119 ms. Remains : 588/3332 places, 2744/2744 transitions.
Support contains 588 out of 588 places after structural reductions.
[2024-06-01 20:53:44] [INFO ] Flatten gal took : 557 ms
[2024-06-01 20:53:47] [INFO ] Flatten gal took : 510 ms
[2024-06-01 20:53:50] [INFO ] Input system was already deterministic with 2744 transitions.
Reduction of identical properties reduced properties to check from 25 to 22
RANDOM walk for 40000 steps (230 resets) in 9209 ms. (4 steps per ms) remains 1/22 properties
BEST_FIRST walk for 18984 steps (0 resets) in 24811 ms. (0 steps per ms) remains 1/1 properties
[2024-06-01 20:53:59] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/3332 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1180 ms.
Refiners :[Domain max(s): 588/588 constraints, Generalized P Invariants (flows): 0/41 constraints, State Equation: 0/588 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/3332 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1157 ms.
Refiners :[Domain max(s): 588/588 constraints, Generalized P Invariants (flows): 0/41 constraints, State Equation: 0/588 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11140ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 26 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 588/588 places, 2744/2744 transitions.
RANDOM walk for 40000 steps (228 resets) in 8296 ms. (4 steps per ms) remains 1/1 properties
BEST_FIRST walk for 18984 steps (0 resets) in 24096 ms. (0 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1220927 steps, run timeout after 24001 ms. (steps per millisecond=50 ) properties seen :0 out of 1
Probabilistic random walk after 1220927 steps, saw 465643 distinct states, run finished after 24007 ms. (steps per millisecond=50 ) properties seen :0
[2024-06-01 20:54:43] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 588/3332 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 2168 ms.
Refiners :[Domain max(s): 0/588 constraints, Generalized P Invariants (flows): 0/41 constraints, State Equation: 0/588 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11204ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Sudoku-PT-AN14-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 6 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 20:54:55] [INFO ] Invariant cache hit.
[2024-06-01 20:54:55] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-01 20:54:55] [INFO ] Invariant cache hit.
[2024-06-01 20:54:57] [INFO ] Implicit Places using invariants and state equation in 2120 ms returned []
Implicit Place search using SMT with State Equation took 2298 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 2306 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-00
Product exploration timeout after 35640 steps with 17820 reset in 10003 ms.
Product exploration timeout after 35800 steps with 17900 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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 (Minato strategy)
Knowledge based reduction with 3 factoid took 29 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-AN14-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-00 finished in 25246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U X((p1&&F(!p1))))||p0))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 5 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 20:55:20] [INFO ] Invariant cache hit.
[2024-06-01 20:55:21] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-01 20:55:21] [INFO ] Invariant cache hit.
[2024-06-01 20:55:23] [INFO ] Implicit Places using invariants and state equation in 2125 ms returned []
Implicit Place search using SMT with State Equation took 2275 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 2281 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-03
Stuttering criterion allowed to conclude after 169 steps with 0 reset in 39 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-03 finished in 2586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 22 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 20:55:23] [INFO ] Invariant cache hit.
[2024-06-01 20:55:23] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 20:55:23] [INFO ] Invariant cache hit.
[2024-06-01 20:55:25] [INFO ] Implicit Places using invariants and state equation in 2035 ms returned []
Implicit Place search using SMT with State Equation took 2181 ms to find 0 implicit places.
[2024-06-01 20:55:25] [INFO ] Redundant transitions in 150 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2366 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-04
Product exploration timeout after 56730 steps with 329 reset in 10001 ms.
Product exploration timeout after 57840 steps with 335 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 96 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-AN14-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-04 finished in 23119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 19 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 20:55:46] [INFO ] Invariant cache hit.
[2024-06-01 20:55:46] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 20:55:46] [INFO ] Invariant cache hit.
[2024-06-01 20:55:48] [INFO ] Implicit Places using invariants and state equation in 2017 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2024-06-01 20:55:48] [INFO ] Redundant transitions in 103 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2301 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 60 ms :[p0]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-05
Product exploration timeout after 56930 steps with 330 reset in 10002 ms.
Product exploration timeout after 55770 steps with 323 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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 (Minato strategy)
Knowledge based reduction with 3 factoid took 21 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-AN14-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-05 finished in 24932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 15 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 20:56:11] [INFO ] Invariant cache hit.
[2024-06-01 20:56:11] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-01 20:56:11] [INFO ] Invariant cache hit.
[2024-06-01 20:56:13] [INFO ] Implicit Places using invariants and state equation in 2060 ms returned []
Implicit Place search using SMT with State Equation took 2206 ms to find 0 implicit places.
[2024-06-01 20:56:13] [INFO ] Redundant transitions in 78 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2312 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-06
Product exploration timeout after 48020 steps with 278 reset in 10001 ms.
Product exploration timeout after 49220 steps with 285 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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 p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 29 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN14-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-06 finished in 25083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 132 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 20:56:36] [INFO ] Invariant cache hit.
[2024-06-01 20:56:40] [INFO ] Implicit Places using invariants in 3741 ms returned []
[2024-06-01 20:56:40] [INFO ] Invariant cache hit.
[2024-06-01 20:57:14] [INFO ] Performed 1/588 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 20:57:52] [INFO ] Performed 10/588 implicitness test of which 0 returned IMPLICIT in 69 seconds.
[2024-06-01 20:58:25] [INFO ] Performed 15/588 implicitness test of which 0 returned IMPLICIT in 102 seconds.
[2024-06-01 20:58:57] [INFO ] Performed 17/588 implicitness test of which 0 returned IMPLICIT in 135 seconds.
[2024-06-01 20:58:57] [INFO ] Timeout of Implicit test with SMT after 135 seconds.
[2024-06-01 20:58:57] [INFO ] Implicit Places using invariants and state equation in 137042 ms returned []
Implicit Place search using SMT with State Equation took 140813 ms to find 0 implicit places.
[2024-06-01 20:58:57] [INFO ] Redundant transitions in 138 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 141106 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-08
Product exploration timeout after 59300 steps with 343 reset in 10001 ms.
Product exploration timeout after 58610 steps with 340 reset in 10003 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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 : [(X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 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-AN14-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-08 finished in 161709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(((X(p2)&&p1) U p2)))))'
Support contains 6 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 92 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 20:59:18] [INFO ] Invariant cache hit.
[2024-06-01 20:59:22] [INFO ] Implicit Places using invariants in 3910 ms returned []
[2024-06-01 20:59:22] [INFO ] Invariant cache hit.
[2024-06-01 21:00:04] [INFO ] Performed 4/588 implicitness test of which 0 returned IMPLICIT in 40 seconds.
[2024-06-01 21:00:38] [INFO ] Performed 15/588 implicitness test of which 0 returned IMPLICIT in 74 seconds.
[2024-06-01 21:01:10] [INFO ] Performed 17/588 implicitness test of which 0 returned IMPLICIT in 106 seconds.
[2024-06-01 21:01:45] [INFO ] Performed 22/588 implicitness test of which 0 returned IMPLICIT in 141 seconds.
[2024-06-01 21:01:45] [INFO ] Timeout of Implicit test with SMT after 141 seconds.
[2024-06-01 21:01:45] [INFO ] Implicit Places using invariants and state equation in 143328 ms returned []
Implicit Place search using SMT with State Equation took 147241 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 147335 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) p1), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-09
Entered a terminal (fully accepting) state of product in 149 steps with 6 reset in 35 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-09 finished in 147656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1 U p2))))))'
Support contains 9 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 78 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 21:01:46] [INFO ] Invariant cache hit.
[2024-06-01 21:01:49] [INFO ] Implicit Places using invariants in 3514 ms returned []
[2024-06-01 21:01:49] [INFO ] Invariant cache hit.
[2024-06-01 21:02:29] [INFO ] Performed 3/588 implicitness test of which 0 returned IMPLICIT in 38 seconds.
[2024-06-01 21:03:02] [INFO ] Performed 5/588 implicitness test of which 0 returned IMPLICIT in 70 seconds.
[2024-06-01 21:03:16] [INFO ] Implicit Places using invariants and state equation in 86641 ms returned []
Implicit Place search using SMT with State Equation took 90171 ms to find 0 implicit places.
[2024-06-01 21:03:16] [INFO ] Redundant transitions in 68 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 90327 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-10
Stuttering criterion allowed to conclude after 171 steps with 0 reset in 32 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-10 finished in 90484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)&&F(p2)))))'
Support contains 12 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 119 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 21:03:16] [INFO ] Invariant cache hit.
[2024-06-01 21:03:20] [INFO ] Implicit Places using invariants in 3665 ms returned []
[2024-06-01 21:03:20] [INFO ] Invariant cache hit.
[2024-06-01 21:04:00] [INFO ] Performed 3/588 implicitness test of which 0 returned IMPLICIT in 38 seconds.
[2024-06-01 21:04:32] [INFO ] Performed 5/588 implicitness test of which 0 returned IMPLICIT in 70 seconds.
[2024-06-01 21:05:04] [INFO ] Performed 7/588 implicitness test of which 0 returned IMPLICIT in 102 seconds.
[2024-06-01 21:05:39] [INFO ] Performed 14/588 implicitness test of which 0 returned IMPLICIT in 137 seconds.
[2024-06-01 21:05:39] [INFO ] Timeout of Implicit test with SMT after 137 seconds.
[2024-06-01 21:05:39] [INFO ] Implicit Places using invariants and state equation in 139084 ms returned []
Implicit Place search using SMT with State Equation took 142770 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 142905 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-11 finished in 143122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Support contains 6 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 60 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 21:05:39] [INFO ] Invariant cache hit.
[2024-06-01 21:05:43] [INFO ] Implicit Places using invariants in 3652 ms returned []
[2024-06-01 21:05:43] [INFO ] Invariant cache hit.
[2024-06-01 21:06:17] [INFO ] Performed 1/588 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 21:06:49] [INFO ] Performed 3/588 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 21:07:19] [INFO ] Performed 278/588 implicitness test of which 0 returned IMPLICIT in 94 seconds.
[2024-06-01 21:07:26] [INFO ] Implicit Places using invariants and state equation in 103371 ms returned []
Implicit Place search using SMT with State Equation took 107034 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 8ms
Finished structural reductions in LTL mode , in 1 iterations and 107118 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-12
Stuttering criterion allowed to conclude after 16451 steps with 8074 reset in 4572 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-12 finished in 111811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&G(p1))))'
Support contains 6 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 65 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 21:07:31] [INFO ] Invariant cache hit.
[2024-06-01 21:07:35] [INFO ] Implicit Places using invariants in 3726 ms returned []
[2024-06-01 21:07:35] [INFO ] Invariant cache hit.
[2024-06-01 21:08:09] [INFO ] Performed 1/588 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 21:08:41] [INFO ] Performed 3/588 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 21:09:13] [INFO ] Performed 5/588 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 21:09:48] [INFO ] Performed 14/588 implicitness test of which 0 returned IMPLICIT in 130 seconds.
[2024-06-01 21:09:48] [INFO ] Timeout of Implicit test with SMT after 130 seconds.
[2024-06-01 21:09:48] [INFO ] Implicit Places using invariants and state equation in 133189 ms returned []
Implicit Place search using SMT with State Equation took 136921 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 136987 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-13
Product exploration timeout after 45620 steps with 362 reset in 10001 ms.
Product exploration timeout after 44660 steps with 370 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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 p1) (NOT p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0)]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN14-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-13 finished in 157702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 6 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 66 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 21:10:09] [INFO ] Invariant cache hit.
[2024-06-01 21:10:13] [INFO ] Implicit Places using invariants in 3894 ms returned []
[2024-06-01 21:10:13] [INFO ] Invariant cache hit.
[2024-06-01 21:10:47] [INFO ] Performed 1/588 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 21:11:17] [INFO ] Performed 307/588 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-06-01 21:11:22] [INFO ] Implicit Places using invariants and state equation in 69282 ms returned []
Implicit Place search using SMT with State Equation took 73192 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 73259 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-14 finished in 73401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1||G(p2)||X(G(p3))))))'
Support contains 12 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 63 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 21:11:22] [INFO ] Invariant cache hit.
[2024-06-01 21:11:26] [INFO ] Implicit Places using invariants in 3735 ms returned []
[2024-06-01 21:11:26] [INFO ] Invariant cache hit.
[2024-06-01 21:12:00] [INFO ] Performed 1/588 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 21:12:32] [INFO ] Performed 3/588 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 21:13:04] [INFO ] Performed 5/588 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 21:13:37] [INFO ] Performed 7/588 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2024-06-01 21:13:37] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2024-06-01 21:13:37] [INFO ] Implicit Places using invariants and state equation in 130794 ms returned []
Implicit Place search using SMT with State Equation took 134547 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 134611 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2)), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-15 finished in 134870 ms.
All properties solved by simple procedures.
Total runtime 1200724 ms.
ITS solved all properties within timeout

BK_STOP 1717276417742

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-AN14"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-PT-AN14, 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 r536-tall-171690532900676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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