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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K 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 49K 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.7K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 03:19 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 759K 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-30-LTLFireability-00
FORMULA_NAME NQueens-PT-30-LTLFireability-01
FORMULA_NAME NQueens-PT-30-LTLFireability-02
FORMULA_NAME NQueens-PT-30-LTLFireability-03
FORMULA_NAME NQueens-PT-30-LTLFireability-04
FORMULA_NAME NQueens-PT-30-LTLFireability-05
FORMULA_NAME NQueens-PT-30-LTLFireability-06
FORMULA_NAME NQueens-PT-30-LTLFireability-07
FORMULA_NAME NQueens-PT-30-LTLFireability-08
FORMULA_NAME NQueens-PT-30-LTLFireability-09
FORMULA_NAME NQueens-PT-30-LTLFireability-10
FORMULA_NAME NQueens-PT-30-LTLFireability-11
FORMULA_NAME NQueens-PT-30-LTLFireability-12
FORMULA_NAME NQueens-PT-30-LTLFireability-13
FORMULA_NAME NQueens-PT-30-LTLFireability-14
FORMULA_NAME NQueens-PT-30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716663653193

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-30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 19:00:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 19:00:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:00:54] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-05-25 19:00:54] [INFO ] Transformed 1080 places.
[2024-05-25 19:00:54] [INFO ] Transformed 900 transitions.
[2024-05-25 19:00:54] [INFO ] Found NUPN structural information;
[2024-05-25 19:00:54] [INFO ] Parsed PT model containing 1080 places and 900 transitions and 4500 arcs in 270 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 5 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-30-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 88 out of 1078 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1078/1078 places, 900/900 transitions.
Reduce places removed 900 places and 0 transitions.
Iterating post reduction 0 with 900 rules applied. Total rules applied 900 place count 178 transition count 900
Applied a total of 900 rules in 36 ms. Remains 178 /1078 variables (removed 900) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:00:55] [INFO ] Invariants computation overflowed in 187 ms
[2024-05-25 19:00:55] [INFO ] Implicit Places using invariants in 489 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:00:55] [INFO ] Invariants computation overflowed in 108 ms
[2024-05-25 19:02:09] [INFO ] Performed 2/178 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 19:02:41] [INFO ] Performed 6/178 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 19:03:13] [INFO ] Performed 9/178 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 19:03:35] [INFO ] Implicit Places using invariants and state equation in 160128 ms returned []
Implicit Place search using SMT with State Equation took 160648 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Starting structural reductions in LTL mode, iteration 1 : 178/1078 places, 900/900 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160714 ms. Remains : 178/1078 places, 900/900 transitions.
Support contains 88 out of 178 places after structural reductions.
[2024-05-25 19:03:35] [INFO ] Flatten gal took : 115 ms
[2024-05-25 19:03:35] [INFO ] Flatten gal took : 75 ms
[2024-05-25 19:03:36] [INFO ] Input system was already deterministic with 900 transitions.
Reduction of identical properties reduced properties to check from 31 to 27
RANDOM walk for 90 steps (0 resets) in 68 ms. (1 steps per ms) remains 0/27 properties
Computed a total of 178 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 178 transition count 900
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G((p1&&X(p2))))))'
Support contains 8 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 900/900 transitions.
Applied a total of 0 rules in 40 ms. Remains 178 /178 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:03:36] [INFO ] Invariants computation overflowed in 106 ms
[2024-05-25 19:03:37] [INFO ] Implicit Places using invariants in 466 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:03:37] [INFO ] Invariants computation overflowed in 89 ms
[2024-05-25 19:04:50] [INFO ] Performed 1/178 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 19:05:22] [INFO ] Performed 3/178 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 19:05:54] [INFO ] Performed 5/178 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 19:06:17] [INFO ] Implicit Places using invariants and state equation in 160118 ms returned []
Implicit Place search using SMT with State Equation took 160588 ms to find 0 implicit places.
[2024-05-25 19:06:17] [INFO ] Redundant transitions in 50 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 160699 ms. Remains : 178/178 places, 900/900 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : NQueens-PT-30-LTLFireability-00
Product exploration explored 100000 steps with 3583 reset in 5825 ms.
Product exploration explored 100000 steps with 3582 reset in 5650 ms.
Computed a total of 178 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 178 transition count 900
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (F (G p1)), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-30-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-30-LTLFireability-00 finished in 174806 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 p1)&&G(X(F(p2)))))'
Support contains 8 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 900/900 transitions.
Applied a total of 0 rules in 6 ms. Remains 178 /178 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:06:31] [INFO ] Invariants computation overflowed in 86 ms
[2024-05-25 19:06:31] [INFO ] Implicit Places using invariants in 476 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:06:31] [INFO ] Invariants computation overflowed in 126 ms
[2024-05-25 19:07:45] [INFO ] Performed 1/178 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 19:08:17] [INFO ] Performed 3/178 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 19:08:49] [INFO ] Performed 5/178 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 19:09:12] [INFO ] Implicit Places with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... after 160153 ms
Implicit Place search using SMT with State Equation took 160653 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 160660 ms. Remains : 178/178 places, 900/900 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p2), true]
Running random walk in product with property : NQueens-PT-30-LTLFireability-03
Product exploration explored 100000 steps with 8941 reset in 8860 ms.
Product exploration explored 100000 steps with 8795 reset in 8828 ms.
Computed a total of 178 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 178 transition count 900
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) p1 p0), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X p2), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X p2)), (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 18 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-30-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-30-LTLFireability-03 finished in 180508 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(F(p1))||G(p2)||p0)))'
Support contains 15 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 900/900 transitions.
Applied a total of 0 rules in 8 ms. Remains 178 /178 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:09:31] [INFO ] Invariants computation overflowed in 81 ms
[2024-05-25 19:09:32] [INFO ] Implicit Places using invariants in 336 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:09:32] [INFO ] Invariants computation overflowed in 94 ms
[2024-05-25 19:10:45] [INFO ] Performed 2/178 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 19:11:17] [INFO ] Performed 4/178 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 19:11:49] [INFO ] Performed 6/178 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 19:12:12] [INFO ] Implicit Places using invariants and state equation in 160103 ms returned []
Implicit Place search using SMT with State Equation took 160446 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 160455 ms. Remains : 178/178 places, 900/900 transitions.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NQueens-PT-30-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 9275 ms.
Product exploration explored 100000 steps with 50000 reset in 9336 ms.
Computed a total of 178 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 178 transition count 900
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) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 13 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-30-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-30-LTLFireability-04 finished in 181279 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 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 900/900 transitions.
Applied a total of 0 rules in 12 ms. Remains 178 /178 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:12:33] [INFO ] Invariants computation overflowed in 81 ms
[2024-05-25 19:12:33] [INFO ] Implicit Places using invariants in 439 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:12:33] [INFO ] Invariants computation overflowed in 90 ms
[2024-05-25 19:13:47] [INFO ] Performed 1/178 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 19:14:19] [INFO ] Performed 3/178 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 19:14:51] [INFO ] Performed 5/178 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 19:15:13] [INFO ] Implicit Places using invariants and state equation in 160128 ms returned []
Implicit Place search using SMT with State Equation took 160576 ms to find 0 implicit places.
[2024-05-25 19:15:13] [INFO ] Redundant transitions in 12 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 15ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 160631 ms. Remains : 178/178 places, 900/900 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-30-LTLFireability-06
Product exploration timeout after 95180 steps with 11162 reset in 10003 ms.
Product exploration timeout after 98870 steps with 11547 reset in 10002 ms.
Computed a total of 178 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 178 transition count 900
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 22 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-30-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-30-LTLFireability-06 finished in 182627 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)))))'
Support contains 8 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 900/900 transitions.
Applied a total of 0 rules in 11 ms. Remains 178 /178 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:15:35] [INFO ] Invariants computation overflowed in 81 ms
[2024-05-25 19:15:36] [INFO ] Implicit Places using invariants in 336 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:15:36] [INFO ] Invariants computation overflowed in 94 ms
[2024-05-25 19:16:49] [INFO ] Performed 1/178 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 19:17:21] [INFO ] Performed 3/178 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 19:17:53] [INFO ] Performed 5/178 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 19:18:16] [INFO ] Implicit Places using invariants and state equation in 160122 ms returned []
Implicit Place search using SMT with State Equation took 160460 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 160472 ms. Remains : 178/178 places, 900/900 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NQueens-PT-30-LTLFireability-07
Product exploration explored 100000 steps with 3582 reset in 5381 ms.
Product exploration explored 100000 steps with 3584 reset in 5607 ms.
Computed a total of 178 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 178 transition count 900
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-30-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-30-LTLFireability-07 finished in 173763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))||(F(p2)&&p1))))))'
Support contains 8 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 900/900 transitions.
Applied a total of 0 rules in 6 ms. Remains 178 /178 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:18:29] [INFO ] Invariants computation overflowed in 105 ms
[2024-05-25 19:18:29] [INFO ] Implicit Places using invariants in 348 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:18:29] [INFO ] Invariants computation overflowed in 85 ms
[2024-05-25 19:19:45] [INFO ] Performed 1/178 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 19:20:17] [INFO ] Performed 3/178 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 19:20:49] [INFO ] Performed 5/178 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 19:21:10] [INFO ] Implicit Places using invariants and state equation in 160102 ms returned []
Implicit Place search using SMT with State Equation took 160470 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 160478 ms. Remains : 178/178 places, 900/900 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (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)))]
Running random walk in product with property : NQueens-PT-30-LTLFireability-08
Product exploration explored 100000 steps with 6069 reset in 6151 ms.
Product exploration explored 100000 steps with 5957 reset in 6163 ms.
Computed a total of 178 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 178 transition count 900
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 (NOT p0)), (F (G (NOT p1))), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-30-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-30-LTLFireability-08 finished in 173283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p1)||F(p2)||p0))||G(p3)))'
Support contains 16 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 900/900 transitions.
Applied a total of 0 rules in 7 ms. Remains 178 /178 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:21:22] [INFO ] Invariants computation overflowed in 92 ms
[2024-05-25 19:21:23] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:21:23] [INFO ] Invariants computation overflowed in 96 ms
[2024-05-25 19:22:36] [INFO ] Performed 1/178 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 19:23:08] [INFO ] Performed 4/178 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 19:23:40] [INFO ] Performed 6/178 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 19:24:03] [INFO ] Implicit Places using invariants and state equation in 160110 ms returned []
Implicit Place search using SMT with State Equation took 160423 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 160432 ms. Remains : 178/178 places, 900/900 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : NQueens-PT-30-LTLFireability-09
Stuttering criterion allowed to conclude after 120 steps with 45 reset in 11 ms.
FORMULA NQueens-PT-30-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-09 finished in 160739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||G(p1))&&(F(p2)||(!p3 U (p4||G(!p3))))))'
Support contains 16 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 900/900 transitions.
Applied a total of 0 rules in 9 ms. Remains 178 /178 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:24:03] [INFO ] Invariants computation overflowed in 84 ms
[2024-05-25 19:24:03] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:24:03] [INFO ] Invariants computation overflowed in 82 ms
[2024-05-25 19:25:18] [INFO ] Performed 2/178 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 19:25:50] [INFO ] Performed 5/178 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 19:26:22] [INFO ] Performed 7/178 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 19:26:43] [INFO ] Implicit Places using invariants and state equation in 160098 ms returned []
Implicit Place search using SMT with State Equation took 160424 ms to find 0 implicit places.
[2024-05-25 19:26:44] [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 160458 ms. Remains : 178/178 places, 900/900 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p4) p3)]
Running random walk in product with property : NQueens-PT-30-LTLFireability-10
Product exploration explored 100000 steps with 11324 reset in 9976 ms.
Product exploration timeout after 99020 steps with 11122 reset in 10001 ms.
Computed a total of 178 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 178 transition count 900
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 (NOT p2) (NOT p4) p3), (X (NOT (AND (NOT p2) (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p4) (NOT p3))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2)), (F (G p4)), (F (G (NOT p3)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p2) (NOT p4) p3)), (X (NOT (AND (NOT p2) (NOT p4) p3))), (X p4), (X (NOT p4)), (X (NOT p2)), (X p2), (X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p4) p3))), (X (X (NOT (AND (NOT p2) (NOT p4) p3)))), (X (X p4)), (X (X (NOT p4))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 5 states, 10 edges and 5 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-30-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-30-LTLFireability-10 finished in 182972 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 G(!p1)))'
Support contains 8 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 900/900 transitions.
Applied a total of 0 rules in 8 ms. Remains 178 /178 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:27:06] [INFO ] Invariants computation overflowed in 83 ms
[2024-05-25 19:27:06] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:27:06] [INFO ] Invariants computation overflowed in 89 ms
[2024-05-25 19:28:20] [INFO ] Performed 1/178 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 19:28:52] [INFO ] Performed 3/178 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 19:29:24] [INFO ] Performed 5/178 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 19:29:46] [INFO ] Implicit Places using invariants and state equation in 160111 ms returned []
Implicit Place search using SMT with State Equation took 160439 ms to find 0 implicit places.
[2024-05-25 19:29:46] [INFO ] Redundant transitions in 8 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 160463 ms. Remains : 178/178 places, 900/900 transitions.
Stuttering acceptance computed with spot in 87 ms :[p1, true, p1]
Running random walk in product with property : NQueens-PT-30-LTLFireability-11
Entered a terminal (fully accepting) state of product in 30 steps with 1 reset in 2 ms.
FORMULA NQueens-PT-30-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-11 finished in 160570 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(G(p1)))))'
Support contains 8 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 900/900 transitions.
Applied a total of 0 rules in 5 ms. Remains 178 /178 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:29:47] [INFO ] Invariants computation overflowed in 86 ms
[2024-05-25 19:29:47] [INFO ] Implicit Places using invariants in 343 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:29:47] [INFO ] Invariants computation overflowed in 88 ms
[2024-05-25 19:31:03] [INFO ] Performed 1/178 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 19:31:35] [INFO ] Performed 3/178 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 19:32:07] [INFO ] Performed 6/178 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 19:32:27] [INFO ] Implicit Places with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... after 160101 ms
Implicit Place search using SMT with State Equation took 160456 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 160461 ms. Remains : 178/178 places, 900/900 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-30-LTLFireability-14
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-14 finished in 160701 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||(p1 U X(G(p2)))))))'
Support contains 7 out of 178 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 900/900 transitions.
Applied a total of 0 rules in 16 ms. Remains 178 /178 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:32:27] [INFO ] Invariants computation overflowed in 93 ms
[2024-05-25 19:32:28] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2024-05-25 19:32:28] [INFO ] Invariants computation overflowed in 97 ms
[2024-05-25 19:33:43] [INFO ] Performed 1/178 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 19:34:15] [INFO ] Performed 3/178 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 19:34:47] [INFO ] Performed 5/178 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 19:35:08] [INFO ] Implicit Places using invariants and state equation in 160121 ms returned []
Implicit Place search using SMT with State Equation took 160465 ms to find 0 implicit places.
[2024-05-25 19:35:08] [INFO ] Redundant transitions in 7 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 160496 ms. Remains : 178/178 places, 900/900 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NQueens-PT-30-LTLFireability-15
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 5 ms.
FORMULA NQueens-PT-30-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-15 finished in 160622 ms.
All properties solved by simple procedures.
Total runtime 2054066 ms.
ITS solved all properties within timeout

BK_STOP 1716665708780

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NQueens-PT-30"
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-30, 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-171654349800396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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