fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r417-tall-171690555600022
Last Updated
July 7, 2024

About the Execution of 2023-gold for Solitaire-PT-SqrCT5x5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
359.159 15151.00 23921.00 438.80 FFFTTFFFFFFFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r417-tall-171690555600022.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 Solitaire-PT-SqrCT5x5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690555600022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K 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.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 12 14:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 12 14:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 76K 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 Solitaire-PT-SqrCT5x5-LTLCardinality-00
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-01
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-02
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-03
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-04
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-05
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-06
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-07
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-08
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-09
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-10
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-11
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-12
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-13
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-14
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717106597250

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Solitaire-PT-SqrCT5x5
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-30 22:03:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 22:03:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 22:03:18] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2024-05-30 22:03:18] [INFO ] Transformed 51 places.
[2024-05-30 22:03:18] [INFO ] Transformed 84 transitions.
[2024-05-30 22:03:19] [INFO ] Parsed PT model containing 51 places and 84 transitions and 540 arcs in 339 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 12 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2024-05-30 22:03:19] [INFO ] Computed 25 invariants in 7 ms
[2024-05-30 22:03:19] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-30 22:03:19] [INFO ] Invariant cache hit.
[2024-05-30 22:03:19] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-30 22:03:19] [INFO ] Invariant cache hit.
[2024-05-30 22:03:19] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 51/51 places, 84/84 transitions.
Support contains 30 out of 51 places after structural reductions.
[2024-05-30 22:03:19] [INFO ] Flatten gal took : 34 ms
[2024-05-30 22:03:19] [INFO ] Flatten gal took : 29 ms
[2024-05-30 22:03:19] [INFO ] Input system was already deterministic with 84 transitions.
Support contains 28 out of 51 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 465 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 22) seen :16
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-30 22:03:20] [INFO ] Invariant cache hit.
[2024-05-30 22:03:20] [INFO ] [Real]Absence check using 25 positive place invariants in 4 ms returned sat
[2024-05-30 22:03:20] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2024-05-30 22:03:20] [INFO ] [Nat]Absence check using 25 positive place invariants in 10 ms returned sat
[2024-05-30 22:03:20] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(((X(X(p0))&&G(!p1))||G(p0)))))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 8 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:20] [INFO ] Invariant cache hit.
[2024-05-30 22:03:21] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 22:03:21] [INFO ] Invariant cache hit.
[2024-05-30 22:03:21] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-30 22:03:21] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 22:03:21] [INFO ] Invariant cache hit.
[2024-05-30 22:03:21] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 51/51 places, 84/84 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 445 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 6}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=4 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=5 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=6 dest: 3}]], initial=0, aps=[p1:(AND (LEQ 1 s36) (LEQ 2 s50) (LEQ s30 s45)), p0:(LEQ s30 s45)], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 6643 reset in 541 ms.
Product exploration explored 100000 steps with 6567 reset in 430 ms.
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
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 p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 5 factoid took 643 ms. Reduced automaton from 7 states, 27 edges and 2 AP (stutter insensitive) to 9 states, 36 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 443 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (NOT p0), false, (AND (NOT p1) (NOT p0)), false]
Incomplete random walk after 10000 steps, including 458 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-30 22:03:23] [INFO ] Invariant cache hit.
[2024-05-30 22:03:23] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 914 ms. Reduced automaton from 9 states, 36 edges and 2 AP (stutter insensitive) to 9 states, 36 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 420 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (NOT p0), false, (AND (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 516 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (NOT p0), false, (AND (NOT p1) (NOT p0)), false]
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 11 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:25] [INFO ] Invariant cache hit.
[2024-05-30 22:03:25] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-30 22:03:25] [INFO ] Invariant cache hit.
[2024-05-30 22:03:26] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-30 22:03:26] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 22:03:26] [INFO ] Invariant cache hit.
[2024-05-30 22:03:26] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 265 ms. Remains : 51/51 places, 84/84 transitions.
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
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 p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 5 factoid took 591 ms. Reduced automaton from 9 states, 36 edges and 2 AP (stutter insensitive) to 9 states, 36 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 380 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (NOT p0), false, (AND (NOT p1) (NOT p0)), false]
Incomplete random walk after 10000 steps, including 459 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-30 22:03:27] [INFO ] Invariant cache hit.
[2024-05-30 22:03:27] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 886 ms. Reduced automaton from 9 states, 36 edges and 2 AP (stutter insensitive) to 9 states, 36 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 389 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (NOT p0), false, (AND (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 368 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (NOT p0), false, (AND (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 404 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (NOT p0), false, (AND (NOT p1) (NOT p0)), false]
Stuttering criterion allowed to conclude after 28101 steps with 1790 reset in 124 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLCardinality-00 finished in 8529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 11 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:29] [INFO ] Invariant cache hit.
[2024-05-30 22:03:29] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-30 22:03:29] [INFO ] Invariant cache hit.
[2024-05-30 22:03:29] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-30 22:03:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 22:03:29] [INFO ] Invariant cache hit.
[2024-05-30 22:03:29] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s26)], 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 24 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLCardinality-01 finished in 299 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)))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:29] [INFO ] Invariant cache hit.
[2024-05-30 22:03:29] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 22:03:29] [INFO ] Invariant cache hit.
[2024-05-30 22:03:29] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-30 22:03:29] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 22:03:29] [INFO ] Invariant cache hit.
[2024-05-30 22:03:29] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 230 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLCardinality-09 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:(LEQ s46 s17)], 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 4793 steps with 301 reset in 21 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLCardinality-09 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 7 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:30] [INFO ] Invariant cache hit.
[2024-05-30 22:03:30] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 22:03:30] [INFO ] Invariant cache hit.
[2024-05-30 22:03:30] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-30 22:03:30] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 22:03:30] [INFO ] Invariant cache hit.
[2024-05-30 22:03:30] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s24 s42)], 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 42 steps with 1 reset in 1 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLCardinality-10 finished in 277 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)||(p1 U X(p2))))'
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:30] [INFO ] Invariant cache hit.
[2024-05-30 22:03:30] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 22:03:30] [INFO ] Invariant cache hit.
[2024-05-30 22:03:30] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-30 22:03:30] [INFO ] Invariant cache hit.
[2024-05-30 22:03:30] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(GT s45 s0), p1:(LEQ s8 s3), p2:(GT s42 s15)], 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 1313 steps with 110 reset in 10 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLCardinality-13 finished in 354 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)))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:30] [INFO ] Invariant cache hit.
[2024-05-30 22:03:30] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 22:03:30] [INFO ] Invariant cache hit.
[2024-05-30 22:03:30] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-30 22:03:30] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 22:03:30] [INFO ] Invariant cache hit.
[2024-05-30 22:03:31] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLCardinality-14 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:(GT s6 s34)], 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 123 steps with 11 reset in 1 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLCardinality-14 finished in 398 ms.
All properties solved by simple procedures.
Total runtime 12441 ms.

BK_STOP 1717106612401

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="Solitaire-PT-SqrCT5x5"
export BK_EXAMINATION="LTLCardinality"
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 Solitaire-PT-SqrCT5x5, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690555600022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Solitaire-PT-SqrCT5x5.tgz
mv Solitaire-PT-SqrCT5x5 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;