fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r222-tall-165286025900892
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ShieldRVt-PT-001B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
307.275 16791.00 25739.00 812.50 FFFFFFFTFTFFTFTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 6.7K Apr 30 01:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 30 01:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 01:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 01:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 13K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-001B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653070914114

Running Version 202205111006
[2022-05-20 18:21:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 18:21:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 18:21:55] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2022-05-20 18:21:55] [INFO ] Transformed 53 places.
[2022-05-20 18:21:55] [INFO ] Transformed 53 transitions.
[2022-05-20 18:21:55] [INFO ] Found NUPN structural information;
[2022-05-20 18:21:55] [INFO ] Parsed PT model containing 53 places and 53 transitions in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-001B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 48 transition count 48
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 48 transition count 48
Applied a total of 10 rules in 13 ms. Remains 48 /53 variables (removed 5) and now considering 48/53 (removed 5) transitions.
// Phase 1: matrix 48 rows 48 cols
[2022-05-20 18:21:55] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-20 18:21:55] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 48 rows 48 cols
[2022-05-20 18:21:55] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-20 18:21:55] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 48 cols
[2022-05-20 18:21:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:21:55] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/53 places, 48/53 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/53 places, 48/53 transitions.
Support contains 29 out of 48 places after structural reductions.
[2022-05-20 18:21:55] [INFO ] Flatten gal took : 20 ms
[2022-05-20 18:21:55] [INFO ] Flatten gal took : 6 ms
[2022-05-20 18:21:55] [INFO ] Input system was already deterministic with 48 transitions.
Support contains 28 out of 48 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 29) seen :28
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 48 rows 48 cols
[2022-05-20 18:21:56] [INFO ] Computed 5 place invariants in 12 ms
[2022-05-20 18:21:56] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 15 stabilizing places and 15 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||p1)))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 48/48 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 42 transition count 42
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 40 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 40 transition count 40
Applied a total of 16 rules in 7 ms. Remains 40 /48 variables (removed 8) and now considering 40/48 (removed 8) transitions.
// Phase 1: matrix 40 rows 40 cols
[2022-05-20 18:21:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:21:56] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 40 rows 40 cols
[2022-05-20 18:21:56] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 18:21:56] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 40 cols
[2022-05-20 18:21:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:21:56] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 40/48 places, 40/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 40/48 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(EQ s19 1), p1:(EQ s13 1)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-00 finished in 407 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(X(G((F(p0)||p1))))))))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 47 transition count 36
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 36 transition count 36
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 22 place count 36 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 34 place count 30 transition count 30
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 25 transition count 25
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 25 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 25 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 45 place count 25 transition count 23
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 47 place count 24 transition count 23
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 23 transition count 22
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 23 transition count 22
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 59 place count 18 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 61 place count 17 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 16 transition count 16
Applied a total of 62 rules in 37 ms. Remains 16 /48 variables (removed 32) and now considering 16/48 (removed 32) transitions.
// Phase 1: matrix 16 rows 16 cols
[2022-05-20 18:21:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:21:56] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2022-05-20 18:21:56] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 18:21:56] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-20 18:21:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2022-05-20 18:21:57] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-20 18:21:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/48 places, 16/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/48 places, 16/48 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s13 1)), p0:(OR (EQ s12 1) (AND (EQ s3 1) (EQ s5 1) (EQ s10 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1190 steps with 106 reset in 9 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-01 finished in 219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(p0)))&&G((X(X(p1))||X(G(p2))))))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 48/48 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 42 transition count 42
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 42 transition count 42
Applied a total of 12 rules in 2 ms. Remains 42 /48 variables (removed 6) and now considering 42/48 (removed 6) transitions.
// Phase 1: matrix 42 rows 42 cols
[2022-05-20 18:21:57] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-20 18:21:57] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 42 rows 42 cols
[2022-05-20 18:21:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:21:57] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 42 cols
[2022-05-20 18:21:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:21:57] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 42/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/48 places, 42/48 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) p1)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s14 1), p2:(EQ s14 0), p1:(EQ s11 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][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9916 steps with 551 reset in 29 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-02 finished in 477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(X((X(p0)&&p1)))||X(p2)||p3))))'
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 48/48 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 42 transition count 42
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 42 transition count 42
Applied a total of 12 rules in 2 ms. Remains 42 /48 variables (removed 6) and now considering 42/48 (removed 6) transitions.
// Phase 1: matrix 42 rows 42 cols
[2022-05-20 18:21:57] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 18:21:57] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 42 rows 42 cols
[2022-05-20 18:21:57] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-20 18:21:57] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 42 cols
[2022-05-20 18:21:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:21:57] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 42/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/48 places, 42/48 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p3:(AND (EQ s32 1) (EQ s41 1)), p2:(EQ s21 1), p1:(EQ s20 1), p0:(EQ s11 1)], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-03 finished in 382 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(p0)))))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 48/48 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 42 transition count 42
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 40 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 40 transition count 40
Applied a total of 16 rules in 9 ms. Remains 40 /48 variables (removed 8) and now considering 40/48 (removed 8) transitions.
// Phase 1: matrix 40 rows 40 cols
[2022-05-20 18:21:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:21:58] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 40 rows 40 cols
[2022-05-20 18:21:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:21:58] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 40 cols
[2022-05-20 18:21:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:21:58] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 40/48 places, 40/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 40/48 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-04 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}]], initial=3, aps=[p0:(AND (EQ s1 1) (EQ s26 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-04 finished in 263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 47 transition count 30
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 30 transition count 30
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 34 place count 30 transition count 25
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 25 transition count 25
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 22 transition count 22
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 22 transition count 22
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 14 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 69 place count 13 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 71 place count 12 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 10 transition count 11
Applied a total of 73 rules in 18 ms. Remains 10 /48 variables (removed 38) and now considering 11/48 (removed 37) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-20 18:21:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 18:21:58] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-20 18:21:58] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 18:21:58] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-20 18:21:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-20 18:21:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 18:21:58] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/48 places, 11/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/48 places, 11/48 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s6 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 17707 reset in 133 ms.
Stack based approach found an accepted trace after 22 steps with 6 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-05 finished in 299 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0 U p1))))))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 48/48 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 43 transition count 43
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 41 transition count 41
Applied a total of 14 rules in 3 ms. Remains 41 /48 variables (removed 7) and now considering 41/48 (removed 7) transitions.
// Phase 1: matrix 41 rows 41 cols
[2022-05-20 18:21:58] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 18:21:58] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 41 rows 41 cols
[2022-05-20 18:21:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:21:58] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 41 cols
[2022-05-20 18:21:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:21:58] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/48 places, 41/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/48 places, 41/48 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(EQ s18 1), p0:(EQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-06 finished in 308 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&(G(p1)||F(p2))))))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 48/48 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 43 transition count 43
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 42 transition count 42
Applied a total of 12 rules in 7 ms. Remains 42 /48 variables (removed 6) and now considering 42/48 (removed 6) transitions.
// Phase 1: matrix 42 rows 42 cols
[2022-05-20 18:21:58] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-20 18:21:58] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 42 rows 42 cols
[2022-05-20 18:21:58] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-20 18:21:58] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 42 cols
[2022-05-20 18:21:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:21:58] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 42/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/48 places, 42/48 transitions.
Stuttering acceptance computed with spot in 435 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p2:(EQ s32 1), p1:(EQ s8 1), p0:(EQ s8 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8789 reset in 75 ms.
Product exploration explored 100000 steps with 8867 reset in 113 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Detected a total of 12/42 stabilizing places and 12/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 536 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 350 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 7 factoid took 329 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 722 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 42 rows 42 cols
[2022-05-20 18:22:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-20 18:22:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 18:22:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-20 18:22:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 18:22:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-20 18:22:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 18:22:01] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-20 18:22:01] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 2 ms to minimize.
[2022-05-20 18:22:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-20 18:22:01] [INFO ] Computed and/alt/rep : 41/61/41 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-20 18:22:01] [INFO ] Added : 39 causal constraints over 8 iterations in 44 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 42 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 42 cols
[2022-05-20 18:22:01] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 18:22:01] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 42 rows 42 cols
[2022-05-20 18:22:01] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 18:22:01] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 42 cols
[2022-05-20 18:22:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:22:01] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/42 places, 42/42 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Detected a total of 12/42 stabilizing places and 12/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 93 ms :[(NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p2), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 103 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 42 rows 42 cols
[2022-05-20 18:22:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:22:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-20 18:22:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 18:22:02] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-20 18:22:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 18:22:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-20 18:22:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 18:22:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-20 18:22:02] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2022-05-20 18:22:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-20 18:22:02] [INFO ] Computed and/alt/rep : 41/61/41 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-20 18:22:02] [INFO ] Added : 39 causal constraints over 8 iterations in 38 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 98 ms :[(NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 8837 reset in 72 ms.
Product exploration explored 100000 steps with 8824 reset in 69 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 90 ms :[(NOT p2), (NOT p2), (NOT p2)]
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 42/42 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 42 transition count 42
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 9 place count 42 transition count 46
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 42 transition count 46
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 42 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 42 transition count 45
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 34 place count 35 transition count 38
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 41 place count 35 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 35 transition count 38
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 33 transition count 36
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 33 transition count 36
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 33 transition count 52
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 30 transition count 46
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 30 transition count 46
Deduced a syphon composed of 18 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 30 transition count 43
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 58 rules in 12 ms. Remains 30 /42 variables (removed 12) and now considering 43/42 (removed -1) transitions.
[2022-05-20 18:22:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 43 rows 30 cols
[2022-05-20 18:22:03] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-20 18:22:03] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/42 places, 43/42 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/42 places, 43/42 transitions.
Product exploration explored 100000 steps with 20000 reset in 144 ms.
Product exploration explored 100000 steps with 20000 reset in 134 ms.
Built C files in :
/tmp/ltsmin848187800416711229
[2022-05-20 18:22:03] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin848187800416711229
Running compilation step : cd /tmp/ltsmin848187800416711229;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 182 ms.
Running link step : cd /tmp/ltsmin848187800416711229;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin848187800416711229;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17592800870345810810.hoa' '--buchi-type=spotba'
LTSmin run took 241 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-001B-LTLFireability-07 finished in 5167 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G((G((G(X(p0))||p1))||p2))))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 47 transition count 32
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 32 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 31 transition count 31
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 32 place count 31 transition count 27
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 40 place count 27 transition count 27
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 25 transition count 25
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 25 transition count 25
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 62 place count 16 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 16 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 15 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 14 transition count 14
Applied a total of 66 rules in 8 ms. Remains 14 /48 variables (removed 34) and now considering 14/48 (removed 34) transitions.
// Phase 1: matrix 14 rows 14 cols
[2022-05-20 18:22:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 18:22:04] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 14 rows 14 cols
[2022-05-20 18:22:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 18:22:04] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-20 18:22:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 14 cols
[2022-05-20 18:22:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 18:22:04] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/48 places, 14/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/48 places, 14/48 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1), p2:(EQ s10 1), p1:(EQ s12 1)], nbAcceptance=3, 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 350 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-08 finished in 145 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&p1)))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 48/48 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 48 transition count 30
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 30 transition count 30
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 36 place count 30 transition count 25
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 46 place count 25 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 23 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 23 transition count 23
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 68 place count 14 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 71 place count 13 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 11 transition count 13
Applied a total of 75 rules in 12 ms. Remains 11 /48 variables (removed 37) and now considering 13/48 (removed 35) transitions.
// Phase 1: matrix 13 rows 11 cols
[2022-05-20 18:22:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:22:04] [INFO ] Implicit Places using invariants in 27 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/48 places, 13/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 10/48 places, 13/48 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s7 0), p0:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 527 reset in 178 ms.
Product exploration explored 100000 steps with 560 reset in 100 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/10 stabilizing places and 1/13 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 p0)), (X (NOT (OR (NOT p1) (NOT p0)))), (X p0), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 369 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 p0)), (X (NOT (OR (NOT p1) (NOT p0)))), (X p0), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p0)))), (F p0), (F (AND p1 p0))]
Knowledge based reduction with 8 factoid took 348 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 13 rows 10 cols
[2022-05-20 18:22:05] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 18:22:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-20 18:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 18:22:05] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-20 18:22:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 18:22:05] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-20 18:22:05] [INFO ] Computed and/alt/rep : 12/48/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 18:22:05] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 10 cols
[2022-05-20 18:22:05] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 18:22:05] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 13 rows 10 cols
[2022-05-20 18:22:05] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 18:22:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 18:22:05] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-20 18:22:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 10 cols
[2022-05-20 18:22:05] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 18:22:05] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 13/13 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/10 stabilizing places and 1/13 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 p0)), (X (NOT (OR (NOT p1) (NOT p0)))), (X p0), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 867 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 p0)), (X (NOT (OR (NOT p1) (NOT p0)))), (X p0), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p0)))), (F p0), (F (AND p1 p0))]
Knowledge based reduction with 8 factoid took 563 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 13 rows 10 cols
[2022-05-20 18:22:07] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 18:22:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-20 18:22:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 18:22:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-20 18:22:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 18:22:07] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-20 18:22:07] [INFO ] Computed and/alt/rep : 12/48/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 18:22:07] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 511 reset in 109 ms.
Product exploration explored 100000 steps with 479 reset in 87 ms.
Built C files in :
/tmp/ltsmin3952656278702292330
[2022-05-20 18:22:07] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2022-05-20 18:22:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:22:07] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2022-05-20 18:22:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:22:07] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2022-05-20 18:22:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:22:07] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3952656278702292330
Running compilation step : cd /tmp/ltsmin3952656278702292330;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin3952656278702292330;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin3952656278702292330;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11527268341502889542.hoa' '--buchi-type=spotba'
LTSmin run took 85 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-001B-LTLFireability-09 finished in 3788 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(X((F(X(F(p0)))&&p1)))))))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 47 transition count 32
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 32 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 30 transition count 30
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 34 place count 30 transition count 25
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 44 place count 25 transition count 25
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 23 transition count 23
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 23 transition count 23
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 64 place count 15 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 15 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 13 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 11 transition count 12
Applied a total of 71 rules in 6 ms. Remains 11 /48 variables (removed 37) and now considering 12/48 (removed 36) transitions.
// Phase 1: matrix 12 rows 11 cols
[2022-05-20 18:22:07] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 18:22:07] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 12 rows 11 cols
[2022-05-20 18:22:07] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 18:22:07] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-20 18:22:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 11 cols
[2022-05-20 18:22:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 18:22:08] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/48 places, 12/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/48 places, 12/48 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s6 1), p0:(EQ s8 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 67 steps with 1 reset in 1 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-10 finished in 166 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((p0||(X(p2)&&G(p3)&&p1))))))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 48/48 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 42 transition count 42
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 40 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 40 transition count 40
Applied a total of 16 rules in 6 ms. Remains 40 /48 variables (removed 8) and now considering 40/48 (removed 8) transitions.
// Phase 1: matrix 40 rows 40 cols
[2022-05-20 18:22:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:22:08] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 40 rows 40 cols
[2022-05-20 18:22:08] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-20 18:22:08] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 40 cols
[2022-05-20 18:22:08] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 18:22:08] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 40/48 places, 40/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 40/48 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p3), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) p3 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) p3 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s26 1)), p0:(EQ s20 1), p3:(OR (EQ s13 0) (EQ s20 0)), p2:(AND (EQ s1 1) (EQ s26 1))], nbAcceptance=1, 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 2822 reset in 88 ms.
Stack based approach found an accepted trace after 130 steps with 4 reset with depth 24 and stack size 24 in 1 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-11 finished in 352 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 47 transition count 30
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 30 transition count 30
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 34 place count 30 transition count 25
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 25 transition count 25
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 22 transition count 22
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 22 transition count 22
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 14 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 69 place count 13 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 71 place count 12 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 10 transition count 11
Applied a total of 73 rules in 5 ms. Remains 10 /48 variables (removed 38) and now considering 11/48 (removed 37) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-20 18:22:08] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 18:22:08] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-20 18:22:08] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 18:22:08] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-20 18:22:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-20 18:22:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 18:22:08] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/48 places, 11/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/48 places, 11/48 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-12 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 s8 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]]
Product exploration explored 100000 steps with 7850 reset in 58 ms.
Product exploration explored 100000 steps with 7890 reset in 68 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-20 18:22:09] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 18:22:09] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-20 18:22:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 18:22:09] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-20 18:22:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-20 18:22:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 18:22:09] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7828 reset in 64 ms.
Product exploration explored 100000 steps with 7935 reset in 73 ms.
Built C files in :
/tmp/ltsmin5910362913699227413
[2022-05-20 18:22:09] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2022-05-20 18:22:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:22:10] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2022-05-20 18:22:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:22:10] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2022-05-20 18:22:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:22:10] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5910362913699227413
Running compilation step : cd /tmp/ltsmin5910362913699227413;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin5910362913699227413;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin5910362913699227413;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4630492019833740948.hoa' '--buchi-type=spotba'
LTSmin run took 45 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-001B-LTLFireability-12 finished in 1693 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U G(p0)))))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 47 transition count 30
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 30 transition count 30
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 34 place count 30 transition count 25
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 25 transition count 25
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 22 transition count 22
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 22 transition count 22
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 64 place count 15 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 15 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 67 place count 14 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 12 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 11 transition count 13
Applied a total of 72 rules in 4 ms. Remains 11 /48 variables (removed 37) and now considering 13/48 (removed 35) transitions.
// Phase 1: matrix 13 rows 11 cols
[2022-05-20 18:22:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 18:22:10] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 13 rows 11 cols
[2022-05-20 18:22:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 18:22:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 18:22:10] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-20 18:22:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 11 cols
[2022-05-20 18:22:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 18:22:10] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/48 places, 13/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/48 places, 13/48 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 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 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-001B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLFireability-13 finished in 107 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&!(G(p1) U p2)))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 47 transition count 33
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 33 transition count 33
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 28 place count 33 transition count 29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 36 place count 29 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 27 transition count 27
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 27 transition count 27
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 58 place count 18 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 16 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 15 transition count 18
Applied a total of 63 rules in 6 ms. Remains 15 /48 variables (removed 33) and now considering 18/48 (removed 30) transitions.
// Phase 1: matrix 18 rows 15 cols
[2022-05-20 18:22:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:22:10] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 18 rows 15 cols
[2022-05-20 18:22:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 18:22:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 18:22:10] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-05-20 18:22:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 15 cols
[2022-05-20 18:22:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 18:22:10] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/48 places, 18/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/48 places, 18/48 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) p2), true, (NOT p0), (AND p1 p2), p1]
Running random walk in product with property : ShieldRVt-PT-001B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s2 1), p0:(EQ s14 1), p1:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 57 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/15 stabilizing places and 2/18 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND p1 p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 10 factoid took 162 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-001B-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-001B-LTLFireability-14 finished in 562 ms.
All properties solved by simple procedures.
Total runtime 15633 ms.

BK_STOP 1653070930905

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-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 r222-tall-165286025900892"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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