About the Execution of 2023-gold for NQueens-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 451.827 | 18336.00 | 27177.00 | 507.20 | FFFFFTFFTTFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372300213.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 gold2023
Input is NQueens-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372300213
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 12 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 03:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 30K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME NQueens-PT-05-LTLFireability-00
FORMULA_NAME NQueens-PT-05-LTLFireability-01
FORMULA_NAME NQueens-PT-05-LTLFireability-02
FORMULA_NAME NQueens-PT-05-LTLFireability-03
FORMULA_NAME NQueens-PT-05-LTLFireability-04
FORMULA_NAME NQueens-PT-05-LTLFireability-05
FORMULA_NAME NQueens-PT-05-LTLFireability-06
FORMULA_NAME NQueens-PT-05-LTLFireability-07
FORMULA_NAME NQueens-PT-05-LTLFireability-08
FORMULA_NAME NQueens-PT-05-LTLFireability-09
FORMULA_NAME NQueens-PT-05-LTLFireability-10
FORMULA_NAME NQueens-PT-05-LTLFireability-11
FORMULA_NAME NQueens-PT-05-LTLFireability-12
FORMULA_NAME NQueens-PT-05-LTLFireability-13
FORMULA_NAME NQueens-PT-05-LTLFireability-14
FORMULA_NAME NQueens-PT-05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716682044965
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NQueens-PT-05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 00:07:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 00:07:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:07:26] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2024-05-26 00:07:26] [INFO ] Transformed 55 places.
[2024-05-26 00:07:26] [INFO ] Transformed 25 transitions.
[2024-05-26 00:07:26] [INFO ] Found NUPN structural information;
[2024-05-26 00:07:26] [INFO ] Parsed PT model containing 55 places and 25 transitions and 125 arcs in 96 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-05-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 25/25 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 28 transition count 25
Applied a total of 25 rules in 10 ms. Remains 28 /53 variables (removed 25) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 28 cols
[2024-05-26 00:07:26] [INFO ] Computed 7 invariants in 13 ms
[2024-05-26 00:07:27] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-26 00:07:27] [INFO ] Invariant cache hit.
[2024-05-26 00:07:27] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 530 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/53 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 541 ms. Remains : 27/53 places, 25/25 transitions.
Support contains 27 out of 27 places after structural reductions.
[2024-05-26 00:07:27] [INFO ] Flatten gal took : 18 ms
[2024-05-26 00:07:27] [INFO ] Flatten gal took : 6 ms
[2024-05-26 00:07:27] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 29 properties in 13 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 27 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G((X(p2)&&p1))&&p0) U X(p3)))))'
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2024-05-26 00:07:27] [INFO ] Computed 6 invariants in 2 ms
[2024-05-26 00:07:27] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-26 00:07:27] [INFO ] Invariant cache hit.
[2024-05-26 00:07:28] [INFO ] Implicit Places using invariants and state equation in 76 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 130 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 24/27 places, 25/25 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 605 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3) (NOT p2)) (AND (NOT p1) p2 (NOT p3))), (AND p2 (NOT p3)), false, false]
Running random walk in product with property : NQueens-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={1} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={1} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={0, 1} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND p1 (NOT p3) p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND p1 (NOT p3) p2)), acceptance={1} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={0} source=3 dest: 5}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={1} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p1) p3 (NOT p2))), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={1} source=5 dest: 3}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={0, 1} source=5 dest: 4}], [{ cond=(AND (NOT p1) p3 p2), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) p3 p2), acceptance={0, 1} source=6 dest: 1}, { cond=(OR (AND (NOT p0) p1 p3) (AND p1 p3 p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(OR (AND (NOT p0) p1 p3) (AND p1 p3 p2)), acceptance={1} source=6 dest: 3}, { cond=(AND p1 p3), acceptance={0} source=6 dest: 5}, { cond=(AND p1 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s7 1) (EQ s13 1) (EQ s20 1)), p1:(AND (EQ s2 1) (EQ s7 1) (EQ s13 1) (EQ s20 1)), p3:(AND (EQ s3 1) (EQ s6 1) (EQ s15 1) (EQ s20 1))...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 5 reset in 6 ms.
FORMULA NQueens-PT-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-00 finished in 800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-26 00:07:28] [INFO ] Invariant cache hit.
[2024-05-26 00:07:28] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-26 00:07:28] [INFO ] Invariant cache hit.
[2024-05-26 00:07:28] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 119 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 127 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s6 1) (EQ s15 1) (EQ s20 1)), p1:(AND (EQ s1 1) (EQ s8 1) (EQ s11 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-01 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-26 00:07:28] [INFO ] Invariant cache hit.
[2024-05-26 00:07:28] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-26 00:07:29] [INFO ] Invariant cache hit.
[2024-05-26 00:07:29] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 130 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s2 1) (EQ s5 1) (EQ s15 1) (EQ s18 1)), p0:(AND (EQ s2 1) (EQ s7 1) (EQ s13 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-02 finished in 231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 8 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-26 00:07:29] [INFO ] Invariant cache hit.
[2024-05-26 00:07:29] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-26 00:07:29] [INFO ] Invariant cache hit.
[2024-05-26 00:07:29] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 122 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 124 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s8 1) (EQ s10 1) (EQ s19 1)), p1:(AND (EQ s1 1) (EQ s6 1) (EQ s13 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-03 finished in 293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p1) U G(!p2))&&p0))))'
Support contains 11 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-26 00:07:29] [INFO ] Invariant cache hit.
[2024-05-26 00:07:29] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-26 00:07:29] [INFO ] Invariant cache hit.
[2024-05-26 00:07:29] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 113 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 115 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) p2), (AND (NOT p1) p2), p2, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={1} source=2 dest: 2}, { cond=p2, acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p2 (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s5 1) (EQ s15 1) (EQ s18 1)), p2:(AND (EQ s1 1) (EQ s8 1) (EQ s11 1) (EQ s20 1)), p1:(AND (EQ s4 1) (EQ s7 1) (EQ s15 1) (EQ s22 1))...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-04 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X((((p0 U !p1) U p2) U G(!p0))))))'
Support contains 10 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-26 00:07:29] [INFO ] Invariant cache hit.
[2024-05-26 00:07:29] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-26 00:07:29] [INFO ] Invariant cache hit.
[2024-05-26 00:07:29] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 144 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 274 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Running random walk in product with property : NQueens-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s9 1) (EQ s12 1) (EQ s23 1)), p2:(AND (EQ s3 1) (EQ s8 1) (EQ s13 1) (EQ s22 1)), p1:(AND (EQ s2 1) (EQ s7 1) (EQ s13 1) (EQ s20 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 18748 reset in 392 ms.
Product exploration explored 100000 steps with 18774 reset in 282 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 487 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Finished random walk after 135 steps, including 25 resets, run visited all 8 properties in 11 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p1), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p2) p1)), (F (NOT p0)), (F (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 4 factoid took 739 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Stuttering acceptance computed with spot in 251 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
// Phase 1: matrix 25 rows 24 cols
[2024-05-26 00:07:32] [INFO ] Computed 3 invariants in 2 ms
[2024-05-26 00:07:32] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-26 00:07:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 00:07:32] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-26 00:07:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 00:07:32] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-26 00:07:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 00:07:33] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-26 00:07:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 00:07:33] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG p0
Support contains 10 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-26 00:07:33] [INFO ] Invariant cache hit.
[2024-05-26 00:07:33] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-26 00:07:33] [INFO ] Invariant cache hit.
[2024-05-26 00:07:33] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-26 00:07:33] [INFO ] Invariant cache hit.
[2024-05-26 00:07:33] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 24/24 places, 25/25 transitions.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 581 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Finished random walk after 23 steps, including 4 resets, run visited all 8 properties in 3 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p1), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p2) p1)), (F (NOT p0)), (F (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 4 factoid took 705 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Stuttering acceptance computed with spot in 379 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
[2024-05-26 00:07:35] [INFO ] Invariant cache hit.
[2024-05-26 00:07:35] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-26 00:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 00:07:35] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-26 00:07:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 00:07:35] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-26 00:07:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 00:07:35] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-26 00:07:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 00:07:35] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 425 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Product exploration explored 100000 steps with 18776 reset in 251 ms.
Product exploration explored 100000 steps with 18742 reset in 247 ms.
Applying partial POR strategy [false, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 299 ms :[p0, p0, p0, p1, (NOT p2), p0, true]
Support contains 10 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-26 00:07:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-26 00:07:37] [INFO ] Invariant cache hit.
[2024-05-26 00:07:37] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 24/24 places, 25/25 transitions.
Built C files in :
/tmp/ltsmin13763963527901892694
[2024-05-26 00:07:37] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13763963527901892694
Running compilation step : cd /tmp/ltsmin13763963527901892694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 206 ms.
Running link step : cd /tmp/ltsmin13763963527901892694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin13763963527901892694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1679703936225539230.hoa' '--buchi-type=spotba'
LTSmin run took 170 ms.
FORMULA NQueens-PT-05-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NQueens-PT-05-LTLFireability-05 finished in 8021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 8 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2024-05-26 00:07:37] [INFO ] Computed 6 invariants in 3 ms
[2024-05-26 00:07:37] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-26 00:07:37] [INFO ] Invariant cache hit.
[2024-05-26 00:07:37] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [18, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 165 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 25/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s0 0) (EQ s9 0) (EQ s10 0) (EQ s21 0)), p0:(OR (EQ s3 0) (EQ s7 0) (EQ s15 0) (EQ s22 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 6 reset in 2 ms.
FORMULA NQueens-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-06 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-26 00:07:38] [INFO ] Invariant cache hit.
[2024-05-26 00:07:38] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-26 00:07:38] [INFO ] Invariant cache hit.
[2024-05-26 00:07:38] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 104 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s0 0) (EQ s8 0) (EQ s10 0) (EQ s19 0)), p0:(OR (EQ s0 0) (EQ s6 0) (EQ s12 0) (EQ s17 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 35881 reset in 290 ms.
Product exploration explored 100000 steps with 35994 reset in 304 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-05-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-08 finished in 885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-26 00:07:38] [INFO ] Invariant cache hit.
[2024-05-26 00:07:39] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-26 00:07:39] [INFO ] Invariant cache hit.
[2024-05-26 00:07:39] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 113 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s1 0) (EQ s8 0) (EQ s11 0) (EQ s20 0)), p1:(OR (EQ s1 0) (EQ s5 0) (EQ s14 0) (EQ s17 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 38151 reset in 272 ms.
Product exploration explored 100000 steps with 38039 reset in 277 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (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 (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-05-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-09 finished in 821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||(p1&&G(p2)))))'
Support contains 9 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-26 00:07:39] [INFO ] Invariant cache hit.
[2024-05-26 00:07:39] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-26 00:07:39] [INFO ] Invariant cache hit.
[2024-05-26 00:07:39] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 104 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s4 0) (EQ s6 0) (EQ s16 0) (EQ s21 0)), p2:(OR (AND (EQ s3 1) (EQ s7 1) (EQ s14 1) (EQ s21 1)) (AND (EQ s4 1) (EQ s6 1) (EQ s16 1) (EQ s21 1)))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 5 reset in 1 ms.
FORMULA NQueens-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-10 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-26 00:07:40] [INFO ] Invariant cache hit.
[2024-05-26 00:07:40] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-26 00:07:40] [INFO ] Invariant cache hit.
[2024-05-26 00:07:40] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [10, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 130 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 25/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s5 1) (EQ s13 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-11 finished in 215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((!p0 U (p1||G(!p0))) U ((X(G(!p2))&&(!p0 U (p1||G(!p0))))||G((!p0 U (p1||G(!p0))))))&&p3))))'
Support contains 10 out of 27 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-26 00:07:40] [INFO ] Invariant cache hit.
[2024-05-26 00:07:40] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-26 00:07:40] [INFO ] Invariant cache hit.
[2024-05-26 00:07:40] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [10, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 90 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 25/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 41 ms :[(OR (NOT p3) (AND p0 (NOT p1)))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p3) (AND (NOT p0) p3)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0) (NOT p3)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s1 1) (EQ s5 1) (EQ s14 1) (EQ s18 1))) (NOT (AND (EQ s4 1) (EQ s5 1) (EQ s17 1) (EQ s21 1)))), p3:(OR (EQ s3 0) (EQ s6 0) (EQ s15 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 18741 reset in 243 ms.
Product exploration explored 100000 steps with 18772 reset in 255 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (F (G p1)), (F (G p3)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (OR (AND p1 p3) (AND (NOT p0) p3))), (X (NOT (OR (AND p1 p3) (AND (NOT p0) p3)))), (X (OR (AND (NOT p1) p0) (NOT p3))), (X (NOT (OR (AND (NOT p1) p0) (NOT p3)))), (X (X (OR (AND p1 p3) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND p1 p3) (AND (NOT p0) p3))))), (X (X (OR (AND (NOT p1) p0) (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) p0) (NOT p3)))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-05-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-12 finished in 790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-26 00:07:41] [INFO ] Invariant cache hit.
[2024-05-26 00:07:41] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-26 00:07:41] [INFO ] Invariant cache hit.
[2024-05-26 00:07:41] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 122 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s1 1) (EQ s9 1) (EQ s10 1) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-13 finished in 288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(!p0)) U p1)&&X(G(X(p2)))))'
Support contains 10 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-26 00:07:41] [INFO ] Invariant cache hit.
[2024-05-26 00:07:41] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-26 00:07:41] [INFO ] Invariant cache hit.
[2024-05-26 00:07:41] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [10, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 94 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 25/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) p0), (NOT p2), true, p0, (NOT p2)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s2 1) (EQ s9 1) (EQ s11 1) (EQ s23 1)), p0:(AND (EQ s2 1) (EQ s5 1) (EQ s15 1) (EQ s19 1)), p2:(OR (EQ s4 0) (EQ s5 0) (EQ s17 0) (EQ s21 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-14 finished in 307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-26 00:07:41] [INFO ] Invariant cache hit.
[2024-05-26 00:07:41] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-26 00:07:41] [INFO ] Invariant cache hit.
[2024-05-26 00:07:41] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 116 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s8 1) (EQ s12 1) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-15 finished in 213 ms.
All properties solved by simple procedures.
Total runtime 15560 ms.
BK_STOP 1716682063301
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NQueens-PT-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is NQueens-PT-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654372300213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-05.tgz
mv NQueens-PT-05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;