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

About the Execution of 2023-gold for ShieldRVt-PT-002B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
451.035 14054.00 23874.00 978.30 TFFTFTFFFTTTFFTF 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.r373-tall-171683789600567.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 ShieldRVt-PT-002B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789600567
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 21:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 21:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 21:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 24K 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 ShieldRVt-PT-002B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717012603208

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=ShieldRVt-PT-002B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 19:56:45] [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-29 19:56:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:56:45] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2024-05-29 19:56:45] [INFO ] Transformed 103 places.
[2024-05-29 19:56:45] [INFO ] Transformed 103 transitions.
[2024-05-29 19:56:45] [INFO ] Found NUPN structural information;
[2024-05-29 19:56:45] [INFO ] Parsed PT model containing 103 places and 103 transitions and 242 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-002B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 91 transition count 91
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 91 transition count 91
Applied a total of 24 rules in 20 ms. Remains 91 /103 variables (removed 12) and now considering 91/103 (removed 12) transitions.
// Phase 1: matrix 91 rows 91 cols
[2024-05-29 19:56:45] [INFO ] Computed 9 invariants in 11 ms
[2024-05-29 19:56:46] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-29 19:56:46] [INFO ] Invariant cache hit.
[2024-05-29 19:56:46] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-05-29 19:56:46] [INFO ] Invariant cache hit.
[2024-05-29 19:56:46] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/103 places, 91/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 91/103 places, 91/103 transitions.
Support contains 24 out of 91 places after structural reductions.
[2024-05-29 19:56:46] [INFO ] Flatten gal took : 27 ms
[2024-05-29 19:56:46] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:56:46] [INFO ] Input system was already deterministic with 91 transitions.
Finished random walk after 460 steps, including 1 resets, run visited all 12 properties in 55 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
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)&&X(G((p1&&(F(p1) U p2))))))'
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 86 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 86 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 85 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 85 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 84 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 84 transition count 84
Applied a total of 14 rules in 15 ms. Remains 84 /91 variables (removed 7) and now considering 84/91 (removed 7) transitions.
// Phase 1: matrix 84 rows 84 cols
[2024-05-29 19:56:46] [INFO ] Computed 9 invariants in 4 ms
[2024-05-29 19:56:46] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 19:56:46] [INFO ] Invariant cache hit.
[2024-05-29 19:56:47] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-29 19:56:47] [INFO ] Invariant cache hit.
[2024-05-29 19:56:47] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/91 places, 84/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 84/91 places, 84/91 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 382 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s20 0) (EQ s16 1)), p1:(OR (EQ s31 0) (EQ s49 1)), p2:(OR (EQ s47 0) (EQ s27 1))], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 124 steps with 0 reset in 8 ms.
FORMULA ShieldRVt-PT-002B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLCardinality-02 finished in 664 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(G(p0))) U (!p1||F(!p2))))'
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 84 transition count 84
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 84 transition count 84
Applied a total of 14 rules in 7 ms. Remains 84 /91 variables (removed 7) and now considering 84/91 (removed 7) transitions.
// Phase 1: matrix 84 rows 84 cols
[2024-05-29 19:56:47] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 19:56:47] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 19:56:47] [INFO ] Invariant cache hit.
[2024-05-29 19:56:47] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-29 19:56:47] [INFO ] Invariant cache hit.
[2024-05-29 19:56:47] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/91 places, 84/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 84/91 places, 84/91 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
Running random walk in product with property : ShieldRVt-PT-002B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s3 0) (EQ s20 1)), p2:(OR (EQ s74 0) (EQ s7 1)), p0:(OR (EQ s12 0) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4107 reset in 272 ms.
Product exploration explored 100000 steps with 4089 reset in 226 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 119 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
Finished random walk after 250 steps, including 0 resets, run visited all 4 properties in 11 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (AND p2 (NOT p0))), (F (NOT (AND p1 p2))), (F (NOT (AND p2 p0))), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 226 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
Stuttering acceptance computed with spot in 143 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
[2024-05-29 19:56:49] [INFO ] Invariant cache hit.
[2024-05-29 19:56:49] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-29 19:56:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 19:56:49] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-29 19:56:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:56:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-29 19:56:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 19:56:49] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-29 19:56:49] [INFO ] Computed and/alt/rep : 83/122/83 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-29 19:56:49] [INFO ] Added : 83 causal constraints over 18 iterations in 151 ms. Result :sat
Could not prove EG (AND p1 p2)
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-29 19:56:49] [INFO ] Invariant cache hit.
[2024-05-29 19:56:49] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 19:56:49] [INFO ] Invariant cache hit.
[2024-05-29 19:56:49] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-29 19:56:49] [INFO ] Invariant cache hit.
[2024-05-29 19:56:49] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 84/84 places, 84/84 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 112 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
Finished random walk after 166 steps, including 0 resets, run visited all 4 properties in 9 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (AND p2 (NOT p0))), (F (NOT (AND p1 p2))), (F (NOT (AND p2 p0))), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 229 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
Stuttering acceptance computed with spot in 157 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
[2024-05-29 19:56:50] [INFO ] Invariant cache hit.
[2024-05-29 19:56:50] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-29 19:56:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 19:56:50] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-29 19:56:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:56:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-29 19:56:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 19:56:50] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-29 19:56:50] [INFO ] Computed and/alt/rep : 83/122/83 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-29 19:56:50] [INFO ] Added : 83 causal constraints over 18 iterations in 131 ms. Result :sat
Could not prove EG (AND p1 p2)
Stuttering acceptance computed with spot in 177 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
Product exploration explored 100000 steps with 4114 reset in 163 ms.
Product exploration explored 100000 steps with 4084 reset in 143 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 223 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 84/84 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 84 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 84 transition count 83
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 22 place count 84 transition count 89
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 84 transition count 89
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 80 transition count 85
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 80 transition count 85
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 60 place count 80 transition count 85
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 74 place count 66 transition count 71
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 88 place count 66 transition count 71
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 66 transition count 111
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 60 transition count 99
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 60 transition count 99
Deduced a syphon composed of 33 places in 0 ms
Applied a total of 106 rules in 42 ms. Remains 60 /84 variables (removed 24) and now considering 99/84 (removed -15) transitions.
[2024-05-29 19:56:51] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 99 rows 60 cols
[2024-05-29 19:56:51] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 19:56:51] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/84 places, 99/84 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 60/84 places, 99/84 transitions.
Built C files in :
/tmp/ltsmin9706999518966024703
[2024-05-29 19:56:51] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9706999518966024703
Running compilation step : cd /tmp/ltsmin9706999518966024703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 284 ms.
Running link step : cd /tmp/ltsmin9706999518966024703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9706999518966024703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5222613901426266060.hoa' '--buchi-type=spotba'
LTSmin run took 819 ms.
FORMULA ShieldRVt-PT-002B-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-002B-LTLCardinality-04 finished in 5671 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((G(p1)||p0))))'
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 90 transition count 66
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 66 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 64 transition count 63
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 53 place count 64 transition count 53
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 73 place count 54 transition count 53
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 80 place count 47 transition count 46
Iterating global reduction 3 with 7 rules applied. Total rules applied 87 place count 47 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 87 place count 47 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 97 place count 42 transition count 41
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 125 place count 28 transition count 27
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 133 place count 24 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 22 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 21 transition count 28
Applied a total of 136 rules in 16 ms. Remains 21 /91 variables (removed 70) and now considering 28/91 (removed 63) transitions.
// Phase 1: matrix 28 rows 21 cols
[2024-05-29 19:56:53] [INFO ] Computed 8 invariants in 0 ms
[2024-05-29 19:56:53] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 19:56:53] [INFO ] Invariant cache hit.
[2024-05-29 19:56:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 19:56:53] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-29 19:56:53] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 19:56:53] [INFO ] Invariant cache hit.
[2024-05-29 19:56:53] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/91 places, 28/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 21/91 places, 28/91 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLCardinality-09 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:(OR (EQ s18 0) (EQ s1 1)), p0:(OR (EQ s20 0) (EQ s3 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 268 reset in 202 ms.
Product exploration explored 100000 steps with 262 reset in 179 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 19:56:54] [INFO ] Invariant cache hit.
[2024-05-29 19:56:54] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:56:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-29 19:56:54] [INFO ] After 30ms SMT Verify possible using all constraints in natural 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 (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-002B-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-002B-LTLCardinality-09 finished in 977 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(F(p0))))'
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 81 transition count 81
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 79 transition count 79
Applied a total of 24 rules in 10 ms. Remains 79 /91 variables (removed 12) and now considering 79/91 (removed 12) transitions.
// Phase 1: matrix 79 rows 79 cols
[2024-05-29 19:56:54] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 19:56:54] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 19:56:54] [INFO ] Invariant cache hit.
[2024-05-29 19:56:54] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-29 19:56:54] [INFO ] Invariant cache hit.
[2024-05-29 19:56:54] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/91 places, 79/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 79/91 places, 79/91 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s74 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 80 ms.
Product exploration explored 100000 steps with 33333 reset in 91 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-002B-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-002B-LTLCardinality-10 finished in 522 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(p1)||p0)))'
Support contains 7 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 83 transition count 83
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 83 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 82 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 81 transition count 81
Applied a total of 20 rules in 4 ms. Remains 81 /91 variables (removed 10) and now considering 81/91 (removed 10) transitions.
// Phase 1: matrix 81 rows 81 cols
[2024-05-29 19:56:54] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 19:56:54] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 19:56:54] [INFO ] Invariant cache hit.
[2024-05-29 19:56:54] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-29 19:56:54] [INFO ] Invariant cache hit.
[2024-05-29 19:56:54] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/91 places, 81/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 81/91 places, 81/91 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s35 0) (EQ s24 1) (EQ s5 1)), p0:(OR (EQ s27 0) (EQ s13 1) (AND (EQ s72 0) (EQ s16 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-002B-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-002B-LTLCardinality-11 finished in 493 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 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 90 transition count 66
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 66 transition count 63
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 64 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 63 transition count 62
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 55 place count 63 transition count 52
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 75 place count 53 transition count 52
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 82 place count 46 transition count 45
Iterating global reduction 4 with 7 rules applied. Total rules applied 89 place count 46 transition count 45
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 89 place count 46 transition count 40
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 99 place count 41 transition count 40
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 129 place count 26 transition count 25
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 139 place count 21 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 19 transition count 27
Applied a total of 141 rules in 25 ms. Remains 19 /91 variables (removed 72) and now considering 27/91 (removed 64) transitions.
// Phase 1: matrix 27 rows 19 cols
[2024-05-29 19:56:55] [INFO ] Computed 9 invariants in 0 ms
[2024-05-29 19:56:55] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 19:56:55] [INFO ] Invariant cache hit.
[2024-05-29 19:56:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 19:56:55] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-29 19:56:55] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 19:56:55] [INFO ] Invariant cache hit.
[2024-05-29 19:56:55] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/91 places, 27/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 19/91 places, 27/91 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLCardinality-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:(EQ s12 0)], 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 14 steps with 1 reset in 1 ms.
FORMULA ShieldRVt-PT-002B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLCardinality-13 finished in 277 ms.
All properties solved by simple procedures.
Total runtime 9827 ms.

BK_STOP 1717012617262

--------------------
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="ShieldRVt-PT-002B"
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 ShieldRVt-PT-002B, 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 r373-tall-171683789600567"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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