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.r425-tajo-167905977800132.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 ltsminxred
Input is ShieldRVs-PT-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977800132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 26 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 18:33 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.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 256K 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-040A-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679299179439

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 07:59:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 07:59:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 07:59:41] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-20 07:59:41] [INFO ] Transformed 563 places.
[2023-03-20 07:59:41] [INFO ] Transformed 763 transitions.
[2023-03-20 07:59:41] [INFO ] Found NUPN structural information;
[2023-03-20 07:59:41] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-040A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 77 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 45 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-20 07:59:41] [INFO ] Computed 161 place invariants in 13 ms
[2023-03-20 07:59:41] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-20 07:59:41] [INFO ] Invariant cache hit.
[2023-03-20 07:59:42] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
[2023-03-20 07:59:42] [INFO ] Invariant cache hit.
[2023-03-20 07:59:42] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1326 ms. Remains : 563/563 places, 763/763 transitions.
Support contains 77 out of 563 places after structural reductions.
[2023-03-20 07:59:43] [INFO ] Flatten gal took : 120 ms
[2023-03-20 07:59:43] [INFO ] Flatten gal took : 65 ms
[2023-03-20 07:59:43] [INFO ] Input system was already deterministic with 763 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 35) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 07:59:43] [INFO ] Invariant cache hit.
[2023-03-20 07:59:44] [INFO ] [Real]Absence check using 161 positive place invariants in 21 ms returned sat
[2023-03-20 07:59:44] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:59:44] [INFO ] [Nat]Absence check using 161 positive place invariants in 21 ms returned sat
[2023-03-20 07:59:44] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:59:44] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 5 ms to minimize.
[2023-03-20 07:59:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-20 07:59:44] [INFO ] After 449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-20 07:59:45] [INFO ] After 715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 49 ms.
Support contains 12 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 81 place count 562 transition count 762
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 561 transition count 761
Applied a total of 82 rules in 133 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 561/563 places, 761/763 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 761 rows 561 cols
[2023-03-20 07:59:45] [INFO ] Computed 161 place invariants in 7 ms
[2023-03-20 07:59:45] [INFO ] [Real]Absence check using 161 positive place invariants in 21 ms returned sat
[2023-03-20 07:59:45] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:59:45] [INFO ] [Nat]Absence check using 161 positive place invariants in 38 ms returned sat
[2023-03-20 07:59:46] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:59:46] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2023-03-20 07:59:46] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2023-03-20 07:59:46] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2023-03-20 07:59:46] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2023-03-20 07:59:46] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2023-03-20 07:59:46] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2023-03-20 07:59:46] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2023-03-20 07:59:47] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-20 07:59:47] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2023-03-20 07:59:47] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2023-03-20 07:59:47] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2023-03-20 07:59:47] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-20 07:59:47] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2023-03-20 07:59:47] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2023-03-20 07:59:47] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1335 ms
[2023-03-20 07:59:47] [INFO ] After 1648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-20 07:59:47] [INFO ] After 1838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 761/761 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 561 transition count 761
Applied a total of 2 rules in 80 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 561/561 places, 761/761 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 419496 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 419496 steps, saw 354624 distinct states, run finished after 3003 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 761 rows 561 cols
[2023-03-20 07:59:50] [INFO ] Computed 161 place invariants in 8 ms
[2023-03-20 07:59:51] [INFO ] [Real]Absence check using 161 positive place invariants in 26 ms returned sat
[2023-03-20 07:59:51] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:59:51] [INFO ] [Nat]Absence check using 161 positive place invariants in 27 ms returned sat
[2023-03-20 07:59:51] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:59:51] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2023-03-20 07:59:51] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2023-03-20 07:59:51] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2023-03-20 07:59:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
[2023-03-20 07:59:51] [INFO ] After 483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-20 07:59:51] [INFO ] After 662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 761/761 transitions.
Applied a total of 0 rules in 23 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 561/561 places, 761/761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 761/761 transitions.
Applied a total of 0 rules in 23 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2023-03-20 07:59:51] [INFO ] Invariant cache hit.
[2023-03-20 07:59:52] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-20 07:59:52] [INFO ] Invariant cache hit.
[2023-03-20 07:59:53] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
[2023-03-20 07:59:53] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-20 07:59:53] [INFO ] Invariant cache hit.
[2023-03-20 07:59:53] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1665 ms. Remains : 561/561 places, 761/761 transitions.
Applied a total of 0 rules in 23 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 07:59:53] [INFO ] Invariant cache hit.
[2023-03-20 07:59:53] [INFO ] [Real]Absence check using 161 positive place invariants in 24 ms returned sat
[2023-03-20 07:59:54] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:59:54] [INFO ] [Nat]Absence check using 161 positive place invariants in 27 ms returned sat
[2023-03-20 07:59:54] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:59:54] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2023-03-20 07:59:54] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2023-03-20 07:59:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2023-03-20 07:59:54] [INFO ] After 422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-20 07:59:54] [INFO ] After 608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 1 stabilizing places and 1 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' '!(G(F((p0||(X(F(p2))&&p1)))))'
Support contains 7 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 35 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 562 cols
[2023-03-20 07:59:55] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-20 07:59:55] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-20 07:59:55] [INFO ] Invariant cache hit.
[2023-03-20 07:59:55] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
[2023-03-20 07:59:56] [INFO ] Redundant transitions in 164 ms returned [240]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 761 rows 562 cols
[2023-03-20 07:59:56] [INFO ] Computed 161 place invariants in 17 ms
[2023-03-20 07:59:56] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/563 places, 761/763 transitions.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1498 ms. Remains : 562/563 places, 761/763 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s222 1) (EQ s226 1) (EQ s233 1)), p0:(EQ s214 1), p2:(AND (EQ s248 1) (EQ s252 1) (EQ s261 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8717 steps with 26 reset in 89 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-00 finished in 1929 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&&X(G(p1)))))))'
Support contains 4 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 8 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-20 07:59:56] [INFO ] Computed 161 place invariants in 8 ms
[2023-03-20 07:59:57] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-20 07:59:57] [INFO ] Invariant cache hit.
[2023-03-20 07:59:57] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2023-03-20 07:59:57] [INFO ] Invariant cache hit.
[2023-03-20 07:59:58] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1337 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s4 1), p1:(AND (EQ s59 1) (EQ s74 1) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 513 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-01 finished in 1524 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)&&F(G(p1)))))'
Support contains 6 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 30 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 562 cols
[2023-03-20 07:59:58] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-20 07:59:58] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-20 07:59:58] [INFO ] Invariant cache hit.
[2023-03-20 07:59:59] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2023-03-20 07:59:59] [INFO ] Redundant transitions in 148 ms returned [240]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 761 rows 562 cols
[2023-03-20 07:59:59] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-20 07:59:59] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/563 places, 761/763 transitions.
Applied a total of 0 rules in 18 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1452 ms. Remains : 562/563 places, 761/763 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s143 1) (EQ s160 1) (EQ s170 1)), p1:(OR (EQ s244 0) (EQ s245 0) (EQ s249 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 536 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-02 finished in 1576 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&&X(G(p1)))))'
Support contains 4 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-20 08:00:00] [INFO ] Computed 161 place invariants in 7 ms
[2023-03-20 08:00:00] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-20 08:00:00] [INFO ] Invariant cache hit.
[2023-03-20 08:00:00] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2023-03-20 08:00:00] [INFO ] Invariant cache hit.
[2023-03-20 08:00:01] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1247 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-03 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s449 1), p1:(AND (EQ s283 1) (EQ s298 1) (EQ s310 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-03 finished in 1374 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((G(p0)||((p1||X(X(!p2))) U (G((p1||X(X(!p2))))||(p3&&(p1||X(X(!p2))))))))))'
Support contains 5 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 10 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-20 08:00:01] [INFO ] Invariant cache hit.
[2023-03-20 08:00:01] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-20 08:00:01] [INFO ] Invariant cache hit.
[2023-03-20 08:00:02] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
[2023-03-20 08:00:02] [INFO ] Invariant cache hit.
[2023-03-20 08:00:02] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1190 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 373 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2, (AND p0 (NOT p1) p2), (AND p2 (NOT p0)), p2, true, (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=p2, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 6}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s522 0), p1:(NEQ s522 1), p3:(NEQ s486 1), p2:(AND (EQ s418 1) (EQ s420 1) (EQ s429 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1000 reset in 629 ms.
Product exploration explored 100000 steps with 1060 reset in 744 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 563 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2, (AND p0 (NOT p1) p2), (AND p2 (NOT p0)), p2, true, (AND (NOT p0) p2), (NOT p0)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:00:05] [INFO ] Invariant cache hit.
[2023-03-20 08:00:05] [INFO ] [Real]Absence check using 161 positive place invariants in 26 ms returned sat
[2023-03-20 08:00:06] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-20 08:00:06] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2023-03-20 08:00:06] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-20 08:00:06] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-20 08:00:06] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2023-03-20 08:00:07] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2023-03-20 08:00:07] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2023-03-20 08:00:07] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-20 08:00:07] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2023-03-20 08:00:07] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:00:08] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:00:08] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2023-03-20 08:00:08] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 1 ms to minimize.
[2023-03-20 08:00:08] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 1 ms to minimize.
[2023-03-20 08:00:08] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2023-03-20 08:00:08] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:00:09] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 0 ms to minimize.
[2023-03-20 08:00:09] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2023-03-20 08:00:09] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 1 ms to minimize.
[2023-03-20 08:00:09] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2023-03-20 08:00:09] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 0 ms to minimize.
[2023-03-20 08:00:10] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2023-03-20 08:00:10] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2023-03-20 08:00:10] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2023-03-20 08:00:10] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 0 ms to minimize.
[2023-03-20 08:00:10] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 0 ms to minimize.
[2023-03-20 08:00:10] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2023-03-20 08:00:11] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 1 ms to minimize.
[2023-03-20 08:00:11] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 0 ms to minimize.
[2023-03-20 08:00:11] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2023-03-20 08:00:11] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2023-03-20 08:00:11] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 1 ms to minimize.
[2023-03-20 08:00:12] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2023-03-20 08:00:12] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 0 ms to minimize.
[2023-03-20 08:00:12] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2023-03-20 08:00:12] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 5 ms to minimize.
[2023-03-20 08:00:12] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2023-03-20 08:00:12] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2023-03-20 08:00:12] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 0 ms to minimize.
[2023-03-20 08:00:12] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2023-03-20 08:00:13] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 0 ms to minimize.
[2023-03-20 08:00:13] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 6444 ms
[2023-03-20 08:00:13] [INFO ] After 6901ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-20 08:00:13] [INFO ] After 7074ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 4 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 0 with 81 rules applied. Total rules applied 83 place count 562 transition count 762
Applied a total of 83 rules in 46 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 562/563 places, 762/763 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9670 steps, run visited all 1 properties in 60 ms. (steps per millisecond=161 )
Probabilistic random walk after 9670 steps, saw 9387 distinct states, run finished after 60 ms. (steps per millisecond=161 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p3))), (F (AND p2 (NOT p0))), (F p2), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p0) (NOT p3))), (F (AND p2 p0))]
Knowledge based reduction with 11 factoid took 717 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, p2, true]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, p2, true]
Support contains 4 out of 563 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 9 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-20 08:00:14] [INFO ] Invariant cache hit.
[2023-03-20 08:00:14] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-20 08:00:14] [INFO ] Invariant cache hit.
[2023-03-20 08:00:15] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-20 08:00:15] [INFO ] Invariant cache hit.
[2023-03-20 08:00:15] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1122 ms. Remains : 563/563 places, 763/763 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, p2, true]
Finished random walk after 7078 steps, including 13 resets, run visited all 2 properties in 40 ms. (steps per millisecond=176 )
Knowledge obtained : [(AND p1 (NOT p2)), (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p2)]
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, p2, true]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, p2, true]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, p2, true]
Entered a terminal (fully accepting) state of product in 40381 steps with 453 reset in 177 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-04 finished in 15156 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(F(p0)))'
Support contains 2 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 8 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-20 08:00:16] [INFO ] Invariant cache hit.
[2023-03-20 08:00:16] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-20 08:00:16] [INFO ] Invariant cache hit.
[2023-03-20 08:00:17] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
[2023-03-20 08:00:17] [INFO ] Invariant cache hit.
[2023-03-20 08:00:17] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1211 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s316 0) (EQ s321 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1706 ms.
Product exploration explored 100000 steps with 50000 reset in 1757 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-040A-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-040A-LTLFireability-05 finished in 4812 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 1 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 561 transition count 761
Applied a total of 2 rules in 40 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
// Phase 1: matrix 761 rows 561 cols
[2023-03-20 08:00:21] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-20 08:00:21] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-20 08:00:21] [INFO ] Invariant cache hit.
[2023-03-20 08:00:22] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2023-03-20 08:00:22] [INFO ] Redundant transitions in 136 ms returned [239]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 760 rows 561 cols
[2023-03-20 08:00:22] [INFO ] Computed 161 place invariants in 19 ms
[2023-03-20 08:00:22] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/563 places, 760/763 transitions.
Applied a total of 0 rules in 13 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1407 ms. Remains : 561/563 places, 760/763 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s59 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]]
Stuttering criterion allowed to conclude after 14995 steps with 31 reset in 68 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-06 finished in 1553 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(p1)&&p0)) U G(p2)))'
Support contains 7 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-20 08:00:22] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-20 08:00:23] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-20 08:00:23] [INFO ] Invariant cache hit.
[2023-03-20 08:00:23] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
[2023-03-20 08:00:23] [INFO ] Invariant cache hit.
[2023-03-20 08:00:24] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1240 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (NOT p1), (AND (NOT p2) p0 p1), false]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 4}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={} source=2 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s5 1) (EQ s7 1) (EQ s11 1)), p0:(AND (EQ s486 1) (EQ s490 1) (EQ s499 1)), p1:(NEQ s360 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, 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-040A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-07 finished in 1519 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||G(p1)))))'
Support contains 6 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 27 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 562 cols
[2023-03-20 08:00:24] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-20 08:00:24] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-20 08:00:24] [INFO ] Invariant cache hit.
[2023-03-20 08:00:25] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2023-03-20 08:00:25] [INFO ] Redundant transitions in 123 ms returned [240]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 761 rows 562 cols
[2023-03-20 08:00:25] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-20 08:00:25] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/563 places, 761/763 transitions.
Applied a total of 0 rules in 13 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1311 ms. Remains : 562/563 places, 761/763 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s502 1) (NEQ s506 1) (NEQ s513 1)), p0:(AND (EQ s460 1) (EQ s462 1) (EQ s471 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 198 reset in 456 ms.
Product exploration explored 100000 steps with 210 reset in 562 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 157 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 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 15 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 179 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 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 20 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2023-03-20 08:00:27] [INFO ] Invariant cache hit.
[2023-03-20 08:00:27] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-20 08:00:27] [INFO ] Invariant cache hit.
[2023-03-20 08:00:28] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
[2023-03-20 08:00:28] [INFO ] Redundant transitions in 152 ms returned []
[2023-03-20 08:00:28] [INFO ] Invariant cache hit.
[2023-03-20 08:00:29] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1542 ms. Remains : 562/562 places, 761/761 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 136 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 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 28 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 165 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 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 209 reset in 450 ms.
Product exploration explored 100000 steps with 206 reset in 493 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 29 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2023-03-20 08:00:30] [INFO ] Invariant cache hit.
[2023-03-20 08:00:30] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-20 08:00:30] [INFO ] Invariant cache hit.
[2023-03-20 08:00:31] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
[2023-03-20 08:00:31] [INFO ] Redundant transitions in 105 ms returned []
[2023-03-20 08:00:31] [INFO ] Invariant cache hit.
[2023-03-20 08:00:31] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1366 ms. Remains : 562/562 places, 761/761 transitions.
Treatment of property ShieldRVs-PT-040A-LTLFireability-08 finished in 7524 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)))'
Support contains 3 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 20 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 562 cols
[2023-03-20 08:00:32] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-20 08:00:32] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-20 08:00:32] [INFO ] Invariant cache hit.
[2023-03-20 08:00:32] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
[2023-03-20 08:00:32] [INFO ] Redundant transitions in 142 ms returned [240]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 761 rows 562 cols
[2023-03-20 08:00:32] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-20 08:00:33] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/563 places, 761/763 transitions.
Applied a total of 0 rules in 20 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1337 ms. Remains : 562/563 places, 761/763 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s59 1) (NEQ s76 1) (NEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 186 reset in 442 ms.
Product exploration explored 100000 steps with 186 reset in 503 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 1529 steps, including 2 resets, run visited all 1 properties in 12 ms. (steps per millisecond=127 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 3 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 28 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2023-03-20 08:00:34] [INFO ] Invariant cache hit.
[2023-03-20 08:00:35] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-20 08:00:35] [INFO ] Invariant cache hit.
[2023-03-20 08:00:35] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2023-03-20 08:00:35] [INFO ] Redundant transitions in 124 ms returned []
[2023-03-20 08:00:35] [INFO ] Invariant cache hit.
[2023-03-20 08:00:36] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1417 ms. Remains : 562/562 places, 761/761 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 460 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=115 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 186 reset in 417 ms.
Product exploration explored 100000 steps with 186 reset in 488 ms.
Support contains 3 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 11 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2023-03-20 08:00:37] [INFO ] Invariant cache hit.
[2023-03-20 08:00:37] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-20 08:00:37] [INFO ] Invariant cache hit.
[2023-03-20 08:00:38] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
[2023-03-20 08:00:38] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-20 08:00:38] [INFO ] Invariant cache hit.
[2023-03-20 08:00:38] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1384 ms. Remains : 562/562 places, 761/761 transitions.
Treatment of property ShieldRVs-PT-040A-LTLFireability-09 finished in 6869 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(G(p0))) U (p1||F(p2))))'
Support contains 5 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 6 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-20 08:00:38] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-20 08:00:39] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-20 08:00:39] [INFO ] Invariant cache hit.
[2023-03-20 08:00:39] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-20 08:00:39] [INFO ] Invariant cache hit.
[2023-03-20 08:00:39] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1104 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s201 1), p2:(AND (EQ s194 1) (EQ s196 1) (EQ s205 1)), p0:(EQ s169 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 577 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-10 finished in 1244 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 3 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 11 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-20 08:00:40] [INFO ] Invariant cache hit.
[2023-03-20 08:00:40] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-20 08:00:40] [INFO ] Invariant cache hit.
[2023-03-20 08:00:40] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-20 08:00:40] [INFO ] Invariant cache hit.
[2023-03-20 08:00:41] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1118 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s544 0) (EQ s548 0) (EQ s555 0))], 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 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-11 finished in 1232 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(G(p1))||(F(p3)&&p2)||p0)))'
Support contains 8 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 6 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-20 08:00:41] [INFO ] Invariant cache hit.
[2023-03-20 08:00:41] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-20 08:00:41] [INFO ] Invariant cache hit.
[2023-03-20 08:00:42] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
[2023-03-20 08:00:42] [INFO ] Invariant cache hit.
[2023-03-20 08:00:42] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1257 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(OR (EQ s428 0) (EQ s433 0)), p0:(OR (EQ s3 0) (EQ s20 0) (EQ s30 0)), p2:(AND (EQ s428 1) (EQ s433 1)), p1:(AND (EQ s258 1) (EQ s259 1) (EQ s264 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 50000 reset in 1655 ms.
Product exploration explored 100000 steps with 50000 reset in 1936 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 6 factoid took 159 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-040A-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-040A-LTLFireability-12 finished in 5213 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(p1)||p0))||F(p2))))'
Support contains 12 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-20 08:00:46] [INFO ] Invariant cache hit.
[2023-03-20 08:00:46] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-20 08:00:46] [INFO ] Invariant cache hit.
[2023-03-20 08:00:47] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
[2023-03-20 08:00:47] [INFO ] Invariant cache hit.
[2023-03-20 08:00:47] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1364 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s257 1) (EQ s259 1) (EQ s263 1) (EQ s276 1) (EQ s280 1) (EQ s289 1)), p0:(OR (AND (EQ s367 1) (EQ s384 1) (EQ s394 1)) (EQ s495 1)), p1:(AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 536 reset in 436 ms.
Product exploration explored 100000 steps with 535 reset in 499 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 172 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=172 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-20 08:00:49] [INFO ] Invariant cache hit.
[2023-03-20 08:00:50] [INFO ] [Real]Absence check using 161 positive place invariants in 62 ms returned sat
[2023-03-20 08:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 08:00:50] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2023-03-20 08:00:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 08:00:51] [INFO ] [Nat]Absence check using 161 positive place invariants in 43 ms returned sat
[2023-03-20 08:00:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 08:00:51] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2023-03-20 08:00:51] [INFO ] Computed and/alt/rep : 371/1384/371 causal constraints (skipped 391 transitions) in 43 ms.
[2023-03-20 08:00:54] [INFO ] Added : 265 causal constraints over 54 iterations in 2523 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 8 out of 563 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 6 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-20 08:00:54] [INFO ] Invariant cache hit.
[2023-03-20 08:00:54] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-20 08:00:54] [INFO ] Invariant cache hit.
[2023-03-20 08:00:54] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2023-03-20 08:00:54] [INFO ] Invariant cache hit.
[2023-03-20 08:00:55] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1109 ms. Remains : 563/563 places, 763/763 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 61 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 194 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=97 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-20 08:00:55] [INFO ] Invariant cache hit.
[2023-03-20 08:00:56] [INFO ] [Real]Absence check using 161 positive place invariants in 59 ms returned sat
[2023-03-20 08:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 08:00:56] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2023-03-20 08:00:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 08:00:57] [INFO ] [Nat]Absence check using 161 positive place invariants in 43 ms returned sat
[2023-03-20 08:00:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 08:00:57] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2023-03-20 08:00:57] [INFO ] Computed and/alt/rep : 371/1384/371 causal constraints (skipped 391 transitions) in 50 ms.
[2023-03-20 08:01:00] [INFO ] Added : 265 causal constraints over 54 iterations in 2306 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 532 reset in 457 ms.
Product exploration explored 100000 steps with 535 reset in 501 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 563 transition count 763
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 54 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-20 08:01:01] [INFO ] Redundant transitions in 244 ms returned [241]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 762 rows 563 cols
[2023-03-20 08:01:01] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-20 08:01:02] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 563/563 places, 762/763 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 25 ms. Remains 563 /563 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 735 ms. Remains : 563/563 places, 762/763 transitions.
Support contains 8 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 17 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-20 08:01:02] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-20 08:01:02] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-20 08:01:02] [INFO ] Invariant cache hit.
[2023-03-20 08:01:02] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2023-03-20 08:01:03] [INFO ] Invariant cache hit.
[2023-03-20 08:01:03] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1206 ms. Remains : 563/563 places, 763/763 transitions.
Treatment of property ShieldRVs-PT-040A-LTLFireability-14 finished in 16880 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((p0||X(G(p1))))&&F(p2)))'
Support contains 9 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 6 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-20 08:01:03] [INFO ] Invariant cache hit.
[2023-03-20 08:01:03] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-20 08:01:03] [INFO ] Invariant cache hit.
[2023-03-20 08:01:04] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2023-03-20 08:01:04] [INFO ] Invariant cache hit.
[2023-03-20 08:01:04] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1068 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(AND (EQ s206 1) (EQ s210 1) (EQ s219 1)), p2:(AND (EQ s213 1) (EQ s228 1) (EQ s240 1)), p0:(AND (EQ s222 1) (EQ s224 1) (EQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-15 finished in 1201 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||G(p1)))))'
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)))'
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(p1)||p0))||F(p2))))'
[2023-03-20 08:01:05] [INFO ] Flatten gal took : 87 ms
[2023-03-20 08:01:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 08:01:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 563 places, 763 transitions and 3680 arcs took 10 ms.
Total runtime 83916 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1910/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1910/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1910/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVs-PT-040A-LTLFireability-08
Could not compute solution for formula : ShieldRVs-PT-040A-LTLFireability-09
Could not compute solution for formula : ShieldRVs-PT-040A-LTLFireability-14

BK_STOP 1679299266246

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldRVs-PT-040A-LTLFireability-08
ltl formula formula --ltl=/tmp/1910/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 563 places, 763 transitions and 3680 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.030 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1910/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1910/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1910/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1910/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldRVs-PT-040A-LTLFireability-09
ltl formula formula --ltl=/tmp/1910/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 563 places, 763 transitions and 3680 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.020 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1910/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1910/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1910/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1910/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldRVs-PT-040A-LTLFireability-14
ltl formula formula --ltl=/tmp/1910/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 563 places, 763 transitions and 3680 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.010 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1910/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1910/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1910/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1910/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-040A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldRVs-PT-040A, 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 r425-tajo-167905977800132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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