Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905974700044.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldRVs-PT-003B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905974700044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.8K Feb 26 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 18:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 36K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679159705141

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-003B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 17:15:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 17:15:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 17:15:06] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2023-03-18 17:15:06] [INFO ] Transformed 123 places.
[2023-03-18 17:15:06] [INFO ] Transformed 138 transitions.
[2023-03-18 17:15:06] [INFO ] Found NUPN structural information;
[2023-03-18 17:15:06] [INFO ] Parsed PT model containing 123 places and 138 transitions and 432 arcs in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVs-PT-003B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 138/138 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 108 transition count 123
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 108 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 107 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 107 transition count 122
Applied a total of 32 rules in 20 ms. Remains 107 /123 variables (removed 16) and now considering 122/138 (removed 16) transitions.
// Phase 1: matrix 122 rows 107 cols
[2023-03-18 17:15:07] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-18 17:15:07] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-18 17:15:07] [INFO ] Invariant cache hit.
[2023-03-18 17:15:07] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-18 17:15:07] [INFO ] Invariant cache hit.
[2023-03-18 17:15:07] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/123 places, 122/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 107/123 places, 122/138 transitions.
Support contains 38 out of 107 places after structural reductions.
[2023-03-18 17:15:07] [INFO ] Flatten gal took : 27 ms
[2023-03-18 17:15:07] [INFO ] Flatten gal took : 12 ms
[2023-03-18 17:15:07] [INFO ] Input system was already deterministic with 122 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 29) seen :27
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 17:15:07] [INFO ] Invariant cache hit.
[2023-03-18 17:15:07] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-18 17:15:07] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 17:15:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-18 17:15:08] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 17:15:08] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 4 ms to minimize.
[2023-03-18 17:15:08] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2023-03-18 17:15:08] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2023-03-18 17:15:08] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2023-03-18 17:15:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 172 ms
[2023-03-18 17:15:08] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2023-03-18 17:15:08] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2023-03-18 17:15:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2023-03-18 17:15:08] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-18 17:15:08] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 5 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 122/122 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 107 transition count 111
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 96 transition count 111
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 22 place count 96 transition count 95
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 54 place count 80 transition count 95
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 74 transition count 89
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 74 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 74 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 73 transition count 88
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 120 place count 47 transition count 62
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 128 place count 47 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 46 transition count 61
Applied a total of 129 rules in 22 ms. Remains 46 /107 variables (removed 61) and now considering 61/122 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 46/107 places, 61/122 transitions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3397450 steps, run timeout after 3001 ms. (steps per millisecond=1132 ) properties seen :{}
Probabilistic random walk after 3397450 steps, saw 552823 distinct states, run finished after 3002 ms. (steps per millisecond=1131 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 61 rows 46 cols
[2023-03-18 17:15:11] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-18 17:15:11] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-18 17:15:11] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 17:15:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-18 17:15:11] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 17:15:11] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-18 17:15:11] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 46/46 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-18 17:15:11] [INFO ] Invariant cache hit.
[2023-03-18 17:15:11] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-18 17:15:11] [INFO ] Invariant cache hit.
[2023-03-18 17:15:11] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-18 17:15:11] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-18 17:15:11] [INFO ] Invariant cache hit.
[2023-03-18 17:15:11] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 46/46 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 17:15:11] [INFO ] Invariant cache hit.
[2023-03-18 17:15:11] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-18 17:15:11] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 17:15:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-18 17:15:11] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 17:15:11] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-18 17:15:11] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 27 stabilizing places and 27 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1) U X(p2))||F((p0&&X(G(p3))))))'
Support contains 6 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 117
Applied a total of 10 rules in 9 ms. Remains 102 /107 variables (removed 5) and now considering 117/122 (removed 5) transitions.
// Phase 1: matrix 117 rows 102 cols
[2023-03-18 17:15:12] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-18 17:15:12] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-18 17:15:12] [INFO ] Invariant cache hit.
[2023-03-18 17:15:12] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-18 17:15:12] [INFO ] Invariant cache hit.
[2023-03-18 17:15:12] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/107 places, 117/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 102/107 places, 117/122 transitions.
Stuttering acceptance computed with spot in 647 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2) p3) (AND p0 (NOT p2) p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}, { cond=p0, acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 5}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p3)), acceptance={} source=8 dest: 6}]], initial=0, aps=[p1:(EQ s47 1), p0:(EQ s7 1), p2:(AND (EQ s27 1) (EQ s36 1) (EQ s56 1)), p3:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 154 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003B-LTLFireability-00 finished in 905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 122/122 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 106 transition count 110
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 95 transition count 110
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 22 place count 95 transition count 95
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 52 place count 80 transition count 95
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 74 transition count 89
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 74 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 64 place count 74 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 73 transition count 88
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 118 place count 47 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 45 transition count 60
Applied a total of 120 rules in 17 ms. Remains 45 /107 variables (removed 62) and now considering 60/122 (removed 62) transitions.
// Phase 1: matrix 60 rows 45 cols
[2023-03-18 17:15:13] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 17:15:13] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-18 17:15:13] [INFO ] Invariant cache hit.
[2023-03-18 17:15:13] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-18 17:15:13] [INFO ] Redundant transitions in 22 ms returned [59]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 59 rows 45 cols
[2023-03-18 17:15:13] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-18 17:15:13] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/107 places, 59/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 45/107 places, 59/122 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s17 1), p1:(AND (EQ s6 1) (EQ s8 1) (EQ s13 1))], nbAcceptance=2, 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 45 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003B-LTLFireability-01 finished in 218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(p1 U X(!p1))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 117
Applied a total of 10 rules in 6 ms. Remains 102 /107 variables (removed 5) and now considering 117/122 (removed 5) transitions.
// Phase 1: matrix 117 rows 102 cols
[2023-03-18 17:15:13] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 17:15:13] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-18 17:15:13] [INFO ] Invariant cache hit.
[2023-03-18 17:15:13] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-18 17:15:13] [INFO ] Invariant cache hit.
[2023-03-18 17:15:13] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/107 places, 117/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 102/107 places, 117/122 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(NEQ s99 1), p0:(OR (AND (EQ s45 1) (EQ s78 1) (EQ s100 1)) (EQ s30 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]]
Product exploration explored 100000 steps with 2679 reset in 202 ms.
Product exploration explored 100000 steps with 2692 reset in 164 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 371 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[p1, p1]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 8 factoid took 270 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[p1]
Stuttering acceptance computed with spot in 26 ms :[p1]
[2023-03-18 17:15:14] [INFO ] Invariant cache hit.
[2023-03-18 17:15:14] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-18 17:15:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:15] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-18 17:15:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:15:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-18 17:15:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:15] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-18 17:15:15] [INFO ] Computed and/alt/rep : 116/348/116 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-18 17:15:15] [INFO ] Added : 80 causal constraints over 16 iterations in 195 ms. Result :sat
Could not prove EG p1
Support contains 1 out of 102 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 117/117 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 101 transition count 104
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 89 transition count 104
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 24 place count 89 transition count 89
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 54 place count 74 transition count 89
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 106 place count 48 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 46 transition count 61
Applied a total of 108 rules in 19 ms. Remains 46 /102 variables (removed 56) and now considering 61/117 (removed 56) transitions.
// Phase 1: matrix 61 rows 46 cols
[2023-03-18 17:15:15] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 17:15:15] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 17:15:15] [INFO ] Invariant cache hit.
[2023-03-18 17:15:15] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-18 17:15:15] [INFO ] Redundant transitions in 19 ms returned [60]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 60 rows 46 cols
[2023-03-18 17:15:15] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 17:15:15] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/102 places, 60/117 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 169 ms. Remains : 46/102 places, 60/117 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 : [p1, (X p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-003B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-003B-LTLFireability-02 finished in 2272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 106 transition count 109
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 94 transition count 109
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 24 place count 94 transition count 95
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 52 place count 80 transition count 95
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 76 transition count 91
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 76 transition count 91
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 114 place count 49 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 47 transition count 62
Applied a total of 116 rules in 15 ms. Remains 47 /107 variables (removed 60) and now considering 62/122 (removed 60) transitions.
// Phase 1: matrix 62 rows 47 cols
[2023-03-18 17:15:15] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 17:15:15] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-18 17:15:15] [INFO ] Invariant cache hit.
[2023-03-18 17:15:15] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-18 17:15:15] [INFO ] Redundant transitions in 18 ms returned [61]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 61 rows 47 cols
[2023-03-18 17:15:15] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 17:15:15] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/107 places, 61/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 191 ms. Remains : 47/107 places, 61/122 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-03 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:(OR (EQ s36 0) (EQ s17 0) (AND (EQ s17 1) (EQ s30 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2626 reset in 204 ms.
Product exploration explored 100000 steps with 2587 reset in 161 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 478 steps, including 9 resets, run visited all 1 properties in 3 ms. (steps per millisecond=159 )
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 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-18 17:15:16] [INFO ] Invariant cache hit.
[2023-03-18 17:15:16] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-18 17:15:16] [INFO ] Invariant cache hit.
[2023-03-18 17:15:16] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-18 17:15:16] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-18 17:15:16] [INFO ] Invariant cache hit.
[2023-03-18 17:15:16] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 47/47 places, 61/61 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Finished random walk after 174 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=174 )
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 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2612 reset in 115 ms.
Product exploration explored 100000 steps with 2603 reset in 207 ms.
Built C files in :
/tmp/ltsmin6045166002207061868
[2023-03-18 17:15:17] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2023-03-18 17:15:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 17:15:17] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2023-03-18 17:15:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 17:15:17] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2023-03-18 17:15:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 17:15:17] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6045166002207061868
Running compilation step : cd /tmp/ltsmin6045166002207061868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 260 ms.
Running link step : cd /tmp/ltsmin6045166002207061868;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6045166002207061868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1242114603769790495.hoa' '--buchi-type=spotba'
LTSmin run took 12067 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-003B-LTLFireability-03 finished in 14410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 117
Applied a total of 10 rules in 5 ms. Remains 102 /107 variables (removed 5) and now considering 117/122 (removed 5) transitions.
// Phase 1: matrix 117 rows 102 cols
[2023-03-18 17:15:29] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-18 17:15:30] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-18 17:15:30] [INFO ] Invariant cache hit.
[2023-03-18 17:15:30] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-18 17:15:30] [INFO ] Invariant cache hit.
[2023-03-18 17:15:30] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/107 places, 117/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 102/107 places, 117/122 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003B-LTLFireability-04 finished in 312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 103 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 103 transition count 118
Applied a total of 8 rules in 3 ms. Remains 103 /107 variables (removed 4) and now considering 118/122 (removed 4) transitions.
// Phase 1: matrix 118 rows 103 cols
[2023-03-18 17:15:30] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 17:15:30] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-18 17:15:30] [INFO ] Invariant cache hit.
[2023-03-18 17:15:30] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-18 17:15:30] [INFO ] Invariant cache hit.
[2023-03-18 17:15:30] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 103/107 places, 118/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 103/107 places, 118/122 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s83 1), p1:(EQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 133 steps with 1 reset in 0 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003B-LTLFireability-05 finished in 318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((G(F(p2))&&p1))&&p0)))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 117
Applied a total of 10 rules in 2 ms. Remains 102 /107 variables (removed 5) and now considering 117/122 (removed 5) transitions.
// Phase 1: matrix 117 rows 102 cols
[2023-03-18 17:15:30] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 17:15:30] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-18 17:15:30] [INFO ] Invariant cache hit.
[2023-03-18 17:15:30] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-18 17:15:30] [INFO ] Invariant cache hit.
[2023-03-18 17:15:30] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/107 places, 117/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 102/107 places, 117/122 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s51 1) (EQ s35 1)), p1:(AND (EQ s92 1) (EQ s35 1)), p2:(EQ s35 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003B-LTLFireability-06 finished in 321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 117
Applied a total of 10 rules in 3 ms. Remains 102 /107 variables (removed 5) and now considering 117/122 (removed 5) transitions.
// Phase 1: matrix 117 rows 102 cols
[2023-03-18 17:15:30] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 17:15:30] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 17:15:30] [INFO ] Invariant cache hit.
[2023-03-18 17:15:31] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-18 17:15:31] [INFO ] Invariant cache hit.
[2023-03-18 17:15:31] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/107 places, 117/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 102/107 places, 117/122 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s81 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5207 reset in 87 ms.
Product exploration explored 100000 steps with 5274 reset in 99 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/102 stabilizing places and 24/117 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 17:15:31] [INFO ] Invariant cache hit.
[2023-03-18 17:15:31] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-18 17:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:31] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-18 17:15:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:15:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-18 17:15:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:31] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-18 17:15:32] [INFO ] Computed and/alt/rep : 116/348/116 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 17:15:32] [INFO ] Added : 98 causal constraints over 22 iterations in 206 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 117/117 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-18 17:15:32] [INFO ] Invariant cache hit.
[2023-03-18 17:15:32] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-18 17:15:32] [INFO ] Invariant cache hit.
[2023-03-18 17:15:32] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-18 17:15:32] [INFO ] Invariant cache hit.
[2023-03-18 17:15:32] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 102/102 places, 117/117 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/102 stabilizing places and 24/117 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 17:15:32] [INFO ] Invariant cache hit.
[2023-03-18 17:15:32] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-18 17:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:32] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-18 17:15:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:15:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-18 17:15:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:32] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-18 17:15:32] [INFO ] Computed and/alt/rep : 116/348/116 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-18 17:15:33] [INFO ] Added : 98 causal constraints over 22 iterations in 201 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5300 reset in 86 ms.
Product exploration explored 100000 steps with 5310 reset in 159 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 117/117 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 102 transition count 117
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 12 place count 102 transition count 119
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 102 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 101 transition count 118
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 101 transition count 118
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 58 place count 101 transition count 118
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 80 transition count 97
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 80 transition count 97
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 100 rules in 16 ms. Remains 80 /102 variables (removed 22) and now considering 97/117 (removed 20) transitions.
[2023-03-18 17:15:33] [INFO ] Redundant transitions in 19 ms returned [96]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 96 rows 80 cols
[2023-03-18 17:15:33] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-18 17:15:33] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/102 places, 96/117 transitions.
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 80/102 places, 96/117 transitions.
Built C files in :
/tmp/ltsmin901712230784292685
[2023-03-18 17:15:33] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin901712230784292685
Running compilation step : cd /tmp/ltsmin901712230784292685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 202 ms.
Running link step : cd /tmp/ltsmin901712230784292685;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin901712230784292685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16537542307985384501.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 117/117 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 102 cols
[2023-03-18 17:15:48] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 17:15:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-18 17:15:48] [INFO ] Invariant cache hit.
[2023-03-18 17:15:48] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-18 17:15:48] [INFO ] Invariant cache hit.
[2023-03-18 17:15:49] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 102/102 places, 117/117 transitions.
Built C files in :
/tmp/ltsmin1944669000885896527
[2023-03-18 17:15:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1944669000885896527
Running compilation step : cd /tmp/ltsmin1944669000885896527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 200 ms.
Running link step : cd /tmp/ltsmin1944669000885896527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1944669000885896527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4286361321941648037.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 17:16:04] [INFO ] Flatten gal took : 8 ms
[2023-03-18 17:16:04] [INFO ] Flatten gal took : 6 ms
[2023-03-18 17:16:04] [INFO ] Time to serialize gal into /tmp/LTL978202156861249044.gal : 2 ms
[2023-03-18 17:16:04] [INFO ] Time to serialize properties into /tmp/LTL11841506249926176982.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL978202156861249044.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1604292273736869749.hoa' '-atoms' '/tmp/LTL11841506249926176982.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL11841506249926176982.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1604292273736869749.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t10, t11, t13, t14, t15, t16, t17, t18, t19, t20, t21, t2...347
Computing Next relation with stutter on 51 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
451 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.54534,152200,1,0,813,677788,260,451,3471,855819,1342
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVs-PT-003B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVs-PT-003B-LTLFireability-08 finished in 38539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(p0&&(!p1 U (p2||G(!p1)))))))))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 122/122 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 106 transition count 110
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 95 transition count 110
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 22 place count 95 transition count 94
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 54 place count 79 transition count 94
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 73 transition count 88
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 73 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 73 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 72 transition count 87
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 116 place count 48 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 46 transition count 61
Applied a total of 118 rules in 23 ms. Remains 46 /107 variables (removed 61) and now considering 61/122 (removed 61) transitions.
// Phase 1: matrix 61 rows 46 cols
[2023-03-18 17:16:09] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 17:16:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-18 17:16:09] [INFO ] Invariant cache hit.
[2023-03-18 17:16:09] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-18 17:16:09] [INFO ] Redundant transitions in 19 ms returned [60]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 60 rows 46 cols
[2023-03-18 17:16:09] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 17:16:09] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/107 places, 60/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 203 ms. Remains : 46/107 places, 60/122 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s39 1) (EQ s45 1))) (NOT (AND (EQ s27 1) (EQ s39 1) (EQ s45 1)))), p1:(AND (EQ s27 1) (EQ s39 1) (EQ s45 1)), p0:(NEQ s27 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4797 reset in 159 ms.
Product exploration explored 100000 steps with 4589 reset in 167 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/46 stabilizing places and 2/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 441 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 180 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 17:16:11] [INFO ] Invariant cache hit.
[2023-03-18 17:16:11] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-18 17:16:11] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-18 17:16:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-18 17:16:11] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-18 17:16:11] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-18 17:16:11] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 60/60 transitions.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 46 transition count 60
Applied a total of 8 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 46/46 places, 60/60 transitions.
Incomplete random walk after 10000 steps, including 168 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3448034 steps, run timeout after 3001 ms. (steps per millisecond=1148 ) properties seen :{}
Probabilistic random walk after 3448034 steps, saw 566450 distinct states, run finished after 3002 ms. (steps per millisecond=1148 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 46 cols
[2023-03-18 17:16:14] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 17:16:14] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-18 17:16:14] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 17:16:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-18 17:16:14] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 17:16:14] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2023-03-18 17:16:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-18 17:16:14] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 17:16:14] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 46/46 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-18 17:16:14] [INFO ] Invariant cache hit.
[2023-03-18 17:16:14] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-18 17:16:14] [INFO ] Invariant cache hit.
[2023-03-18 17:16:14] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-18 17:16:14] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-18 17:16:14] [INFO ] Invariant cache hit.
[2023-03-18 17:16:14] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 46/46 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 17:16:14] [INFO ] Invariant cache hit.
[2023-03-18 17:16:14] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-18 17:16:14] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 17:16:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-18 17:16:14] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 17:16:14] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2023-03-18 17:16:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-18 17:16:14] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-18 17:16:14] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND p1 p0 (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) p0 (NOT p2))), (F (OR (AND p1 (NOT p2)) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 417 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 46 cols
[2023-03-18 17:16:15] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-18 17:16:15] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-18 17:16:15] [INFO ] Invariant cache hit.
[2023-03-18 17:16:15] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-18 17:16:15] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-18 17:16:15] [INFO ] Invariant cache hit.
[2023-03-18 17:16:15] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 179 ms. Remains : 46/46 places, 60/60 transitions.
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/46 stabilizing places and 2/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p2), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 330 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 176 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 17:16:15] [INFO ] Invariant cache hit.
[2023-03-18 17:16:15] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-18 17:16:16] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 17:16:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-18 17:16:16] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 17:16:16] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-18 17:16:16] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 60/60 transitions.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 46 transition count 60
Applied a total of 8 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 46/46 places, 60/60 transitions.
Incomplete random walk after 10000 steps, including 170 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3247037 steps, run timeout after 3001 ms. (steps per millisecond=1081 ) properties seen :{}
Probabilistic random walk after 3247037 steps, saw 535916 distinct states, run finished after 3001 ms. (steps per millisecond=1081 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 46 cols
[2023-03-18 17:16:19] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 17:16:19] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-18 17:16:19] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 17:16:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-18 17:16:19] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 17:16:19] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2023-03-18 17:16:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-18 17:16:19] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-18 17:16:19] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 46/46 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-18 17:16:19] [INFO ] Invariant cache hit.
[2023-03-18 17:16:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 17:16:19] [INFO ] Invariant cache hit.
[2023-03-18 17:16:19] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-18 17:16:19] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-18 17:16:19] [INFO ] Invariant cache hit.
[2023-03-18 17:16:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 46/46 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 17:16:19] [INFO ] Invariant cache hit.
[2023-03-18 17:16:19] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-18 17:16:19] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 17:16:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-18 17:16:19] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 17:16:19] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2023-03-18 17:16:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-18 17:16:19] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-18 17:16:19] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p2) p0))]
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 4732 reset in 91 ms.
Product exploration explored 100000 steps with 4581 reset in 105 ms.
Built C files in :
/tmp/ltsmin4599737503806029402
[2023-03-18 17:16:20] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2023-03-18 17:16:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 17:16:20] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2023-03-18 17:16:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 17:16:20] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2023-03-18 17:16:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 17:16:20] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4599737503806029402
Running compilation step : cd /tmp/ltsmin4599737503806029402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 189 ms.
Running link step : cd /tmp/ltsmin4599737503806029402;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4599737503806029402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2186138151185365691.hoa' '--buchi-type=spotba'
LTSmin run took 13176 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-003B-LTLFireability-09 finished in 24289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))&&(p1||G(p0))))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 116
Applied a total of 12 rules in 2 ms. Remains 101 /107 variables (removed 6) and now considering 116/122 (removed 6) transitions.
// Phase 1: matrix 116 rows 101 cols
[2023-03-18 17:16:33] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-18 17:16:33] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-18 17:16:33] [INFO ] Invariant cache hit.
[2023-03-18 17:16:33] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-18 17:16:33] [INFO ] Invariant cache hit.
[2023-03-18 17:16:33] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/107 places, 116/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 101/107 places, 116/122 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(OR p1 p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s6 1), p1:(AND (EQ s16 1) (EQ s19 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003B-LTLFireability-11 finished in 315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||X(F(!p2)))))'
Support contains 7 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 116
Applied a total of 12 rules in 1 ms. Remains 101 /107 variables (removed 6) and now considering 116/122 (removed 6) transitions.
[2023-03-18 17:16:34] [INFO ] Invariant cache hit.
[2023-03-18 17:16:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-18 17:16:34] [INFO ] Invariant cache hit.
[2023-03-18 17:16:34] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-18 17:16:34] [INFO ] Invariant cache hit.
[2023-03-18 17:16:34] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/107 places, 116/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 101/107 places, 116/122 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) p2), p2, (AND (NOT p1) p2)]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s44 1) (EQ s79 1) (EQ s98 1)), p0:(EQ s37 1), p2:(AND (EQ s59 1) (EQ s66 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 7 factoid took 110 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-003B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-003B-LTLFireability-12 finished in 561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 122/122 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 106 transition count 110
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 95 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 94 transition count 109
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 24 place count 94 transition count 95
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 52 place count 80 transition count 95
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 57 place count 75 transition count 90
Iterating global reduction 3 with 5 rules applied. Total rules applied 62 place count 75 transition count 90
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 114 place count 49 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 47 transition count 62
Applied a total of 116 rules in 7 ms. Remains 47 /107 variables (removed 60) and now considering 62/122 (removed 60) transitions.
// Phase 1: matrix 62 rows 47 cols
[2023-03-18 17:16:34] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 17:16:34] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-18 17:16:34] [INFO ] Invariant cache hit.
[2023-03-18 17:16:34] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-18 17:16:34] [INFO ] Redundant transitions in 14 ms returned [61]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 61 rows 47 cols
[2023-03-18 17:16:34] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-18 17:16:34] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/107 places, 61/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 130 ms. Remains : 47/107 places, 61/122 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s37 1) (EQ s43 1))) (NOT (EQ s13 1))), p0:(AND (EQ s37 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5135 reset in 101 ms.
Product exploration explored 100000 steps with 5076 reset in 111 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-18 17:16:35] [INFO ] Invariant cache hit.
[2023-03-18 17:16:35] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-18 17:16:35] [INFO ] Invariant cache hit.
[2023-03-18 17:16:35] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-18 17:16:35] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-18 17:16:35] [INFO ] Invariant cache hit.
[2023-03-18 17:16:35] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 47/47 places, 61/61 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 46 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 47 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 5027 reset in 135 ms.
Product exploration explored 100000 steps with 5108 reset in 147 ms.
Built C files in :
/tmp/ltsmin9304803306027393604
[2023-03-18 17:16:36] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2023-03-18 17:16:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 17:16:36] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2023-03-18 17:16:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 17:16:36] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2023-03-18 17:16:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 17:16:36] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9304803306027393604
Running compilation step : cd /tmp/ltsmin9304803306027393604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 183 ms.
Running link step : cd /tmp/ltsmin9304803306027393604;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9304803306027393604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased859114842671253562.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-18 17:16:51] [INFO ] Invariant cache hit.
[2023-03-18 17:16:51] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-18 17:16:51] [INFO ] Invariant cache hit.
[2023-03-18 17:16:51] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-18 17:16:51] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-18 17:16:51] [INFO ] Invariant cache hit.
[2023-03-18 17:16:51] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 47/47 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin14171436488058283494
[2023-03-18 17:16:51] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2023-03-18 17:16:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 17:16:51] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2023-03-18 17:16:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 17:16:51] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2023-03-18 17:16:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 17:16:51] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14171436488058283494
Running compilation step : cd /tmp/ltsmin14171436488058283494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 143 ms.
Running link step : cd /tmp/ltsmin14171436488058283494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14171436488058283494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5688964961864558299.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 17:17:06] [INFO ] Flatten gal took : 8 ms
[2023-03-18 17:17:06] [INFO ] Flatten gal took : 6 ms
[2023-03-18 17:17:06] [INFO ] Time to serialize gal into /tmp/LTL7057134233802518909.gal : 2 ms
[2023-03-18 17:17:06] [INFO ] Time to serialize properties into /tmp/LTL18356353646659375383.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7057134233802518909.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4799889396321266676.hoa' '-atoms' '/tmp/LTL18356353646659375383.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18356353646659375383.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4799889396321266676.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t7, t9, t11, t13, t15, t16, t18, t19, t21, t22, t24, t25, t27, t28, t66.t67, ...677
Computing Next relation with stutter on 51 deadlock states
85 unique states visited
0 strongly connected components in search stack
92 transitions explored
47 items max in DFS search stack
301 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.02469,123116,1,0,2511,461444,162,1549,2046,746230,7623
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVs-PT-003B-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVs-PT-003B-LTLFireability-13 finished in 36011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(p1) U p2)))'
Support contains 8 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 117
Applied a total of 10 rules in 1 ms. Remains 102 /107 variables (removed 5) and now considering 117/122 (removed 5) transitions.
// Phase 1: matrix 117 rows 102 cols
[2023-03-18 17:17:10] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-18 17:17:10] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-18 17:17:10] [INFO ] Invariant cache hit.
[2023-03-18 17:17:10] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-18 17:17:10] [INFO ] Invariant cache hit.
[2023-03-18 17:17:10] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/107 places, 117/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 102/107 places, 117/122 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s15 1) (EQ s19 1) (EQ s26 1)), p1:(OR (EQ s93 1) (NEQ s33 1)), p0:(OR (EQ s49 0) (EQ s52 0) (EQ s59 0) (EQ s33 0))], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 98 steps with 2 reset in 0 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003B-LTLFireability-15 finished in 419 ms.
All properties solved by simple procedures.
Total runtime 124308 ms.

BK_STOP 1679159831216

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-003B"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-003B, 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 r421-tajo-167905974700044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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