Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r240-smll-165303241700348.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Solitaire-PT-EngCT7x7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241700348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 8.5K Apr 30 11:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 11:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 11:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 11:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 09:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 09:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 09:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 77K May 10 09:34 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 Solitaire-PT-EngCT7x7-LTLFireability-00
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-01
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-02
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-03
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-04
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-05
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-06
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-07
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-08
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-09
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-10
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-11
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-12
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-13
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-14
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653117528781

Running Version 202205111006
[2022-05-21 07:18:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 07:18:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:18:51] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2022-05-21 07:18:51] [INFO ] Transformed 67 places.
[2022-05-21 07:18:51] [INFO ] Transformed 76 transitions.
[2022-05-21 07:18:51] [INFO ] Parsed PT model containing 67 places and 76 transitions in 426 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 122 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 28 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:52] [INFO ] Computed 34 place invariants in 35 ms
[2022-05-21 07:18:52] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:52] [INFO ] Computed 34 place invariants in 7 ms
[2022-05-21 07:18:52] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:52] [INFO ] Computed 34 place invariants in 8 ms
[2022-05-21 07:18:53] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 76/76 transitions.
Support contains 42 out of 67 places after structural reductions.
[2022-05-21 07:18:53] [INFO ] Flatten gal took : 54 ms
[2022-05-21 07:18:53] [INFO ] Flatten gal took : 30 ms
[2022-05-21 07:18:53] [INFO ] Input system was already deterministic with 76 transitions.
Finished random walk after 289 steps, including 11 resets, run visited all 26 properties in 99 ms. (steps per millisecond=2 )
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 67 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 76
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(X((G(!p0) U p1)))))'
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:54] [INFO ] Computed 34 place invariants in 4 ms
[2022-05-21 07:18:54] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:54] [INFO ] Computed 34 place invariants in 3 ms
[2022-05-21 07:18:54] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:54] [INFO ] Computed 34 place invariants in 3 ms
[2022-05-21 07:18:54] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 432 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s18 1) (GEQ s23 1) (GEQ s33 1) (GEQ s66 1)), p0:(OR (LT s17 1) (LT s31 1) (LT s57 1) (LT s66 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 25 steps with 0 reset in 3 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-00 finished in 1002 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||p1)))'
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 15 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:55] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-21 07:18:55] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:55] [INFO ] Computed 34 place invariants in 6 ms
[2022-05-21 07:18:55] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2022-05-21 07:18:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:55] [INFO ] Computed 34 place invariants in 8 ms
[2022-05-21 07:18:55] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(AND (GEQ s28 1) (GEQ s34 1) (GEQ s64 1) (GEQ s66 1)), p1:(AND (GEQ s37 1) (GEQ s43 1) (GEQ s50 1) (GEQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-02 finished in 575 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p1)&&p0))||G(F((F(p3)||p2)))))'
Support contains 10 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 6 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:55] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-21 07:18:55] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:55] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-21 07:18:55] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2022-05-21 07:18:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:56] [INFO ] Computed 34 place invariants in 3 ms
[2022-05-21 07:18:56] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p1) (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s29 1) (GEQ s52 1) (GEQ s66 1)), p1:(AND (GEQ s14 1) (GEQ s17 1) (GEQ s30 1) (GEQ s66 1)), p3:(AND (GEQ s4 1) (GEQ s6 1) (GEQ s36 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 5314 reset in 978 ms.
Product exploration explored 100000 steps with 5297 reset in 606 ms.
Computed a total of 67 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 76
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) (NOT p3) p2), (X (NOT p1)), (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) p0 p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p1) (NOT p2)))))), (X (X (AND (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 15 factoid took 539 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-03 finished in 2881 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X(F(G(p0)))))))'
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 6 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:58] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-21 07:18:58] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:58] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-21 07:18:58] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2022-05-21 07:18:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:58] [INFO ] Computed 34 place invariants in 3 ms
[2022-05-21 07:18:58] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s29 1) (GEQ s35 1) (GEQ s66 1)) (AND (GEQ s18 1) (GEQ s31 1) (GEQ s34 1) (GEQ s66 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-04 finished in 398 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 9 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:58] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-21 07:18:59] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:59] [INFO ] Computed 34 place invariants in 5 ms
[2022-05-21 07:18:59] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2022-05-21 07:18:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:59] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-21 07:18:59] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s28 1) (GEQ s34 1) (GEQ s64 1) (GEQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-05 finished in 412 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((F(p1)&&p2))))'
Support contains 10 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:59] [INFO ] Computed 34 place invariants in 5 ms
[2022-05-21 07:18:59] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:59] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-21 07:18:59] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:18:59] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-21 07:18:59] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s28 1) (GEQ s34 1) (GEQ s64 1) (GEQ s66 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s14 1) (GEQ s66 1))), p2:(OR (AND (GEQ s19 1) (GEQ s26 1) (G...], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-07 finished in 760 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(F(p0)))||p1))))'
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 9 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:19:00] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-21 07:19:00] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:19:00] [INFO ] Computed 34 place invariants in 3 ms
[2022-05-21 07:19:00] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2022-05-21 07:19:00] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:19:00] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-21 07:19:00] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s57 1) (GEQ s60 1) (GEQ s64 1) (GEQ s66 1)), p0:(OR (LT s15 1) (LT s17 1) (LT s31 1) (LT s66 1))], 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 5614 reset in 651 ms.
Product exploration explored 100000 steps with 5663 reset in 418 ms.
Computed a total of 67 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 76
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), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 6 factoid took 276 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-08 finished in 2171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!((p0 U p1) U p2) U G((F(G(p4))&&p3))))'
Support contains 11 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 8 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:19:02] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-21 07:19:02] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:19:02] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-21 07:19:02] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2022-05-21 07:19:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:19:02] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-21 07:19:02] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p4) (NOT p3)), true, (AND p2 p3), (NOT p4), (OR (NOT p4) (NOT p3)), (AND p1 p2 p3), p1]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p4)), acceptance={} source=0 dest: 3}, { cond=(AND p3 p2), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p3 p2), acceptance={} source=2 dest: 1}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=p4, acceptance={} source=3 dest: 3}, { cond=(NOT p4), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p4)), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND p3 p1 p2), acceptance={} source=5 dest: 1}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s34 1) (GEQ s59 1) (GEQ s64 1) (GEQ s66 1)), p2:(AND (GEQ s17 1) (GEQ s31 1) (GEQ s57 1) (GEQ s66 1)), p1:(AND (GEQ s34 1) (GEQ s59 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-09 finished in 833 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(X(!(X(F(p0))||p1)))&&!(p2 U p3))))'
Support contains 13 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:19:03] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-21 07:19:03] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:19:03] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-21 07:19:03] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:19:03] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-21 07:19:03] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 1326 ms :[(OR p3 p0 p1), true, p3, (OR p0 p1), (OR p1 p0), p3, (OR p0 p1), p0, (OR p0 p1), (OR p1 p0), (OR p0 p1), (OR (AND p1 p3) (AND p0 p3)), (OR (AND p1 p3) (AND p0 p3)), p0, p0, p0, p0, (AND p0 p3), (AND p0 p3), p0, p0, p0, (AND p0 p3), (AND p0 p3)]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p3 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 4}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p3) p0), acceptance={0} source=4 dest: 9}, { cond=(AND p3 p0), acceptance={0} source=4 dest: 10}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 11}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=4 dest: 12}], [{ cond=(AND p3 p0), acceptance={0} source=5 dest: 0}, { cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 1}, { cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 1}, { cond=(NOT p0), acceptance={} source=7 dest: 7}], [{ cond=p1, acceptance={} source=8 dest: 6}, { cond=(NOT p1), acceptance={} source=8 dest: 13}], [{ cond=(AND p3 (NOT p0) p1), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=9 dest: 9}, { cond=(AND p3 p0 p1), acceptance={0} source=9 dest: 10}, { cond=(AND p2 (NOT p3) (NOT p0) p1), acceptance={} source=9 dest: 11}, { cond=(AND p2 (NOT p3) p0 p1), acceptance={} source=9 dest: 12}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=9 dest: 13}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 14}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=9 dest: 15}, { cond=(AND p3 p0 (NOT p1)), acceptance={0} source=9 dest: 16}, { cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 17}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=9 dest: 18}], [{ cond=(AND p3 p0 p1), acceptance={0} source=10 dest: 0}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=10 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0) p1), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=10 dest: 4}, { cond=(AND p2 (NOT p3) p0 p1), acceptance={} source=10 dest: 5}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 19}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=10 dest: 20}, { cond=(AND p3 p0 (NOT p1)), acceptance={0} source=10 dest: 21}, { cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 22}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=10 dest: 23}], [{ cond=(AND p3 p1), acceptance={} source=11 dest: 1}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=11 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={} source=11 dest: 7}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=11 dest: 22}], [{ cond=(AND p3 p0 p1), acceptance={0} source=12 dest: 0}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=12 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0) p1), acceptance={} source=12 dest: 2}, { cond=(AND p2 (NOT p3) p0 p1), acceptance={} source=12 dest: 5}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=12 dest: 7}, { cond=(AND p3 p0 (NOT p1)), acceptance={0} source=12 dest: 21}, { cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=12 dest: 22}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=12 dest: 23}], [{ cond=(AND p0 p1), acceptance={} source=13 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=13 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=14 dest: 6}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=14 dest: 13}], [{ cond=(AND (NOT p3) p0 p1), acceptance={0} source=15 dest: 9}, { cond=(AND p3 p0 p1), acceptance={0} source=15 dest: 10}, { cond=(AND p2 (NOT p3) p0 p1), acceptance={} source=15 dest: 12}, { cond=(AND p3 (NOT p0)), acceptance={} source=15 dest: 13}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=15 dest: 14}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=15 dest: 15}, { cond=(AND p3 p0 (NOT p1)), acceptance={0} source=15 dest: 16}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=15 dest: 17}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=15 dest: 18}], [{ cond=(AND p3 p0 p1), acceptance={0} source=16 dest: 0}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=16 dest: 4}, { cond=(AND p2 (NOT p3) p0 p1), acceptance={} source=16 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=16 dest: 7}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=16 dest: 19}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=16 dest: 20}, { cond=(AND p3 p0 (NOT p1)), acceptance={0} source=16 dest: 21}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=16 dest: 22}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=16 dest: 23}], [{ cond=(AND p3 p0 p1), acceptance={} source=17 dest: 1}, { cond=(AND p2 (NOT p3) p0 p1), acceptance={} source=17 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p1))), acceptance={} source=17 dest: 7}, { cond=(OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p1))), acceptance={} source=17 dest: 22}], [{ cond=(AND p3 p0 p1), acceptance={0} source=18 dest: 0}, { cond=(AND p2 (NOT p3) p0 p1), acceptance={} source=18 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=18 dest: 7}, { cond=(AND p3 p0 (NOT p1)), acceptance={0} source=18 dest: 21}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=18 dest: 22}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=18 dest: 23}], [{ cond=p0, acceptance={} source=19 dest: 6}, { cond=(NOT p0), acceptance={} source=19 dest: 13}], [{ cond=(AND (NOT p3) p0), acceptance={0} source=20 dest: 9}, { cond=(AND p3 p0), acceptance={0} source=20 dest: 10}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=20 dest: 12}, { cond=(AND p3 (NOT p0)), acceptance={} source=20 dest: 13}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=20 dest: 14}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=20 dest: 17}], [{ cond=(AND p3 p0), acceptance={0} source=21 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={0} source=21 dest: 4}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=21 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=21 dest: 7}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=21 dest: 19}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=21 dest: 22}], [{ cond=(AND p3 p0), acceptance={} source=22 dest: 1}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=22 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=22 dest: 7}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=22 dest: 22}], [{ cond=(AND p3 p0), acceptance={0} source=23 dest: 0}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=23 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=23 dest: 7}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=23 dest: 22}]], initial=0, aps=[p3:(AND (GEQ s31 1) (GEQ s34 1) (GEQ s44 1) (GEQ s66 1)), p0:(AND (GEQ s7 1) (GEQ s10 1) (GEQ s53 1) (GEQ s66 1)), p2:(AND (GEQ s38 1) (GEQ s41 1) (GEQ s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 63 steps with 2 reset in 1 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-10 finished in 1889 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 9 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:19:05] [INFO ] Computed 34 place invariants in 4 ms
[2022-05-21 07:19:05] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:19:05] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-21 07:19:05] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2022-05-21 07:19:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:19:05] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-21 07:19:05] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s23 1) (GEQ s33 1) (GEQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-13 finished in 669 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (((X(!p1) U p1) U G(p1)) U X(p2))))'
Support contains 12 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:19:05] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-21 07:19:05] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:19:05] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-21 07:19:06] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 67 cols
[2022-05-21 07:19:06] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-21 07:19:06] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s39 1) (GEQ s46 1) (GEQ s66 1)), p0:(AND (GEQ s7 1) (GEQ s10 1) (GEQ s53 1) (GEQ s66 1)), p2:(AND (GEQ s4 1) (GEQ s9 1) (GEQ s47 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-14 finished in 790 ms.
All properties solved by simple procedures.
Total runtime 15082 ms.

BK_STOP 1653117546949

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Solitaire-PT-EngCT7x7"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Solitaire-PT-EngCT7x7, 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 r240-smll-165303241700348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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