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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 03:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 12 03:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K 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 203K 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-15-LTLFireability-00
FORMULA_NAME NQueens-PT-15-LTLFireability-01
FORMULA_NAME NQueens-PT-15-LTLFireability-02
FORMULA_NAME NQueens-PT-15-LTLFireability-03
FORMULA_NAME NQueens-PT-15-LTLFireability-04
FORMULA_NAME NQueens-PT-15-LTLFireability-05
FORMULA_NAME NQueens-PT-15-LTLFireability-06
FORMULA_NAME NQueens-PT-15-LTLFireability-07
FORMULA_NAME NQueens-PT-15-LTLFireability-08
FORMULA_NAME NQueens-PT-15-LTLFireability-09
FORMULA_NAME NQueens-PT-15-LTLFireability-10
FORMULA_NAME NQueens-PT-15-LTLFireability-11
FORMULA_NAME NQueens-PT-15-LTLFireability-12
FORMULA_NAME NQueens-PT-15-LTLFireability-13
FORMULA_NAME NQueens-PT-15-LTLFireability-14
FORMULA_NAME NQueens-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716657803043

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-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 17:23:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 17:23:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 17:23:24] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-25 17:23:24] [INFO ] Transformed 315 places.
[2024-05-25 17:23:24] [INFO ] Transformed 225 transitions.
[2024-05-25 17:23:24] [INFO ] Found NUPN structural information;
[2024-05-25 17:23:24] [INFO ] Parsed PT model containing 315 places and 225 transitions and 1125 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-15-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-15-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-15-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 225/225 transitions.
Reduce places removed 225 places and 0 transitions.
Iterating post reduction 0 with 225 rules applied. Total rules applied 225 place count 88 transition count 225
Applied a total of 225 rules in 29 ms. Remains 88 /313 variables (removed 225) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 88 cols
[2024-05-25 17:23:24] [INFO ] Computed 7 invariants in 31 ms
[2024-05-25 17:23:25] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-25 17:23:25] [INFO ] Invariant cache hit.
[2024-05-25 17:23:29] [INFO ] Implicit Places using invariants and state equation in 4650 ms returned [30, 58, 59, 87]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 5041 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/313 places, 225/225 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5089 ms. Remains : 84/313 places, 225/225 transitions.
Support contains 67 out of 84 places after structural reductions.
[2024-05-25 17:23:29] [INFO ] Flatten gal took : 61 ms
[2024-05-25 17:23:29] [INFO ] Flatten gal took : 25 ms
[2024-05-25 17:23:30] [INFO ] Input system was already deterministic with 225 transitions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 75 steps (4 resets) in 31 ms. (2 steps per ms) remains 0/32 properties
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
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((X(X(p0))||G(p1))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:23:30] [INFO ] Invariants computation overflowed in 20 ms
[2024-05-25 17:23:30] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:23:30] [INFO ] Invariants computation overflowed in 14 ms
[2024-05-25 17:23:43] [INFO ] Implicit Places using invariants and state equation in 12936 ms returned []
Implicit Place search using SMT with State Equation took 13066 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Finished structural reductions in LTL mode , in 1 iterations and 13077 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 350 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-00
Entered a terminal (fully accepting) state of product in 20 steps with 4 reset in 5 ms.
FORMULA NQueens-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-00 finished in 13500 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 p1)&&G(F(p2))))))'
Support contains 12 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:23:44] [INFO ] Invariants computation overflowed in 10 ms
[2024-05-25 17:23:44] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:23:44] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-25 17:24:01] [INFO ] Implicit Places using invariants and state equation in 17557 ms returned []
Implicit Place search using SMT with State Equation took 17862 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 17868 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-01
Stuttering criterion allowed to conclude after 121 steps with 9 reset in 8 ms.
FORMULA NQueens-PT-15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-01 finished in 18094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:24:02] [INFO ] Invariants computation overflowed in 10 ms
[2024-05-25 17:24:02] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:24:02] [INFO ] Invariants computation overflowed in 12 ms
[2024-05-25 17:24:14] [INFO ] Implicit Places using invariants and state equation in 11884 ms returned []
Implicit Place search using SMT with State Equation took 11994 ms to find 0 implicit places.
[2024-05-25 17:24:14] [INFO ] Redundant transitions in 11 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 12020 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-04
Product exploration explored 100000 steps with 19449 reset in 2526 ms.
Product exploration explored 100000 steps with 19551 reset in 2536 ms.
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-04 finished in 17296 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(((!p1&&F((G(!p1)&&F(!p2))))||G((F(!p2)&&F(G(!p1))))||p0)))'
Support contains 12 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 10 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:24:19] [INFO ] Invariants computation overflowed in 11 ms
[2024-05-25 17:24:19] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:24:19] [INFO ] Invariants computation overflowed in 9 ms
[2024-05-25 17:24:31] [INFO ] Implicit Places using invariants and state equation in 11723 ms returned []
Implicit Place search using SMT with State Equation took 11815 ms to find 0 implicit places.
[2024-05-25 17:24:31] [INFO ] Redundant transitions in 10 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 11847 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p2)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-06
Product exploration explored 100000 steps with 22569 reset in 2577 ms.
Product exploration explored 100000 steps with 22762 reset in 2653 ms.
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
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) p1 p2), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 12 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-06 finished in 17387 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 G(p1)))'
Support contains 8 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:24:36] [INFO ] Invariants computation overflowed in 10 ms
[2024-05-25 17:24:36] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:24:36] [INFO ] Invariants computation overflowed in 11 ms
[2024-05-25 17:24:48] [INFO ] Implicit Places using invariants and state equation in 11294 ms returned []
Implicit Place search using SMT with State Equation took 11393 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 11397 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-07
Entered a terminal (fully accepting) state of product in 20 steps with 7 reset in 2 ms.
FORMULA NQueens-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-07 finished in 11585 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(F((G(!p1)||(!p1&&F(!p2))))))))'
Support contains 11 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:24:48] [INFO ] Invariants computation overflowed in 16 ms
[2024-05-25 17:24:48] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:24:48] [INFO ] Invariants computation overflowed in 9 ms
[2024-05-25 17:25:06] [INFO ] Implicit Places using invariants and state equation in 17679 ms returned []
Implicit Place search using SMT with State Equation took 17782 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 17787 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, (AND p1 p2), p1]
Running random walk in product with property : NQueens-PT-15-LTLFireability-08
Product exploration explored 100000 steps with 13439 reset in 2200 ms.
Product exploration explored 100000 steps with 13429 reset in 2168 ms.
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
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) p1 p2), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (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, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-08 finished in 22548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)||G(p1)))||G(p2)))'
Support contains 11 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:25:10] [INFO ] Invariants computation overflowed in 15 ms
[2024-05-25 17:25:11] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:25:11] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-25 17:25:22] [INFO ] Implicit Places using invariants and state equation in 11754 ms returned []
Implicit Place search using SMT with State Equation took 11851 ms to find 0 implicit places.
[2024-05-25 17:25:22] [INFO ] Redundant transitions in 5 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 11881 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-15-LTLFireability-09
Product exploration explored 100000 steps with 7211 reset in 1526 ms.
Product exploration explored 100000 steps with 7221 reset in 1527 ms.
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
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 p2 p0 (NOT p1)), (F (G (NOT p2))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (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 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-09 finished in 15175 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(F((!p1 U (p2||G(!p1)))))) U (G((!p0||X(F((!p1 U (p2||G(!p1)))))))||(!p0&&F(p3))))))'
Support contains 16 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:25:26] [INFO ] Invariants computation overflowed in 13 ms
[2024-05-25 17:25:26] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:25:26] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-25 17:25:37] [INFO ] Implicit Places using invariants and state equation in 11282 ms returned []
Implicit Place search using SMT with State Equation took 11370 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 11373 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND (NOT p2) p1), (AND (NOT p3) p0 (NOT p2) p1), (AND (NOT p3) (NOT p2) p1)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-10
Product exploration explored 100000 steps with 15361 reset in 2182 ms.
Product exploration explored 100000 steps with 15350 reset in 2218 ms.
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
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 p3 (NOT p2) p1), (F (G (NOT p0))), (F (G (NOT p3))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X p0), (X (NOT p0)), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-10 finished in 16130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X((X(G(p2))&&p1)))||p0)))'
Support contains 12 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:25:42] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-25 17:25:42] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:25:42] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-25 17:25:53] [INFO ] Implicit Places using invariants and state equation in 11449 ms returned []
Implicit Place search using SMT with State Equation took 11541 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 11545 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 153 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))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NQueens-PT-15-LTLFireability-11
Product exploration explored 100000 steps with 19674 reset in 2463 ms.
Product exploration explored 100000 steps with 19597 reset in 2513 ms.
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
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) p1 p2), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (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 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-11 finished in 16825 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) U ((X(!p0)&&F(!p1))||G(F(!p1))))))'
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:25:59] [INFO ] Invariants computation overflowed in 12 ms
[2024-05-25 17:25:59] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:25:59] [INFO ] Invariants computation overflowed in 9 ms
[2024-05-25 17:26:10] [INFO ] Implicit Places using invariants and state equation in 11666 ms returned []
Implicit Place search using SMT with State Equation took 11760 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 11764 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) p1), false, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-12
Product exploration explored 100000 steps with 20062 reset in 2456 ms.
Product exploration explored 100000 steps with 20173 reset in 2496 ms.
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
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 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (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 10 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-12 finished in 17011 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((X(p1)||p0))))'
Support contains 8 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:26:16] [INFO ] Invariants computation overflowed in 12 ms
[2024-05-25 17:26:16] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:26:16] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-25 17:26:28] [INFO ] Implicit Places using invariants and state equation in 12400 ms returned []
Implicit Place search using SMT with State Equation took 12498 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 12501 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-15-LTLFireability-13
Entered a terminal (fully accepting) state of product in 43 steps with 3 reset in 2 ms.
FORMULA NQueens-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-13 finished in 12648 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) U (p1||X(p2)))))'
Support contains 12 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:26:28] [INFO ] Invariants computation overflowed in 15 ms
[2024-05-25 17:26:28] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:26:28] [INFO ] Invariants computation overflowed in 13 ms
[2024-05-25 17:26:40] [INFO ] Implicit Places using invariants and state equation in 11746 ms returned []
Implicit Place search using SMT with State Equation took 11846 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 11849 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-14
Stuttering criterion allowed to conclude after 18 steps with 1 reset in 0 ms.
FORMULA NQueens-PT-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-14 finished in 12009 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((X(X(p1))||p0))))'
Support contains 8 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:26:40] [INFO ] Invariants computation overflowed in 13 ms
[2024-05-25 17:26:40] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-25 17:26:40] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-25 17:26:59] [INFO ] Implicit Places using invariants and state equation in 18432 ms returned []
Implicit Place search using SMT with State Equation took 18529 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 18530 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : NQueens-PT-15-LTLFireability-15
Entered a terminal (fully accepting) state of product in 50 steps with 4 reset in 2 ms.
FORMULA NQueens-PT-15-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-15 finished in 18713 ms.
All properties solved by simple procedures.
Total runtime 215279 ms.
ITS solved all properties within timeout

BK_STOP 1716658019841

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

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

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