About the Execution of GreatSPN+red for NQueens-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 537.500 | 24619.00 | 34721.00 | 276.10 | FFFFFTFFTTFFTFFF | 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.r245-tall-171654349700340.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 greatspnxred
Input is NQueens-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349700340
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 12 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 03:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 30K 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 NQueens-PT-05-LTLFireability-00
FORMULA_NAME NQueens-PT-05-LTLFireability-01
FORMULA_NAME NQueens-PT-05-LTLFireability-02
FORMULA_NAME NQueens-PT-05-LTLFireability-03
FORMULA_NAME NQueens-PT-05-LTLFireability-04
FORMULA_NAME NQueens-PT-05-LTLFireability-05
FORMULA_NAME NQueens-PT-05-LTLFireability-06
FORMULA_NAME NQueens-PT-05-LTLFireability-07
FORMULA_NAME NQueens-PT-05-LTLFireability-08
FORMULA_NAME NQueens-PT-05-LTLFireability-09
FORMULA_NAME NQueens-PT-05-LTLFireability-10
FORMULA_NAME NQueens-PT-05-LTLFireability-11
FORMULA_NAME NQueens-PT-05-LTLFireability-12
FORMULA_NAME NQueens-PT-05-LTLFireability-13
FORMULA_NAME NQueens-PT-05-LTLFireability-14
FORMULA_NAME NQueens-PT-05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716655901005
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NQueens-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:51:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 16:51:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:51:42] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2024-05-25 16:51:42] [INFO ] Transformed 55 places.
[2024-05-25 16:51:42] [INFO ] Transformed 25 transitions.
[2024-05-25 16:51:42] [INFO ] Found NUPN structural information;
[2024-05-25 16:51:42] [INFO ] Parsed PT model containing 55 places and 25 transitions and 125 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-05-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 25/25 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 28 transition count 25
Applied a total of 25 rules in 14 ms. Remains 28 /53 variables (removed 25) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 28 cols
[2024-05-25 16:51:42] [INFO ] Computed 7 invariants in 6 ms
[2024-05-25 16:51:42] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-25 16:51:42] [INFO ] Invariant cache hit.
[2024-05-25 16:51:42] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 253 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/53 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 284 ms. Remains : 27/53 places, 25/25 transitions.
Support contains 27 out of 27 places after structural reductions.
[2024-05-25 16:51:42] [INFO ] Flatten gal took : 18 ms
[2024-05-25 16:51:43] [INFO ] Flatten gal took : 7 ms
[2024-05-25 16:51:43] [INFO ] Input system was already deterministic with 25 transitions.
Reduction of identical properties reduced properties to check from 29 to 21
RANDOM walk for 17 steps (0 resets) in 7 ms. (2 steps per ms) remains 0/21 properties
Computed a total of 27 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 25
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' '!(F(G(((G((X(p2)&&p1))&&p0) U X(p3)))))'
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2024-05-25 16:51:43] [INFO ] Computed 6 invariants in 5 ms
[2024-05-25 16:51:43] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-25 16:51:43] [INFO ] Invariant cache hit.
[2024-05-25 16:51:43] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 119 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 454 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3) (NOT p2)) (AND (NOT p1) p2 (NOT p3))), (AND p2 (NOT p3)), false, false]
Running random walk in product with property : NQueens-PT-05-LTLFireability-00
Stuttering criterion allowed to conclude after 34 steps with 14 reset in 4 ms.
FORMULA NQueens-PT-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-00 finished in 649 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||F(p1)))))'
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:44] [INFO ] Invariant cache hit.
[2024-05-25 16:51:44] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-25 16:51:44] [INFO ] Invariant cache hit.
[2024-05-25 16:51:44] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 137 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-01
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-01 finished in 279 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((p0 U p1)))'
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:44] [INFO ] Invariant cache hit.
[2024-05-25 16:51:44] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-25 16:51:44] [INFO ] Invariant cache hit.
[2024-05-25 16:51:44] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 129 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-02 finished in 338 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))&&F(p1)))'
Support contains 8 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:44] [INFO ] Invariant cache hit.
[2024-05-25 16:51:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-25 16:51:44] [INFO ] Invariant cache hit.
[2024-05-25 16:51:44] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 125 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 128 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-03
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-03 finished in 291 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(((F(p1) U G(!p2))&&p0))))'
Support contains 11 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:45] [INFO ] Invariant cache hit.
[2024-05-25 16:51:45] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-25 16:51:45] [INFO ] Invariant cache hit.
[2024-05-25 16:51:45] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 122 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 123 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) p2), (AND (NOT p1) p2), p2, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-04
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-04 finished in 300 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 U X((((p0 U !p1) U p2) U G(!p0))))))'
Support contains 10 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:45] [INFO ] Invariant cache hit.
[2024-05-25 16:51:45] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-25 16:51:45] [INFO ] Invariant cache hit.
[2024-05-25 16:51:45] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 112 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 249 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Running random walk in product with property : NQueens-PT-05-LTLFireability-05
Product exploration explored 100000 steps with 18755 reset in 455 ms.
Product exploration explored 100000 steps with 18763 reset in 306 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
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 p0 p2 p1), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 652 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
RANDOM walk for 365 steps (68 resets) in 18 ms. (19 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 p2 p1), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (OR (NOT p0) p2) (OR p2 p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 956 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Stuttering acceptance computed with spot in 250 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
// Phase 1: matrix 25 rows 24 cols
[2024-05-25 16:51:48] [INFO ] Computed 3 invariants in 2 ms
[2024-05-25 16:51:48] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 16:51:48] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 16:51:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:51:49] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 16:51:49] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-25 16:51:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:51:49] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG p0
Support contains 10 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:49] [INFO ] Invariant cache hit.
[2024-05-25 16:51:49] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-25 16:51:49] [INFO ] Invariant cache hit.
[2024-05-25 16:51:49] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 24/24 places, 25/25 transitions.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
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 p0 p2 p1), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 719 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
RANDOM walk for 218 steps (41 resets) in 13 ms. (15 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 p2 p1), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (OR (NOT p0) p2) (OR p2 p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 908 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Stuttering acceptance computed with spot in 254 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
[2024-05-25 16:51:51] [INFO ] Invariant cache hit.
[2024-05-25 16:51:51] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:51:51] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 16:51:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:51:51] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 16:51:51] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-25 16:51:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-25 16:51:51] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 235 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Product exploration explored 100000 steps with 18774 reset in 242 ms.
Product exploration explored 100000 steps with 18781 reset in 246 ms.
Applying partial POR strategy [false, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 257 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Support contains 10 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:53] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9 ms. Remains : 24/24 places, 25/25 transitions.
Support contains 10 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:53] [INFO ] Invariant cache hit.
[2024-05-25 16:51:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-25 16:51:53] [INFO ] Invariant cache hit.
[2024-05-25 16:51:53] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 90 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 91 ms. Remains : 24/24 places, 25/25 transitions.
Treatment of property NQueens-PT-05-LTLFireability-05 finished in 7820 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(p1)||p0)))'
Support contains 8 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2024-05-25 16:51:53] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 16:51:53] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-25 16:51:53] [INFO ] Invariant cache hit.
[2024-05-25 16:51:53] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [18, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 120 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 25/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-06
Entered a terminal (fully accepting) state of product in 29 steps with 11 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-06 finished in 239 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 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:53] [INFO ] Invariant cache hit.
[2024-05-25 16:51:53] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-25 16:51:53] [INFO ] Invariant cache hit.
[2024-05-25 16:51:53] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 124 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-08
Product exploration explored 100000 steps with 36156 reset in 277 ms.
Product exploration explored 100000 steps with 36011 reset in 305 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
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 (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-05-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-08 finished in 953 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)||G(p1)))'
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:54] [INFO ] Invariant cache hit.
[2024-05-25 16:51:54] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-25 16:51:54] [INFO ] Invariant cache hit.
[2024-05-25 16:51:54] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 125 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 127 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-09
Product exploration explored 100000 steps with 38093 reset in 246 ms.
Product exploration explored 100000 steps with 38156 reset in 256 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
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)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-05-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-09 finished in 764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||(p1&&G(p2)))))'
Support contains 9 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:55] [INFO ] Invariant cache hit.
[2024-05-25 16:51:55] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-25 16:51:55] [INFO ] Invariant cache hit.
[2024-05-25 16:51:55] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 98 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-10
Entered a terminal (fully accepting) state of product in 9 steps with 2 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-10 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:55] [INFO ] Invariant cache hit.
[2024-05-25 16:51:55] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-25 16:51:55] [INFO ] Invariant cache hit.
[2024-05-25 16:51:55] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [10, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 112 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 25/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-11
Stuttering criterion allowed to conclude after 10 steps with 3 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-11 finished in 188 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 U (p1||G(!p0))) U ((X(G(!p2))&&(!p0 U (p1||G(!p0))))||G((!p0 U (p1||G(!p0))))))&&p3))))'
Support contains 10 out of 27 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 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:55] [INFO ] Invariant cache hit.
[2024-05-25 16:51:55] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-25 16:51:55] [INFO ] Invariant cache hit.
[2024-05-25 16:51:55] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [10, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 93 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 25/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 40 ms :[(OR (NOT p3) (AND p0 (NOT p1)))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-12
Product exploration explored 100000 steps with 18779 reset in 237 ms.
Product exploration explored 100000 steps with 18791 reset in 251 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 25
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 p3) p0), (F (G p1)), (F (G p3)), (F (G (NOT p0)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (OR (AND (NOT p1) p0) (NOT p3))), (X (NOT (OR (AND (NOT p1) p0) (NOT p3)))), (X (OR (AND p1 p3) (AND (NOT p0) p3))), (X (NOT (OR (AND p1 p3) (AND (NOT p0) p3)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) p0) (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) p0) (NOT p3))))), (X (X (OR (AND p1 p3) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND p1 p3) (AND (NOT p0) p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-05-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-12 finished in 798 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(X(F(p0)))))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:56] [INFO ] Invariant cache hit.
[2024-05-25 16:51:56] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-25 16:51:56] [INFO ] Invariant cache hit.
[2024-05-25 16:51:56] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 124 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-13
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-13 finished in 286 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 p1)&&X(G(X(p2)))))'
Support contains 10 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:56] [INFO ] Invariant cache hit.
[2024-05-25 16:51:56] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-25 16:51:56] [INFO ] Invariant cache hit.
[2024-05-25 16:51:56] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [10, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 95 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 25/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) p0), (NOT p2), true, p0, (NOT p2)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-14
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 1 ms.
FORMULA NQueens-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-14 finished in 311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:57] [INFO ] Invariant cache hit.
[2024-05-25 16:51:57] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-25 16:51:57] [INFO ] Invariant cache hit.
[2024-05-25 16:51:57] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 124 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-15
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-15 finished in 211 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 U X((((p0 U !p1) U p2) U G(!p0))))))'
Found a Lengthening insensitive property : NQueens-PT-05-LTLFireability-05
Stuttering acceptance computed with spot in 259 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Support contains 10 out of 27 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:51:57] [INFO ] Invariant cache hit.
[2024-05-25 16:51:57] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-25 16:51:57] [INFO ] Invariant cache hit.
[2024-05-25 16:51:57] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 89 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 89 ms. Remains : 24/27 places, 25/25 transitions.
Running random walk in product with property : NQueens-PT-05-LTLFireability-05
Product exploration explored 100000 steps with 18729 reset in 209 ms.
Product exploration explored 100000 steps with 18755 reset in 220 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
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 p0 p2 p1), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 580 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
RANDOM walk for 267 steps (50 resets) in 8 ms. (29 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 p2 p1), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (OR (NOT p0) p2) (OR p2 p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 1061 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Stuttering acceptance computed with spot in 249 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
// Phase 1: matrix 25 rows 24 cols
[2024-05-25 16:52:00] [INFO ] Computed 3 invariants in 7 ms
[2024-05-25 16:52:00] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:52:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:52:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:52:00] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 16:52:00] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-25 16:52:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:52:00] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG p0
Support contains 10 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:52:00] [INFO ] Invariant cache hit.
[2024-05-25 16:52:00] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-25 16:52:00] [INFO ] Invariant cache hit.
[2024-05-25 16:52:00] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 95 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 95 ms. Remains : 24/24 places, 25/25 transitions.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
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 p0 p2 p1), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 664 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
RANDOM walk for 583 steps (109 resets) in 12 ms. (44 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 p2 p1), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (OR (NOT p0) p2) (OR p2 p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 867 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Stuttering acceptance computed with spot in 260 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
[2024-05-25 16:52:03] [INFO ] Invariant cache hit.
[2024-05-25 16:52:03] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:52:03] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:52:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:52:03] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:52:03] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-25 16:52:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:52:03] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 225 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Product exploration explored 100000 steps with 18734 reset in 210 ms.
Product exploration explored 100000 steps with 18764 reset in 222 ms.
Applying partial POR strategy [false, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 362 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Support contains 10 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:52:04] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7 ms. Remains : 24/24 places, 25/25 transitions.
Support contains 10 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-25 16:52:04] [INFO ] Invariant cache hit.
[2024-05-25 16:52:04] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-25 16:52:04] [INFO ] Invariant cache hit.
[2024-05-25 16:52:04] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 24/24 places, 25/25 transitions.
Treatment of property NQueens-PT-05-LTLFireability-05 finished in 7299 ms.
[2024-05-25 16:52:04] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:52:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-25 16:52:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 27 places, 25 transitions and 99 arcs took 3 ms.
Total runtime 22355 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running NQueens-PT-05
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 27
TRANSITIONS: 25
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1858
MODEL NAME: /home/mcc/execution/411/model
27 places, 25 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA NQueens-PT-05-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716655925624
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="NQueens-PT-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is NQueens-PT-05, 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 r245-tall-171654349700340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-05.tgz
mv NQueens-PT-05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;