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-167905978000268.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 ShieldRVt-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978000268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.2K Feb 25 22:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 22:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 22:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 22:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 22:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 119K 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 ShieldRVt-PT-010B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679306226159

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=ShieldRVt-PT-010B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 09:57:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 09:57:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 09:57:08] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-20 09:57:08] [INFO ] Transformed 503 places.
[2023-03-20 09:57:08] [INFO ] Transformed 503 transitions.
[2023-03-20 09:57:08] [INFO ] Found NUPN structural information;
[2023-03-20 09:57:08] [INFO ] Parsed PT model containing 503 places and 503 transitions and 1186 arcs in 150 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 4 formulas.
FORMULA ShieldRVt-PT-010B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 503/503 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 99 place count 404 transition count 404
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 404 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 199 place count 403 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 403 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 201 place count 402 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 202 place count 402 transition count 402
Applied a total of 202 rules in 98 ms. Remains 402 /503 variables (removed 101) and now considering 402/503 (removed 101) transitions.
// Phase 1: matrix 402 rows 402 cols
[2023-03-20 09:57:08] [INFO ] Computed 41 place invariants in 28 ms
[2023-03-20 09:57:08] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-20 09:57:08] [INFO ] Invariant cache hit.
[2023-03-20 09:57:08] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2023-03-20 09:57:08] [INFO ] Invariant cache hit.
[2023-03-20 09:57:09] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 402/503 places, 402/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 878 ms. Remains : 402/503 places, 402/503 transitions.
Support contains 36 out of 402 places after structural reductions.
[2023-03-20 09:57:09] [INFO ] Flatten gal took : 51 ms
[2023-03-20 09:57:09] [INFO ] Flatten gal took : 20 ms
[2023-03-20 09:57:09] [INFO ] Input system was already deterministic with 402 transitions.
Finished random walk after 7905 steps, including 2 resets, run visited all 32 properties in 334 ms. (steps per millisecond=23 )
FORMULA ShieldRVt-PT-010B-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 123 stabilizing places and 123 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' '!(X(G((p0&&(p1 U (p2||G(p1)))))))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 391 transition count 391
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 391 transition count 391
Applied a total of 22 rules in 26 ms. Remains 391 /402 variables (removed 11) and now considering 391/402 (removed 11) transitions.
// Phase 1: matrix 391 rows 391 cols
[2023-03-20 09:57:10] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-20 09:57:10] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-20 09:57:10] [INFO ] Invariant cache hit.
[2023-03-20 09:57:10] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-20 09:57:10] [INFO ] Invariant cache hit.
[2023-03-20 09:57:10] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 391/402 places, 391/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 391/402 places, 391/402 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s183 1), p2:(AND (NEQ s291 1) (NEQ s98 1)), p1:(NEQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-01 finished in 823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((F(p1)||G(!p2)))&&p0)))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 392 transition count 392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 392 transition count 392
Applied a total of 20 rules in 14 ms. Remains 392 /402 variables (removed 10) and now considering 392/402 (removed 10) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-20 09:57:11] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-20 09:57:11] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-20 09:57:11] [INFO ] Invariant cache hit.
[2023-03-20 09:57:11] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-20 09:57:11] [INFO ] Invariant cache hit.
[2023-03-20 09:57:11] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/402 places, 392/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 498 ms. Remains : 392/402 places, 392/402 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s109 1) (NEQ s163 1)), p1:(NEQ s109 1), p2:(OR (EQ s109 1) (EQ s163 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 423 ms.
Product exploration explored 100000 steps with 50000 reset in 429 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/392 stabilizing places and 119/392 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 (NOT p2))
Knowledge based reduction with 12 factoid took 374 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-010B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-010B-LTLFireability-02 finished in 1867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U (!p0 U X(p1)))&&X(p2))))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 392 transition count 392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 392 transition count 392
Applied a total of 20 rules in 12 ms. Remains 392 /402 variables (removed 10) and now considering 392/402 (removed 10) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-20 09:57:12] [INFO ] Computed 41 place invariants in 4 ms
[2023-03-20 09:57:13] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-20 09:57:13] [INFO ] Invariant cache hit.
[2023-03-20 09:57:13] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-20 09:57:13] [INFO ] Invariant cache hit.
[2023-03-20 09:57:13] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/402 places, 392/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 590 ms. Remains : 392/402 places, 392/402 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(NEQ s337 1), p1:(EQ s207 1), p2:(EQ s329 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 457 reset in 248 ms.
Product exploration explored 100000 steps with 1382 reset in 280 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/392 stabilizing places and 119/392 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 917 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Finished random walk after 107 steps, including 0 resets, run visited all 6 properties in 9 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 1281 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
[2023-03-20 09:57:17] [INFO ] Invariant cache hit.
[2023-03-20 09:57:17] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned sat
[2023-03-20 09:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:57:17] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2023-03-20 09:57:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 09:57:17] [INFO ] [Nat]Absence check using 41 positive place invariants in 16 ms returned sat
[2023-03-20 09:57:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 09:57:18] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2023-03-20 09:57:18] [INFO ] Computed and/alt/rep : 391/572/391 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-20 09:57:20] [INFO ] Added : 386 causal constraints over 78 iterations in 2407 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-20 09:57:20] [INFO ] Invariant cache hit.
[2023-03-20 09:57:20] [INFO ] [Real]Absence check using 41 positive place invariants in 13 ms returned sat
[2023-03-20 09:57:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:57:21] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2023-03-20 09:57:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 09:57:21] [INFO ] [Nat]Absence check using 41 positive place invariants in 10 ms returned sat
[2023-03-20 09:57:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 09:57:21] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2023-03-20 09:57:21] [INFO ] Computed and/alt/rep : 391/572/391 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-20 09:57:24] [INFO ] Added : 389 causal constraints over 78 iterations in 2442 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 392/392 transitions.
Applied a total of 0 rules in 9 ms. Remains 392 /392 variables (removed 0) and now considering 392/392 (removed 0) transitions.
[2023-03-20 09:57:24] [INFO ] Invariant cache hit.
[2023-03-20 09:57:24] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-20 09:57:24] [INFO ] Invariant cache hit.
[2023-03-20 09:57:24] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-20 09:57:24] [INFO ] Invariant cache hit.
[2023-03-20 09:57:24] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 392/392 places, 392/392 transitions.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/392 stabilizing places and 119/392 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 832 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Finished random walk after 57 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 1148 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
[2023-03-20 09:57:27] [INFO ] Invariant cache hit.
[2023-03-20 09:57:27] [INFO ] [Real]Absence check using 41 positive place invariants in 15 ms returned sat
[2023-03-20 09:57:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:57:27] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2023-03-20 09:57:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 09:57:27] [INFO ] [Nat]Absence check using 41 positive place invariants in 14 ms returned sat
[2023-03-20 09:57:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 09:57:28] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2023-03-20 09:57:28] [INFO ] Computed and/alt/rep : 391/572/391 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-20 09:57:30] [INFO ] Added : 386 causal constraints over 78 iterations in 2408 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-20 09:57:30] [INFO ] Invariant cache hit.
[2023-03-20 09:57:30] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned sat
[2023-03-20 09:57:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:57:31] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2023-03-20 09:57:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 09:57:31] [INFO ] [Nat]Absence check using 41 positive place invariants in 12 ms returned sat
[2023-03-20 09:57:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 09:57:31] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2023-03-20 09:57:31] [INFO ] Computed and/alt/rep : 391/572/391 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-20 09:57:34] [INFO ] Added : 389 causal constraints over 78 iterations in 2547 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 976 reset in 330 ms.
Stack based approach found an accepted trace after 29224 steps with 391 reset with depth 217 and stack size 217 in 83 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-03 finished in 21794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 392 transition count 392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 392 transition count 392
Applied a total of 20 rules in 14 ms. Remains 392 /402 variables (removed 10) and now considering 392/402 (removed 10) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-20 09:57:34] [INFO ] Computed 41 place invariants in 13 ms
[2023-03-20 09:57:34] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-20 09:57:34] [INFO ] Invariant cache hit.
[2023-03-20 09:57:35] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2023-03-20 09:57:35] [INFO ] Invariant cache hit.
[2023-03-20 09:57:35] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/402 places, 392/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 685 ms. Remains : 392/402 places, 392/402 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s329 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][false, false, false, false]]
Product exploration explored 100000 steps with 1506 reset in 221 ms.
Product exploration explored 100000 steps with 1513 reset in 282 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/392 stabilizing places and 119/392 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 97 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=97 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 245 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-20 09:57:37] [INFO ] Invariant cache hit.
[2023-03-20 09:57:37] [INFO ] [Real]Absence check using 41 positive place invariants in 37 ms returned sat
[2023-03-20 09:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:57:37] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2023-03-20 09:57:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 09:57:37] [INFO ] [Nat]Absence check using 41 positive place invariants in 15 ms returned sat
[2023-03-20 09:57:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 09:57:38] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2023-03-20 09:57:38] [INFO ] Computed and/alt/rep : 391/573/391 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-20 09:57:40] [INFO ] Added : 389 causal constraints over 78 iterations in 2137 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 392/392 transitions.
Applied a total of 0 rules in 8 ms. Remains 392 /392 variables (removed 0) and now considering 392/392 (removed 0) transitions.
[2023-03-20 09:57:40] [INFO ] Invariant cache hit.
[2023-03-20 09:57:40] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-20 09:57:40] [INFO ] Invariant cache hit.
[2023-03-20 09:57:40] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-20 09:57:40] [INFO ] Invariant cache hit.
[2023-03-20 09:57:40] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 392/392 places, 392/392 transitions.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/392 stabilizing places and 119/392 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 72 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=72 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-20 09:57:41] [INFO ] Invariant cache hit.
[2023-03-20 09:57:41] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned sat
[2023-03-20 09:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:57:42] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2023-03-20 09:57:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 09:57:42] [INFO ] [Nat]Absence check using 41 positive place invariants in 14 ms returned sat
[2023-03-20 09:57:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 09:57:42] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2023-03-20 09:57:42] [INFO ] Computed and/alt/rep : 391/573/391 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-20 09:57:44] [INFO ] Added : 389 causal constraints over 78 iterations in 2241 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1512 reset in 241 ms.
Product exploration explored 100000 steps with 1532 reset in 218 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 392/392 transitions.
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 392 transition count 392
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 108 place count 392 transition count 432
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 149 place count 392 transition count 432
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 268 places in 0 ms
Iterating global reduction 1 with 119 rules applied. Total rules applied 268 place count 392 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 269 place count 392 transition count 431
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 347 place count 314 transition count 353
Deduced a syphon composed of 190 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 425 place count 314 transition count 353
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 191 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 426 place count 314 transition count 353
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 428 place count 312 transition count 351
Deduced a syphon composed of 189 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 430 place count 312 transition count 351
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -277
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 469 place count 312 transition count 628
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 508 place count 273 transition count 550
Deduced a syphon composed of 189 places in 1 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 547 place count 273 transition count 550
Deduced a syphon composed of 189 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 550 place count 273 transition count 547
Deduced a syphon composed of 189 places in 0 ms
Applied a total of 550 rules in 188 ms. Remains 273 /392 variables (removed 119) and now considering 547/392 (removed -155) transitions.
[2023-03-20 09:57:46] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 547 rows 273 cols
[2023-03-20 09:57:46] [INFO ] Computed 41 place invariants in 21 ms
[2023-03-20 09:57:46] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/392 places, 547/392 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 480 ms. Remains : 273/392 places, 547/392 transitions.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 392/392 transitions.
Applied a total of 0 rules in 13 ms. Remains 392 /392 variables (removed 0) and now considering 392/392 (removed 0) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-20 09:57:46] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-20 09:57:46] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-20 09:57:46] [INFO ] Invariant cache hit.
[2023-03-20 09:57:46] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-20 09:57:46] [INFO ] Invariant cache hit.
[2023-03-20 09:57:46] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 523 ms. Remains : 392/392 places, 392/392 transitions.
Treatment of property ShieldRVt-PT-010B-LTLFireability-04 finished in 12161 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((F(G(p0)) U p1)))))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 392 transition count 392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 392 transition count 392
Applied a total of 20 rules in 30 ms. Remains 392 /402 variables (removed 10) and now considering 392/402 (removed 10) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-20 09:57:46] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-20 09:57:47] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-20 09:57:47] [INFO ] Invariant cache hit.
[2023-03-20 09:57:47] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-20 09:57:47] [INFO ] Invariant cache hit.
[2023-03-20 09:57:47] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/402 places, 392/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 533 ms. Remains : 392/402 places, 392/402 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s71 1), p0:(EQ s271 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4641 steps with 0 reset in 15 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-05 finished in 826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&G((F(p1)&&F(G(p2)))))))))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 391 transition count 391
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 391 transition count 391
Applied a total of 22 rules in 15 ms. Remains 391 /402 variables (removed 11) and now considering 391/402 (removed 11) transitions.
// Phase 1: matrix 391 rows 391 cols
[2023-03-20 09:57:47] [INFO ] Computed 41 place invariants in 5 ms
[2023-03-20 09:57:47] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-20 09:57:47] [INFO ] Invariant cache hit.
[2023-03-20 09:57:48] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-20 09:57:48] [INFO ] Invariant cache hit.
[2023-03-20 09:57:48] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 391/402 places, 391/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 609 ms. Remains : 391/402 places, 391/402 transitions.
Stuttering acceptance computed with spot in 411 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 6}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s254 0), p1:(EQ s86 0), p2:(EQ s99 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 255 ms.
Stack based approach found an accepted trace after 21931 steps with 8 reset with depth 5897 and stack size 5694 in 63 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-06 finished in 1360 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)) U p1))'
Support contains 4 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 401 transition count 290
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 222 place count 290 transition count 290
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 222 place count 290 transition count 216
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 370 place count 216 transition count 216
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 378 place count 208 transition count 208
Iterating global reduction 2 with 8 rules applied. Total rules applied 386 place count 208 transition count 208
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 386 place count 208 transition count 203
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 396 place count 203 transition count 203
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 568 place count 117 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 569 place count 117 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 571 place count 116 transition count 115
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 629 place count 87 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 631 place count 85 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 632 place count 84 transition count 140
Applied a total of 632 rules in 38 ms. Remains 84 /402 variables (removed 318) and now considering 140/402 (removed 262) transitions.
// Phase 1: matrix 140 rows 84 cols
[2023-03-20 09:57:49] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-20 09:57:49] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-20 09:57:49] [INFO ] Invariant cache hit.
[2023-03-20 09:57:49] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-20 09:57:49] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 09:57:49] [INFO ] Invariant cache hit.
[2023-03-20 09:57:49] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/402 places, 140/402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 84/402 places, 140/402 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s45 1) (EQ s47 1) (EQ s51 1)), p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-07 finished in 420 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(F(p0))||(p1&&X(F(p2))))))'
Support contains 7 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 392 transition count 392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 392 transition count 392
Applied a total of 20 rules in 11 ms. Remains 392 /402 variables (removed 10) and now considering 392/402 (removed 10) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-20 09:57:49] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-20 09:57:49] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-20 09:57:49] [INFO ] Invariant cache hit.
[2023-03-20 09:57:49] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-20 09:57:49] [INFO ] Invariant cache hit.
[2023-03-20 09:57:50] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/402 places, 392/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 520 ms. Remains : 392/402 places, 392/402 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s62 1) (EQ s66 1) (EQ s79 1)), p1:(EQ s101 1), p2:(AND (EQ s194 1) (EQ s203 1) (EQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1370 steps with 0 reset in 4 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-08 finished in 804 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((F(G((X(p0) U p1)))&&G(G(p2)))))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 392 transition count 392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 392 transition count 392
Applied a total of 20 rules in 15 ms. Remains 392 /402 variables (removed 10) and now considering 392/402 (removed 10) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-20 09:57:50] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-20 09:57:50] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-20 09:57:50] [INFO ] Invariant cache hit.
[2023-03-20 09:57:50] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2023-03-20 09:57:50] [INFO ] Invariant cache hit.
[2023-03-20 09:57:50] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/402 places, 392/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 607 ms. Remains : 392/402 places, 392/402 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s367 0), p1:(NEQ s85 1), p0:(EQ s367 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4 reset in 289 ms.
Stack based approach found an accepted trace after 288 steps with 0 reset with depth 289 and stack size 289 in 1 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-09 finished in 1070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||G((p1&&(p1 U (p2||G(p1)))))))))))'
Support contains 2 out of 402 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 393 transition count 393
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 393 transition count 393
Applied a total of 18 rules in 13 ms. Remains 393 /402 variables (removed 9) and now considering 393/402 (removed 9) transitions.
// Phase 1: matrix 393 rows 393 cols
[2023-03-20 09:57:51] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-20 09:57:51] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-20 09:57:51] [INFO ] Invariant cache hit.
[2023-03-20 09:57:51] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-20 09:57:51] [INFO ] Invariant cache hit.
[2023-03-20 09:57:52] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 393/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 616 ms. Remains : 393/402 places, 393/402 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s264 1), p0:(EQ s115 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 66148 steps with 32 reset in 169 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-10 finished in 978 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)||((p1&&X(X(p2))) U X(X(p3)))))'
Support contains 4 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 392 transition count 392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 392 transition count 392
Applied a total of 20 rules in 11 ms. Remains 392 /402 variables (removed 10) and now considering 392/402 (removed 10) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-20 09:57:52] [INFO ] Computed 41 place invariants in 4 ms
[2023-03-20 09:57:52] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-20 09:57:52] [INFO ] Invariant cache hit.
[2023-03-20 09:57:52] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-20 09:57:52] [INFO ] Invariant cache hit.
[2023-03-20 09:57:53] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/402 places, 392/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 783 ms. Remains : 392/402 places, 392/402 transitions.
Stuttering acceptance computed with spot in 720 ms :[(AND (NOT p0) (NOT p3)), true, (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 12}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 p1), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 11}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 2}], [{ cond=(AND p0 (NOT p3) p2), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 12}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=7 dest: 10}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=7 dest: 11}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 12}], [{ cond=p1, acceptance={} source=8 dest: 10}, { cond=(NOT p1), acceptance={} source=8 dest: 11}], [{ cond=true, acceptance={} source=9 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=10 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=10 dest: 10}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=10 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=11 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=11 dest: 2}], [{ cond=(NOT p0), acceptance={} source=12 dest: 1}, { cond=p0, acceptance={} source=12 dest: 12}]], initial=3, aps=[p0:(EQ s311 1), p3:(EQ s203 1), p1:(EQ s152 1), p2:(NEQ s259 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, null, null, null, null, null, null, null][false, false, false, false, false, false, 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 ShieldRVt-PT-010B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-15 finished in 1546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : ShieldRVt-PT-010B-LTLFireability-04
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 401 transition count 291
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 220 place count 291 transition count 291
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 220 place count 291 transition count 214
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 374 place count 214 transition count 214
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 382 place count 206 transition count 206
Iterating global reduction 2 with 8 rules applied. Total rules applied 390 place count 206 transition count 206
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 390 place count 206 transition count 201
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 400 place count 201 transition count 201
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 572 place count 115 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 573 place count 115 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 575 place count 114 transition count 113
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 633 place count 85 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 635 place count 83 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 636 place count 82 transition count 139
Applied a total of 636 rules in 32 ms. Remains 82 /402 variables (removed 320) and now considering 139/402 (removed 263) transitions.
// Phase 1: matrix 139 rows 82 cols
[2023-03-20 09:57:54] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-20 09:57:54] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-20 09:57:54] [INFO ] Invariant cache hit.
[2023-03-20 09:57:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 09:57:54] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-20 09:57:54] [INFO ] Invariant cache hit.
[2023-03-20 09:57:54] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 82/402 places, 139/402 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 357 ms. Remains : 82/402 places, 139/402 transitions.
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s69 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property ShieldRVt-PT-010B-LTLFireability-04 finished in 683 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-20 09:57:54] [INFO ] Flatten gal took : 39 ms
[2023-03-20 09:57:54] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 09:57:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 402 places, 402 transitions and 984 arcs took 5 ms.
Total runtime 46700 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1540/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVt-PT-010B-LTLFireability-04

BK_STOP 1679306275247

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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 ShieldRVt-PT-010B-LTLFireability-04
ltl formula formula --ltl=/tmp/1540/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 402 places, 402 transitions and 984 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.070 real 0.010 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1540/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1540/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1540/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1540/ltl_0_
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:
0: pnml2lts-mc(+0xa23f4) [0x55e9cdb003f4]
1: pnml2lts-mc(+0xa2496) [0x55e9cdb00496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f74867be140]
3: pnml2lts-mc(+0x405be5) [0x55e9cde63be5]
4: pnml2lts-mc(+0x16b3f9) [0x55e9cdbc93f9]
5: pnml2lts-mc(+0x164ac4) [0x55e9cdbc2ac4]
6: pnml2lts-mc(+0x272e0a) [0x55e9cdcd0e0a]
7: pnml2lts-mc(+0xb61f0) [0x55e9cdb141f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f74866114d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f748661167a]
10: pnml2lts-mc(+0xa1581) [0x55e9cdaff581]
11: pnml2lts-mc(+0xa1910) [0x55e9cdaff910]
12: pnml2lts-mc(+0xa32a2) [0x55e9cdb012a2]
13: pnml2lts-mc(+0xa50f4) [0x55e9cdb030f4]
14: pnml2lts-mc(+0xa516b) [0x55e9cdb0316b]
15: pnml2lts-mc(+0x3f34b3) [0x55e9cde514b3]
16: pnml2lts-mc(+0x7c63d) [0x55e9cdada63d]
17: pnml2lts-mc(+0x67d86) [0x55e9cdac5d86]
18: pnml2lts-mc(+0x60a8a) [0x55e9cdabea8a]
19: pnml2lts-mc(+0x5eb15) [0x55e9cdabcb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f74865f9d0a]
21: pnml2lts-mc(+0x6075e) [0x55e9cdabe75e]

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-010B"
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 ShieldRVt-PT-010B, 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-167905978000268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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