About the Execution of GreatSPN+red for NQueens-PT-12
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
474.720 | 80919.00 | 92456.00 | 458.30 | TFFTFTTTTFFFFFTT | 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-171654349700364.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-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349700364
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.4K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 03:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 12 03:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 03:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 12 03:26 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 134K 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-12-LTLFireability-00
FORMULA_NAME NQueens-PT-12-LTLFireability-01
FORMULA_NAME NQueens-PT-12-LTLFireability-02
FORMULA_NAME NQueens-PT-12-LTLFireability-03
FORMULA_NAME NQueens-PT-12-LTLFireability-04
FORMULA_NAME NQueens-PT-12-LTLFireability-05
FORMULA_NAME NQueens-PT-12-LTLFireability-06
FORMULA_NAME NQueens-PT-12-LTLFireability-07
FORMULA_NAME NQueens-PT-12-LTLFireability-08
FORMULA_NAME NQueens-PT-12-LTLFireability-09
FORMULA_NAME NQueens-PT-12-LTLFireability-10
FORMULA_NAME NQueens-PT-12-LTLFireability-11
FORMULA_NAME NQueens-PT-12-LTLFireability-12
FORMULA_NAME NQueens-PT-12-LTLFireability-13
FORMULA_NAME NQueens-PT-12-LTLFireability-14
FORMULA_NAME NQueens-PT-12-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716656195095
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-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:56:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 16:56:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:56:36] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-25 16:56:36] [INFO ] Transformed 216 places.
[2024-05-25 16:56:36] [INFO ] Transformed 144 transitions.
[2024-05-25 16:56:36] [INFO ] Found NUPN structural information;
[2024-05-25 16:56:36] [INFO ] Parsed PT model containing 216 places and 144 transitions and 720 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-12-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-12-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 144/144 transitions.
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 70 transition count 144
Applied a total of 144 rules in 18 ms. Remains 70 /214 variables (removed 144) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 70 cols
[2024-05-25 16:56:36] [INFO ] Computed 7 invariants in 19 ms
[2024-05-25 16:56:36] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-25 16:56:36] [INFO ] Invariant cache hit.
[2024-05-25 16:56:39] [INFO ] Implicit Places using invariants and state equation in 2661 ms returned [46, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2924 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/214 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2964 ms. Remains : 68/214 places, 144/144 transitions.
Support contains 53 out of 68 places after structural reductions.
[2024-05-25 16:56:39] [INFO ] Flatten gal took : 43 ms
[2024-05-25 16:56:39] [INFO ] Flatten gal took : 17 ms
[2024-05-25 16:56:39] [INFO ] Input system was already deterministic with 144 transitions.
Reduction of identical properties reduced properties to check from 33 to 30
RANDOM walk for 100 steps (7 resets) in 19 ms. (5 steps per ms) remains 0/30 properties
Computed a total of 68 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 144
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' '!(G((p0 U (p1||F(G(!p1))))))'
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 144/144 transitions.
Applied a total of 0 rules in 7 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 68 cols
[2024-05-25 16:56:40] [INFO ] Computed 5 invariants in 9 ms
[2024-05-25 16:56:40] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-25 16:56:40] [INFO ] Invariant cache hit.
[2024-05-25 16:56:44] [INFO ] Implicit Places using invariants and state equation in 3934 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4195 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/68 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4207 ms. Remains : 66/68 places, 144/144 transitions.
Stuttering acceptance computed with spot in 181 ms :[false, p1]
Running random walk in product with property : NQueens-PT-12-LTLFireability-00
Product exploration explored 100000 steps with 8987 reset in 1151 ms.
Product exploration explored 100000 steps with 8982 reset in 1059 ms.
Computed a total of 66 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (OR p1 p0)), (X (NOT (OR 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 (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT 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 15 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-00 finished in 6799 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))||(G(p1)&&X(X(G(p2))))))'
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-25 16:56:47] [INFO ] Invariant cache hit.
[2024-05-25 16:56:47] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-25 16:56:47] [INFO ] Invariant cache hit.
[2024-05-25 16:56:50] [INFO ] Implicit Places using invariants and state equation in 3350 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3599 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/68 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3602 ms. Remains : 66/68 places, 144/144 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-01
Stuttering criterion allowed to conclude after 13 steps with 2 reset in 0 ms.
FORMULA NQueens-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-01 finished in 3801 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 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 144/144 transitions.
Applied a total of 0 rules in 9 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-25 16:56:50] [INFO ] Invariant cache hit.
[2024-05-25 16:56:51] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-25 16:56:51] [INFO ] Invariant cache hit.
[2024-05-25 16:56:54] [INFO ] Implicit Places using invariants and state equation in 3628 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3913 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/68 places, 144/144 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3930 ms. Remains : 66/68 places, 144/144 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-02
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-02 finished in 3989 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)||((!p1||G(!p0))&&X(X(F(!p2))))||G(!p1))))'
Support contains 12 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-25 16:56:54] [INFO ] Invariant cache hit.
[2024-05-25 16:56:55] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-25 16:56:55] [INFO ] Invariant cache hit.
[2024-05-25 16:56:58] [INFO ] Implicit Places using invariants and state equation in 3397 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3618 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/68 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3621 ms. Remains : 66/68 places, 144/144 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND p0 p1), (AND p1 p0 p2), (AND p0 p1), (AND p1 p0 p2), (AND p1 p0 p2), (AND p1 p0 p2)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-03
Product exploration explored 100000 steps with 15938 reset in 1550 ms.
Product exploration explored 100000 steps with 15959 reset in 1575 ms.
Computed a total of 66 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (OR (NOT p1) (NOT p0))), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (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 (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-03 finished in 7142 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&&X(p1)))))'
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-25 16:57:02] [INFO ] Invariant cache hit.
[2024-05-25 16:57:02] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-25 16:57:02] [INFO ] Invariant cache hit.
[2024-05-25 16:57:06] [INFO ] Implicit Places using invariants and state equation in 3991 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4217 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/68 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4220 ms. Remains : 67/68 places, 144/144 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-04 finished in 4375 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' '!((!p0||F(!p1)))'
Support contains 7 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-25 16:57:06] [INFO ] Invariant cache hit.
[2024-05-25 16:57:06] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-25 16:57:06] [INFO ] Invariant cache hit.
[2024-05-25 16:57:10] [INFO ] Implicit Places using invariants and state equation in 3400 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3632 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/68 places, 144/144 transitions.
Applied a total of 0 rules in 8 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3647 ms. Remains : 66/68 places, 144/144 transitions.
Stuttering acceptance computed with spot in 70 ms :[p1, (AND p1 p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-05
Product exploration explored 100000 steps with 24067 reset in 1566 ms.
Product exploration explored 100000 steps with 24174 reset in 1539 ms.
Computed a total of 66 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-05 finished in 6924 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' '!(((p0 U (p1 U G(p0)))||F(p2)))'
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-25 16:57:13] [INFO ] Invariant cache hit.
[2024-05-25 16:57:13] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-25 16:57:13] [INFO ] Invariant cache hit.
[2024-05-25 16:57:17] [INFO ] Implicit Places using invariants and state equation in 3584 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3837 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/68 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3849 ms. Remains : 66/68 places, 144/144 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-06
Product exploration explored 100000 steps with 22303 reset in 1535 ms.
Product exploration explored 100000 steps with 22237 reset in 1544 ms.
Computed a total of 66 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
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 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-06 finished in 7220 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 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-25 16:57:20] [INFO ] Invariant cache hit.
[2024-05-25 16:57:20] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-25 16:57:20] [INFO ] Invariant cache hit.
[2024-05-25 16:57:24] [INFO ] Implicit Places using invariants and state equation in 3692 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3944 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/68 places, 144/144 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3954 ms. Remains : 66/68 places, 144/144 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-07
Product exploration explored 100000 steps with 10479 reset in 1034 ms.
Product exploration explored 100000 steps with 10445 reset in 1061 ms.
Computed a total of 66 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
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 (NOT p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-07 finished in 6233 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((((X(!p0)&&G(!p1)&&F(!p2))||G((!p1&&X(!p0)))) U X(!p2)))))'
Support contains 12 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 144/144 transitions.
Applied a total of 0 rules in 8 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-25 16:57:26] [INFO ] Invariant cache hit.
[2024-05-25 16:57:27] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-25 16:57:27] [INFO ] Invariant cache hit.
[2024-05-25 16:57:30] [INFO ] Implicit Places using invariants and state equation in 3842 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4073 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/68 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4087 ms. Remains : 66/68 places, 144/144 transitions.
Stuttering acceptance computed with spot in 200 ms :[p2, p2, (AND p1 p2), p2, false]
Running random walk in product with property : NQueens-PT-12-LTLFireability-08
Product exploration explored 100000 steps with 20978 reset in 1546 ms.
Product exploration explored 100000 steps with 20983 reset in 1575 ms.
Computed a total of 66 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 p0), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 33 ms. Reduced automaton from 5 states, 20 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-08 finished in 7550 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) U X(G(p1)))))'
Support contains 10 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-25 16:57:34] [INFO ] Invariant cache hit.
[2024-05-25 16:57:34] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-25 16:57:34] [INFO ] Invariant cache hit.
[2024-05-25 16:57:38] [INFO ] Implicit Places using invariants and state equation in 3471 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3692 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/68 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3696 ms. Remains : 66/68 places, 144/144 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-09
Stuttering criterion allowed to conclude after 12 steps with 1 reset in 1 ms.
FORMULA NQueens-PT-12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-09 finished in 3919 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)&&X(p2))))))'
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-25 16:57:38] [INFO ] Invariant cache hit.
[2024-05-25 16:57:38] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-25 16:57:38] [INFO ] Invariant cache hit.
[2024-05-25 16:57:41] [INFO ] Implicit Places using invariants and state equation in 3499 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3720 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/68 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3731 ms. Remains : 66/68 places, 144/144 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-10
Stuttering criterion allowed to conclude after 65 steps with 10 reset in 3 ms.
FORMULA NQueens-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-10 finished in 3892 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||X(G(p1)))))'
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-25 16:57:42] [INFO ] Invariant cache hit.
[2024-05-25 16:57:42] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-25 16:57:42] [INFO ] Invariant cache hit.
[2024-05-25 16:57:46] [INFO ] Implicit Places using invariants and state equation in 3712 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3945 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/68 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3949 ms. Remains : 66/68 places, 144/144 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-12
Entered a terminal (fully accepting) state of product in 12 steps with 2 reset in 0 ms.
FORMULA NQueens-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-12 finished in 4080 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)&&(X(X(p1))||G(p2))))'
Support contains 12 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-25 16:57:46] [INFO ] Invariant cache hit.
[2024-05-25 16:57:46] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-25 16:57:46] [INFO ] Invariant cache hit.
[2024-05-25 16:57:48] [INFO ] Implicit Places using invariants and state equation in 1785 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2004 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/68 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2009 ms. Remains : 67/68 places, 144/144 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-13
Entered a terminal (fully accepting) state of product in 11 steps with 3 reset in 1 ms.
FORMULA NQueens-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-13 finished in 2329 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((X(p0)||G(p1)))&&F(p2))))'
Support contains 12 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-25 16:57:48] [INFO ] Invariant cache hit.
[2024-05-25 16:57:48] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-25 16:57:48] [INFO ] Invariant cache hit.
[2024-05-25 16:57:52] [INFO ] Implicit Places using invariants and state equation in 3689 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3913 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/68 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3922 ms. Remains : 66/68 places, 144/144 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-14
Product exploration explored 100000 steps with 20610 reset in 1450 ms.
Product exploration explored 100000 steps with 20535 reset in 1494 ms.
Computed a total of 66 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X p2), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-14 finished in 7111 ms.
All properties solved by simple procedures.
Total runtime 79401 ms.
ITS solved all properties within timeout
BK_STOP 1716656276014
--------------------
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-12"
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-12, 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-171654349700364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-12.tgz
mv NQueens-PT-12 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 ;