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

--------------------
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 1716683490871

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-30
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 00:31:32] [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:31:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:31:32] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-26 00:31:32] [INFO ] Transformed 1080 places.
[2024-05-26 00:31:32] [INFO ] Transformed 900 transitions.
[2024-05-26 00:31:32] [INFO ] Found NUPN structural information;
[2024-05-26 00:31:32] [INFO ] Parsed PT model containing 1080 places and 900 transitions and 4500 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 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 33 ms. Remains 178 /1078 variables (removed 900) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2024-05-26 00:31:32] [INFO ] Invariants computation overflowed in 184 ms
[2024-05-26 00:31:33] [INFO ] Implicit Places using invariants in 549 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2024-05-26 00:31:33] [INFO ] Invariants computation overflowed in 124 ms
[2024-05-26 00:33:55] [INFO ] Performed 117/178 implicitness test of which 1 returned IMPLICIT in 142 seconds.
[2024-05-26 00:34:13] [INFO ] Implicit Places using invariants and state equation in 160141 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 160721 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 177/1078 places, 900/900 transitions.
Applied a total of 0 rules in 13 ms. Remains 177 /177 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160768 ms. Remains : 177/1078 places, 900/900 transitions.
Support contains 88 out of 177 places after structural reductions.
[2024-05-26 00:34:13] [INFO ] Flatten gal took : 112 ms
[2024-05-26 00:34:13] [INFO ] Flatten gal took : 73 ms
[2024-05-26 00:34:13] [INFO ] Input system was already deterministic with 900 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 31 properties in 27 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 177 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 177 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G((p1&&X(p2))))))'
Support contains 8 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 900/900 transitions.
Applied a total of 0 rules in 23 ms. Remains 177 /177 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:34:14] [INFO ] Invariants computation overflowed in 75 ms
[2024-05-26 00:34:14] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:34:14] [INFO ] Invariants computation overflowed in 77 ms
[2024-05-26 00:36:54] [INFO ] Performed 116/177 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2024-05-26 00:36:54] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2024-05-26 00:36:54] [INFO ] Implicit Places using invariants and state equation in 160095 ms returned []
Implicit Place search using SMT with State Equation took 160420 ms to find 0 implicit places.
[2024-05-26 00:36:54] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:36:54] [INFO ] Invariants computation overflowed in 76 ms
[2024-05-26 00:36:55] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160866 ms. Remains : 177/177 places, 900/900 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 179 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s28 0) (EQ s41 0) (EQ s105 0) (EQ s157 0)), p0:(AND (EQ s20 1) (EQ s30 1) (EQ s108 1) (EQ s138 1)), p2:(OR (EQ s20 0) (EQ s30 0) (EQ s108 0) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3582 reset in 5220 ms.
Product exploration explored 100000 steps with 3583 reset in 5180 ms.
Computed a total of 177 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 177 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 (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) 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 (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) 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))))))]
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 173539 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 p1)&&G(X(F(p2)))))'
Support contains 8 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 900/900 transitions.
Applied a total of 0 rules in 11 ms. Remains 177 /177 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:37:07] [INFO ] Invariants computation overflowed in 77 ms
[2024-05-26 00:37:08] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:37:08] [INFO ] Invariants computation overflowed in 70 ms
[2024-05-26 00:39:48] [INFO ] Performed 116/177 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2024-05-26 00:39:48] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2024-05-26 00:39:48] [INFO ] Implicit Places using invariants and state equation in 160081 ms returned []
Implicit Place search using SMT with State Equation took 160406 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:39:48] [INFO ] Invariants computation overflowed in 67 ms
[2024-05-26 00:39:48] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160743 ms. Remains : 177/177 places, 900/900 transitions.
Stuttering acceptance computed with spot in 172 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 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s29 0) (EQ s51 0) (EQ s96 0) (EQ s168 0)), p1:(AND (EQ s29 1) (EQ s51 1) (EQ s96 1) (EQ s168 1)), p0:(AND (EQ s23 1) (EQ s31 1) (EQ s110 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 8884 reset in 8494 ms.
Product exploration explored 100000 steps with 8992 reset in 8560 ms.
Computed a total of 177 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 177 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), true, (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 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 179900 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(F(p1))||G(p2)||p0)))'
Support contains 15 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 900/900 transitions.
Applied a total of 0 rules in 9 ms. Remains 177 /177 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:40:07] [INFO ] Invariants computation overflowed in 68 ms
[2024-05-26 00:40:08] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:40:08] [INFO ] Invariants computation overflowed in 67 ms
[2024-05-26 00:40:44] [INFO ] Performed 60/177 implicitness test of which 0 returned IMPLICIT in 36 seconds.
[2024-05-26 00:42:48] [INFO ] Performed 116/177 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2024-05-26 00:42:48] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2024-05-26 00:42:48] [INFO ] Implicit Places using invariants and state equation in 160084 ms returned []
Implicit Place search using SMT with State Equation took 160397 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:42:48] [INFO ] Invariants computation overflowed in 76 ms
[2024-05-26 00:42:48] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160745 ms. Remains : 177/177 places, 900/900 transitions.
Stuttering acceptance computed with spot in 175 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (EQ s1 1) (EQ s32 1) (EQ s87 1) (EQ s121 1)) (AND (EQ s11 1) (EQ s53 1) (EQ s76 1) (EQ s152 1)) (AND (EQ s27 1) (EQ s34 1) (EQ s111 1) (EQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8913 ms.
Product exploration explored 100000 steps with 50000 reset in 8971 ms.
Computed a total of 177 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 177 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) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p2))), (X (X p2)), (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 20 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 180746 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))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 900/900 transitions.
Applied a total of 0 rules in 17 ms. Remains 177 /177 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:43:08] [INFO ] Invariants computation overflowed in 77 ms
[2024-05-26 00:43:08] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:43:08] [INFO ] Invariants computation overflowed in 66 ms
[2024-05-26 00:45:48] [INFO ] Performed 116/177 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2024-05-26 00:45:48] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2024-05-26 00:45:48] [INFO ] Implicit Places using invariants and state equation in 160081 ms returned []
Implicit Place search using SMT with State Equation took 160383 ms to find 0 implicit places.
[2024-05-26 00:45:48] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:45:48] [INFO ] Invariants computation overflowed in 71 ms
[2024-05-26 00:45:49] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160757 ms. Remains : 177/177 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 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s23 0) (EQ s34 0) (EQ s107 0) (EQ s145 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11649 reset in 9747 ms.
Product exploration explored 100000 steps with 11723 reset in 9774 ms.
Computed a total of 177 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 177 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 11 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 182220 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&&G(p1)))))'
Support contains 8 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 900/900 transitions.
Applied a total of 0 rules in 3 ms. Remains 177 /177 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:46:10] [INFO ] Invariants computation overflowed in 75 ms
[2024-05-26 00:46:10] [INFO ] Implicit Places using invariants in 303 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:46:11] [INFO ] Invariants computation overflowed in 69 ms
[2024-05-26 00:47:54] [INFO ] Performed 116/177 implicitness test of which 0 returned IMPLICIT in 103 seconds.
[2024-05-26 00:48:51] [INFO ] Performed 175/177 implicitness test of which 2 returned IMPLICIT in 159 seconds.
[2024-05-26 00:48:51] [INFO ] Implicit Places using invariants and state equation in 160087 ms returned [117, 118]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 160394 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 175/177 places, 900/900 transitions.
Applied a total of 0 rules in 6 ms. Remains 175 /175 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160405 ms. Remains : 175/177 places, 900/900 transitions.
Stuttering acceptance computed with spot in 107 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s15 1) (NEQ s56 1) (NEQ s77 1) (NEQ s157 1)), p1:(OR (NEQ s29 1) (NEQ s40 1) (NEQ s107 1) (NEQ s155 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3582 reset in 5091 ms.
Product exploration explored 100000 steps with 3586 reset in 5113 ms.
Computed a total of 175 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 175 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 (X (NOT p1))), (X (X 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)))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 73 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 172671 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(G(p0))||(F(p2)&&p1))))))'
Support contains 8 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 900/900 transitions.
Applied a total of 0 rules in 8 ms. Remains 177 /177 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:49:03] [INFO ] Invariants computation overflowed in 70 ms
[2024-05-26 00:49:03] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:49:03] [INFO ] Invariants computation overflowed in 66 ms
[2024-05-26 00:51:43] [INFO ] Performed 116/177 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2024-05-26 00:51:43] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2024-05-26 00:51:43] [INFO ] Implicit Places using invariants and state equation in 160079 ms returned []
Implicit Place search using SMT with State Equation took 160419 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:51:43] [INFO ] Invariants computation overflowed in 70 ms
[2024-05-26 00:51:44] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160758 ms. Remains : 177/177 places, 900/900 transitions.
Stuttering acceptance computed with spot in 219 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 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(AND (EQ s14 1) (EQ s33 1) (EQ s99 1) (EQ s135 1)), p2:(AND (EQ s10 1) (EQ s45 1) (EQ s83 1) (EQ s143 1)), p0:(OR (EQ s10 0) (EQ s45 0) (EQ s83 0) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6019 reset in 5919 ms.
Product exploration explored 100000 steps with 6049 reset in 5994 ms.
Computed a total of 177 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 177 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)), true, (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 5 factoid took 11 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 174830 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(p1)||F(p2)||p0))||G(p3)))'
Support contains 16 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 900/900 transitions.
Applied a total of 0 rules in 7 ms. Remains 177 /177 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:51:58] [INFO ] Invariants computation overflowed in 72 ms
[2024-05-26 00:51:58] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:51:58] [INFO ] Invariants computation overflowed in 66 ms
[2024-05-26 00:53:37] [INFO ] Performed 116/177 implicitness test of which 0 returned IMPLICIT in 98 seconds.
[2024-05-26 00:54:38] [INFO ] Performed 117/177 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2024-05-26 00:54:38] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2024-05-26 00:54:38] [INFO ] Implicit Places using invariants and state equation in 160076 ms returned []
Implicit Place search using SMT with State Equation took 160355 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:54:38] [INFO ] Invariants computation overflowed in 71 ms
[2024-05-26 00:54:38] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160686 ms. Remains : 177/177 places, 900/900 transitions.
Stuttering acceptance computed with spot in 285 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 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(AND (EQ s29 1) (EQ s46 1) (EQ s101 1) (EQ s163 1)), p0:(OR (EQ s13 0) (EQ s50 0) (EQ s81 0) (EQ s151 0)), p1:(AND (EQ s3 1) (EQ s35 1) (EQ s86 1) (EQ ...], 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, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 103 steps with 37 reset in 8 ms.
FORMULA NQueens-PT-30-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-09 finished in 161002 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))&&(F(p2)||(!p3 U (p4||G(!p3))))))'
Support contains 16 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 900/900 transitions.
Applied a total of 0 rules in 13 ms. Remains 177 /177 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:54:39] [INFO ] Invariants computation overflowed in 71 ms
[2024-05-26 00:54:39] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:54:39] [INFO ] Invariants computation overflowed in 66 ms
[2024-05-26 00:57:19] [INFO ] Performed 116/177 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2024-05-26 00:57:19] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2024-05-26 00:57:19] [INFO ] Implicit Places using invariants and state equation in 160080 ms returned []
Implicit Place search using SMT with State Equation took 160359 ms to find 0 implicit places.
[2024-05-26 00:57:19] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:57:19] [INFO ] Invariants computation overflowed in 72 ms
[2024-05-26 00:57:19] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160714 ms. Remains : 177/177 places, 900/900 transitions.
Stuttering acceptance computed with spot in 187 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 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p4) p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p4) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p4) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p4) (NOT p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s44 1) (EQ s82 1) (EQ s140 1)), p1:(AND (EQ s19 1) (EQ s37 1) (EQ s100 1) (EQ s144 1)), p2:(OR (EQ s1 0) (EQ s40 0) (EQ s79 0) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 11223 reset in 9470 ms.
Product exploration explored 100000 steps with 11200 reset in 9472 ms.
Computed a total of 177 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 177 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 (NOT p0)), (X p0), (X (AND (NOT p2) (NOT p4) p3)), (X (NOT (AND (NOT p2) (NOT p4) p3))), (X (NOT p2)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p4) p3))), (X (X (NOT (AND (NOT p2) (NOT p4) p3)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
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 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 182077 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' '!((p0 U G(!p1)))'
Support contains 8 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 900/900 transitions.
Applied a total of 0 rules in 12 ms. Remains 177 /177 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:57:41] [INFO ] Invariants computation overflowed in 74 ms
[2024-05-26 00:57:41] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 00:57:41] [INFO ] Invariants computation overflowed in 67 ms
[2024-05-26 00:58:14] [INFO ] Performed 60/177 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-26 00:59:33] [INFO ] Performed 116/177 implicitness test of which 0 returned IMPLICIT in 112 seconds.
[2024-05-26 01:00:21] [INFO ] Performed 118/177 implicitness test of which 2 returned IMPLICIT in 159 seconds.
[2024-05-26 01:00:21] [INFO ] Implicit Places using invariants and state equation in 160076 ms returned [117, 118]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 160369 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 175/177 places, 900/900 transitions.
Applied a total of 0 rules in 13 ms. Remains 175 /175 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 160394 ms. Remains : 175/177 places, 900/900 transitions.
Stuttering acceptance computed with spot in 76 ms :[p1, true, p1]
Running random walk in product with property : NQueens-PT-30-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s25 1) (EQ s49 1) (EQ s94 1) (EQ s160 1)) (AND (EQ s18 1) (EQ s44 1) (EQ s92 1) (EQ s148 1))), p0:(AND (EQ s18 1) (EQ s44 1) (EQ s92 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-30-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-11 finished in 160487 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)||X(G(p1)))))'
Support contains 8 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 900/900 transitions.
Applied a total of 0 rules in 3 ms. Remains 177 /177 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 01:00:21] [INFO ] Invariants computation overflowed in 72 ms
[2024-05-26 01:00:22] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 01:00:22] [INFO ] Invariants computation overflowed in 65 ms
[2024-05-26 01:03:02] [INFO ] Performed 116/177 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2024-05-26 01:03:02] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2024-05-26 01:03:02] [INFO ] Implicit Places using invariants and state equation in 160077 ms returned []
Implicit Place search using SMT with State Equation took 160386 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 01:03:02] [INFO ] Invariants computation overflowed in 70 ms
[2024-05-26 01:03:02] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160718 ms. Remains : 177/177 places, 900/900 transitions.
Stuttering acceptance computed with spot in 178 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (EQ s4 1) (EQ s58 1) (EQ s64 1) (EQ s150 1)), p0:(AND (EQ s14 1) (EQ s41 1) (EQ s91 1) (EQ s143 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 14 steps with 0 reset in 4 ms.
FORMULA NQueens-PT-30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-14 finished in 160915 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||(p1 U X(G(p2)))))))'
Support contains 7 out of 177 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 : 177/177 places, 900/900 transitions.
Applied a total of 0 rules in 7 ms. Remains 177 /177 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 01:03:02] [INFO ] Invariants computation overflowed in 81 ms
[2024-05-26 01:03:02] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 01:03:03] [INFO ] Invariants computation overflowed in 66 ms
[2024-05-26 01:05:43] [INFO ] Performed 116/177 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2024-05-26 01:05:43] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2024-05-26 01:05:43] [INFO ] Implicit Places using invariants and state equation in 160080 ms returned []
Implicit Place search using SMT with State Equation took 160372 ms to find 0 implicit places.
[2024-05-26 01:05:43] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2024-05-26 01:05:43] [INFO ] Invariants computation overflowed in 68 ms
[2024-05-26 01:05:43] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160713 ms. Remains : 177/177 places, 900/900 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NQueens-PT-30-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s39 1) (EQ s100 1) (EQ s148 1)), p2:(AND (EQ s21 1) (EQ s57 1) (EQ s82 1) (EQ s166 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 27 steps with 0 reset in 4 ms.
FORMULA NQueens-PT-30-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-15 finished in 160805 ms.
All properties solved by simple procedures.
Total runtime 2051139 ms.

BK_STOP 1716685544946

--------------------
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-30"
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-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 r263-tall-171654372400248"
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 ;