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-171683789300448.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 ShieldRVs-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789300448
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 17:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 17:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 17:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 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 13K 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 ShieldRVs-PT-001B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716993526346

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-001B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 14:38:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 14:38:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:38:48] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2024-05-29 14:38:48] [INFO ] Transformed 43 places.
[2024-05-29 14:38:48] [INFO ] Transformed 48 transitions.
[2024-05-29 14:38:48] [INFO ] Found NUPN structural information;
[2024-05-29 14:38:48] [INFO ] Parsed PT model containing 43 places and 48 transitions and 144 arcs in 100 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Support contains 24 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 41 transition count 46
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 41 transition count 46
Applied a total of 4 rules in 12 ms. Remains 41 /43 variables (removed 2) and now considering 46/48 (removed 2) transitions.
// Phase 1: matrix 46 rows 41 cols
[2024-05-29 14:38:48] [INFO ] Computed 5 invariants in 11 ms
[2024-05-29 14:38:48] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-29 14:38:48] [INFO ] Invariant cache hit.
[2024-05-29 14:38:48] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-29 14:38:48] [INFO ] Invariant cache hit.
[2024-05-29 14:38:48] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/43 places, 46/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 41/43 places, 46/48 transitions.
Support contains 24 out of 41 places after structural reductions.
[2024-05-29 14:38:49] [INFO ] Flatten gal took : 20 ms
[2024-05-29 14:38:49] [INFO ] Flatten gal took : 7 ms
[2024-05-29 14:38:49] [INFO ] Input system was already deterministic with 46 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 29) seen :26
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 14:38:49] [INFO ] Invariant cache hit.
[2024-05-29 14:38:49] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-29 14:38:49] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2024-05-29 14:38:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2024-05-29 14:38:50] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-29 14:38:50] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 6 ms to minimize.
[2024-05-29 14:38:50] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 14:38:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 80 ms
[2024-05-29 14:38:50] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :0
[2024-05-29 14:38:50] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-001B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 11 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))'
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 40 transition count 40
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 35 transition count 40
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 35 transition count 35
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 30 transition count 35
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 25 transition count 30
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 25 transition count 30
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 30 place count 25 transition count 28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 23 transition count 28
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 18 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 17 transition count 22
Applied a total of 45 rules in 15 ms. Remains 17 /41 variables (removed 24) and now considering 22/46 (removed 24) transitions.
// Phase 1: matrix 22 rows 17 cols
[2024-05-29 14:38:50] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 14:38:50] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 14:38:50] [INFO ] Invariant cache hit.
[2024-05-29 14:38:50] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-29 14:38:50] [INFO ] Redundant transitions in 18 ms returned [21]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 21 rows 17 cols
[2024-05-29 14:38:50] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 14:38:50] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/41 places, 21/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 153 ms. Remains : 17/41 places, 21/46 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 171 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/17 stabilizing places and 2/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-001B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-001B-LTLFireability-00 finished in 822 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 U p1) U p2)||((p4||G(p1))&&p3))))'
Support contains 5 out of 41 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 41 transition count 43
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 38 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 37 transition count 42
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 37 transition count 37
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 18 place count 32 transition count 37
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 23 place count 27 transition count 32
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 27 transition count 32
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 42 place count 20 transition count 25
Applied a total of 42 rules in 10 ms. Remains 20 /41 variables (removed 21) and now considering 25/46 (removed 21) transitions.
// Phase 1: matrix 25 rows 20 cols
[2024-05-29 14:38:51] [INFO ] Computed 5 invariants in 0 ms
[2024-05-29 14:38:51] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 14:38:51] [INFO ] Invariant cache hit.
[2024-05-29 14:38:51] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-29 14:38:51] [INFO ] Redundant transitions in 14 ms returned [24]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 24 rows 20 cols
[2024-05-29 14:38:51] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 14:38:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/41 places, 24/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 114 ms. Remains : 20/41 places, 24/46 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4)))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p3 (NOT p4) p1), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p4) (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p4) p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s18 1), p3:(AND (EQ s14 1) (EQ s19 1)), p4:(AND (EQ s2 1) (EQ s7 1) (EQ s18 1)), p1:(AND (EQ s14 1) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14631 reset in 136 ms.
Product exploration explored 100000 steps with 14629 reset in 103 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 (NOT p2) (NOT p3) (NOT p4) (NOT p1)), (X (OR (AND (NOT p2) (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p4) (NOT p1)))), (X (NOT (AND (NOT p2) p3 (NOT p4) p1))), (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4) (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p4) p1)))), (X (X (OR (AND (NOT p2) (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p4) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p4) p1)))), (X (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p4) p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Finished random walk after 5 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p4) (NOT p1)), (X (OR (AND (NOT p2) (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p4) (NOT p1)))), (X (NOT (AND (NOT p2) p3 (NOT p4) p1))), (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4) (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p4) p1)))), (X (X (OR (AND (NOT p2) (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p4) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p4) p1)))), (X (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p4) p1)))))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4)))), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))))), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))))), (F (AND p1 (NOT p2) p3 (NOT p4)))]
Knowledge based reduction with 9 factoid took 209 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)))]
[2024-05-29 14:38:52] [INFO ] Invariant cache hit.
[2024-05-29 14:38:52] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-29 14:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:38:52] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-29 14:38:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:38:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-29 14:38:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:38:52] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-29 14:38:52] [INFO ] Computed and/alt/rep : 21/64/21 causal constraints (skipped 2 transitions) in 3 ms.
[2024-05-29 14:38:52] [INFO ] Added : 20 causal constraints over 5 iterations in 23 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2) (NOT p4))
[2024-05-29 14:38:52] [INFO ] Invariant cache hit.
[2024-05-29 14:38:52] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-29 14:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:38:52] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-29 14:38:52] [INFO ] Computed and/alt/rep : 21/64/21 causal constraints (skipped 2 transitions) in 2 ms.
[2024-05-29 14:38:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:38:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-29 14:38:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:38:52] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-29 14:38:52] [INFO ] Computed and/alt/rep : 21/64/21 causal constraints (skipped 2 transitions) in 1 ms.
[2024-05-29 14:38:52] [INFO ] Added : 13 causal constraints over 3 iterations in 15 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 5 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 24/24 transitions.
Applied a total of 0 rules in 5 ms. Remains 20 /20 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-05-29 14:38:52] [INFO ] Invariant cache hit.
[2024-05-29 14:38:52] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 14:38:52] [INFO ] Invariant cache hit.
[2024-05-29 14:38:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-29 14:38:52] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-29 14:38:52] [INFO ] Invariant cache hit.
[2024-05-29 14:38:52] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 20/20 places, 24/24 transitions.
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 (NOT p1) (NOT p2) (NOT p4) (NOT p3)), (X (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4))))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Finished random walk after 4 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p4) (NOT p3)), (X (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4))))))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p2) (NOT p3)))), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))))), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))))), (F (AND p1 (NOT p2) (NOT p4) p3))]
Knowledge based reduction with 9 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)))]
[2024-05-29 14:38:53] [INFO ] Invariant cache hit.
[2024-05-29 14:38:53] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-29 14:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:38:53] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-29 14:38:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:38:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-29 14:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:38:53] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-29 14:38:53] [INFO ] Computed and/alt/rep : 21/64/21 causal constraints (skipped 2 transitions) in 2 ms.
[2024-05-29 14:38:53] [INFO ] Added : 20 causal constraints over 5 iterations in 19 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2) (NOT p4))
[2024-05-29 14:38:53] [INFO ] Invariant cache hit.
[2024-05-29 14:38:53] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-29 14:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:38:53] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-29 14:38:53] [INFO ] Computed and/alt/rep : 21/64/21 causal constraints (skipped 2 transitions) in 2 ms.
[2024-05-29 14:38:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:38:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-29 14:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:38:53] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-29 14:38:53] [INFO ] Computed and/alt/rep : 21/64/21 causal constraints (skipped 2 transitions) in 2 ms.
[2024-05-29 14:38:53] [INFO ] Added : 13 causal constraints over 3 iterations in 14 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 93 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 14647 reset in 118 ms.
Product exploration explored 100000 steps with 14633 reset in 102 ms.
Built C files in :
/tmp/ltsmin13726856051858315700
[2024-05-29 14:38:53] [INFO ] Computing symmetric may disable matrix : 24 transitions.
[2024-05-29 14:38:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:38:53] [INFO ] Computing symmetric may enable matrix : 24 transitions.
[2024-05-29 14:38:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:38:53] [INFO ] Computing Do-Not-Accords matrix : 24 transitions.
[2024-05-29 14:38:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:38:53] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13726856051858315700
Running compilation step : cd /tmp/ltsmin13726856051858315700;'/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 237 ms.
Running link step : cd /tmp/ltsmin13726856051858315700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin13726856051858315700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2959460771123532166.hoa' '--buchi-type=spotba'
LTSmin run took 86 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-001B-LTLFireability-02 finished in 3037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((!p0 U p1))))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 37 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 37 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 36 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 36 transition count 41
Applied a total of 10 rules in 7 ms. Remains 36 /41 variables (removed 5) and now considering 41/46 (removed 5) transitions.
// Phase 1: matrix 41 rows 36 cols
[2024-05-29 14:38:54] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 14:38:54] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 14:38:54] [INFO ] Invariant cache hit.
[2024-05-29 14:38:54] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-29 14:38:54] [INFO ] Invariant cache hit.
[2024-05-29 14:38:54] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/41 places, 41/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 36/41 places, 41/46 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s26 1), p0:(AND (EQ s22 1) (EQ s34 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 169 steps with 8 reset in 1 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-03 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G(p2)))'
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 41 transition count 42
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 37 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 36 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 10 place count 36 transition count 36
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 20 place count 31 transition count 36
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 25 place count 26 transition count 31
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 26 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 30 place count 26 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 25 transition count 30
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 46 place count 18 transition count 23
Applied a total of 46 rules in 15 ms. Remains 18 /41 variables (removed 23) and now considering 23/46 (removed 23) transitions.
// Phase 1: matrix 23 rows 18 cols
[2024-05-29 14:38:54] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 14:38:54] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 14:38:54] [INFO ] Invariant cache hit.
[2024-05-29 14:38:54] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-29 14:38:54] [INFO ] Redundant transitions in 14 ms returned [22]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 22 rows 18 cols
[2024-05-29 14:38:54] [INFO ] Computed 5 invariants in 0 ms
[2024-05-29 14:38:54] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/41 places, 22/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 146 ms. Remains : 18/41 places, 22/46 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(EQ s13 1), p0:(AND (EQ s7 1) (EQ s9 1) (EQ s13 1)), p2:(EQ s3 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-04 finished in 293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 36 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 35 transition count 40
Applied a total of 12 rules in 6 ms. Remains 35 /41 variables (removed 6) and now considering 40/46 (removed 6) transitions.
// Phase 1: matrix 40 rows 35 cols
[2024-05-29 14:38:55] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 14:38:55] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 14:38:55] [INFO ] Invariant cache hit.
[2024-05-29 14:38:55] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-29 14:38:55] [INFO ] Invariant cache hit.
[2024-05-29 14:38:55] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35/41 places, 40/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 35/41 places, 40/46 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-05 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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(AND (EQ s24 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-05 finished in 393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 40 transition count 40
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 35 transition count 40
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 35 transition count 35
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 30 transition count 35
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 24 place count 26 transition count 31
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 26 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 28 place count 26 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 24 transition count 29
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 46 place count 17 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 16 transition count 21
Applied a total of 47 rules in 15 ms. Remains 16 /41 variables (removed 25) and now considering 21/46 (removed 25) transitions.
// Phase 1: matrix 21 rows 16 cols
[2024-05-29 14:38:55] [INFO ] Computed 5 invariants in 0 ms
[2024-05-29 14:38:55] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 14:38:55] [INFO ] Invariant cache hit.
[2024-05-29 14:38:55] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-29 14:38:55] [INFO ] Redundant transitions in 12 ms returned [20]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 20 rows 16 cols
[2024-05-29 14:38:55] [INFO ] Computed 5 invariants in 0 ms
[2024-05-29 14:38:55] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/41 places, 20/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 125 ms. Remains : 16/41 places, 20/46 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 139 steps with 1 reset in 1 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-06 finished in 183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 40 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 36 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 36 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 31 transition count 36
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 26 transition count 31
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 26 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 28 place count 26 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 24 transition count 29
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 46 place count 17 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 16 transition count 21
Applied a total of 47 rules in 14 ms. Remains 16 /41 variables (removed 25) and now considering 21/46 (removed 25) transitions.
// Phase 1: matrix 21 rows 16 cols
[2024-05-29 14:38:55] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 14:38:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 14:38:55] [INFO ] Invariant cache hit.
[2024-05-29 14:38:55] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-29 14:38:55] [INFO ] Redundant transitions in 15 ms returned [20]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 20 rows 16 cols
[2024-05-29 14:38:55] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 14:38:55] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/41 places, 20/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142 ms. Remains : 16/41 places, 20/46 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s3 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 92 steps with 4 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-07 finished in 196 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(((X(p0)||G((X(p1)||G(p2)))) U X(p3))))))'
Support contains 7 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 36 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 35 transition count 40
Applied a total of 12 rules in 6 ms. Remains 35 /41 variables (removed 6) and now considering 40/46 (removed 6) transitions.
// Phase 1: matrix 40 rows 35 cols
[2024-05-29 14:38:55] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 14:38:55] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 14:38:55] [INFO ] Invariant cache hit.
[2024-05-29 14:38:55] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-29 14:38:56] [INFO ] Invariant cache hit.
[2024-05-29 14:38:56] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35/41 places, 40/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 35/41 places, 40/46 transitions.
Stuttering acceptance computed with spot in 512 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), true, (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 7}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 8}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 10}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}], [{ cond=(NOT p2), acceptance={} source=8 dest: 7}, { cond=true, acceptance={} source=8 dest: 8}, { cond=p2, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 6}, { cond=(AND p2 p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(AND (EQ s17 1) (EQ s28 1)), p0:(EQ s23 1), p1:(AND (EQ s24 1) (EQ s33 1)), p3:(AND (EQ s12 1) (EQ s16 1) (EQ s23 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-08 finished in 669 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 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 40 transition count 40
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 35 transition count 40
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 35 transition count 36
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 31 transition count 36
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 22 place count 27 transition count 32
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 27 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 27 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 26 transition count 31
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 42 place count 19 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 18 transition count 23
Applied a total of 43 rules in 11 ms. Remains 18 /41 variables (removed 23) and now considering 23/46 (removed 23) transitions.
// Phase 1: matrix 23 rows 18 cols
[2024-05-29 14:38:56] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 14:38:56] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 14:38:56] [INFO ] Invariant cache hit.
[2024-05-29 14:38:56] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-29 14:38:56] [INFO ] Redundant transitions in 18 ms returned [22]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 22 rows 18 cols
[2024-05-29 14:38:56] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 14:38:56] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/41 places, 22/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 160 ms. Remains : 18/41 places, 22/46 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-09 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 (EQ s1 1) (EQ s6 1) (EQ s17 1) (NEQ s7 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 11 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-09 finished in 206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1)||X(G(p2)))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 36 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 36 transition count 41
Applied a total of 10 rules in 7 ms. Remains 36 /41 variables (removed 5) and now considering 41/46 (removed 5) transitions.
// Phase 1: matrix 41 rows 36 cols
[2024-05-29 14:38:56] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 14:38:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 14:38:56] [INFO ] Invariant cache hit.
[2024-05-29 14:38:56] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-29 14:38:56] [INFO ] Invariant cache hit.
[2024-05-29 14:38:56] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/41 places, 41/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 36/41 places, 41/46 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s8 1), p0:(AND (EQ s18 1) (EQ s29 1)), p2:(OR (EQ s18 0) (EQ s29 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 11706 reset in 106 ms.
Product exploration explored 100000 steps with 11714 reset in 94 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/36 stabilizing places and 8/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 128 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 17 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-29 14:38:58] [INFO ] Invariant cache hit.
[2024-05-29 14:38:58] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 14:38:58] [INFO ] Invariant cache hit.
[2024-05-29 14:38:58] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-29 14:38:58] [INFO ] Invariant cache hit.
[2024-05-29 14:38:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 36/36 places, 41/41 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/36 stabilizing places and 8/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 18 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 11669 reset in 89 ms.
Product exploration explored 100000 steps with 11673 reset in 101 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 41/41 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 36 transition count 41
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 36 transition count 41
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 24 place count 28 transition count 33
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 32 place count 28 transition count 33
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 32 rules in 8 ms. Remains 28 /36 variables (removed 8) and now considering 33/41 (removed 8) transitions.
[2024-05-29 14:38:59] [INFO ] Redundant transitions in 18 ms returned [32]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 32 rows 28 cols
[2024-05-29 14:38:59] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 14:38:59] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/36 places, 32/41 transitions.
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 28/36 places, 32/41 transitions.
Built C files in :
/tmp/ltsmin1860531792665587285
[2024-05-29 14:39:00] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1860531792665587285
Running compilation step : cd /tmp/ltsmin1860531792665587285;'/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 103 ms.
Running link step : cd /tmp/ltsmin1860531792665587285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1860531792665587285;'/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/stateBased18355226992195290990.hoa' '--buchi-type=spotba'
LTSmin run took 121 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-001B-LTLFireability-10 finished in 3491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 36 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 35 transition count 40
Applied a total of 12 rules in 2 ms. Remains 35 /41 variables (removed 6) and now considering 40/46 (removed 6) transitions.
// Phase 1: matrix 40 rows 35 cols
[2024-05-29 14:39:00] [INFO ] Computed 5 invariants in 0 ms
[2024-05-29 14:39:00] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 14:39:00] [INFO ] Invariant cache hit.
[2024-05-29 14:39:00] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-29 14:39:00] [INFO ] Invariant cache hit.
[2024-05-29 14:39:00] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35/41 places, 40/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 35/41 places, 40/46 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s12 1) (EQ s16 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-11 finished in 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 36 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 35 transition count 40
Applied a total of 12 rules in 5 ms. Remains 35 /41 variables (removed 6) and now considering 40/46 (removed 6) transitions.
[2024-05-29 14:39:00] [INFO ] Invariant cache hit.
[2024-05-29 14:39:00] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 14:39:00] [INFO ] Invariant cache hit.
[2024-05-29 14:39:00] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-29 14:39:00] [INFO ] Invariant cache hit.
[2024-05-29 14:39:00] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35/41 places, 40/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 35/41 places, 40/46 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s13 1) (EQ s16 1) (EQ s23 1)), p0:(EQ s34 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-12 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0&&X((!p0 U (G(!p0)||(!p1&&G(F(!p0))))))))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 36 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 35 transition count 40
Applied a total of 12 rules in 4 ms. Remains 35 /41 variables (removed 6) and now considering 40/46 (removed 6) transitions.
[2024-05-29 14:39:00] [INFO ] Invariant cache hit.
[2024-05-29 14:39:00] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 14:39:00] [INFO ] Invariant cache hit.
[2024-05-29 14:39:00] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-29 14:39:00] [INFO ] Invariant cache hit.
[2024-05-29 14:39:00] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35/41 places, 40/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 35/41 places, 40/46 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, p0, p0]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s3 1) (EQ s13 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-13 finished in 229 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((!p0||X(!p0)))||(!p0&&F(G(p1)))))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 37 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 37 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 36 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 36 transition count 41
Applied a total of 10 rules in 5 ms. Remains 36 /41 variables (removed 5) and now considering 41/46 (removed 5) transitions.
// Phase 1: matrix 41 rows 36 cols
[2024-05-29 14:39:01] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 14:39:01] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 14:39:01] [INFO ] Invariant cache hit.
[2024-05-29 14:39:01] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-29 14:39:01] [INFO ] Invariant cache hit.
[2024-05-29 14:39:01] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/41 places, 41/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 36/41 places, 41/46 transitions.
Stuttering acceptance computed with spot in 159 ms :[p0, (AND (NOT p1) p0), (AND (NOT p1) p0), p0]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=p0, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s30 1), p0:(AND (EQ s22 1) (EQ s31 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 331 reset in 149 ms.
Stack based approach found an accepted trace after 15779 steps with 60 reset with depth 308 and stack size 131 in 31 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-15 finished in 485 ms.
All properties solved by simple procedures.
Total runtime 13166 ms.

BK_STOP 1716993542580

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-001B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldRVs-PT-001B, 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 r373-tall-171683789300448"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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