About the Execution of LoLa+red for ShieldPPPt-PT-030A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
618.252 | 64019.00 | 94004.00 | 51.80 | TFFTFFFFFFFFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715500644.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldPPPt-PT-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715500644
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 7.4K Feb 25 21:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 21:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 20:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 20:58 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.9K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 21:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 25 21:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 201K 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 ShieldPPPt-PT-030A-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679279501919
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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:31:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 02:31:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:31:44] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-20 02:31:44] [INFO ] Transformed 753 places.
[2023-03-20 02:31:44] [INFO ] Transformed 543 transitions.
[2023-03-20 02:31:44] [INFO ] Found NUPN structural information;
[2023-03-20 02:31:44] [INFO ] Parsed PT model containing 753 places and 543 transitions and 2166 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-030A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 89 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2023-03-20 02:31:45] [INFO ] Computed 331 place invariants in 19 ms
[2023-03-20 02:31:46] [INFO ] Implicit Places using invariants in 1239 ms returned []
[2023-03-20 02:31:46] [INFO ] Invariant cache hit.
[2023-03-20 02:31:47] [INFO ] Implicit Places using invariants and state equation in 1321 ms returned []
Implicit Place search using SMT with State Equation took 2607 ms to find 0 implicit places.
[2023-03-20 02:31:47] [INFO ] Invariant cache hit.
[2023-03-20 02:31:48] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3073 ms. Remains : 753/753 places, 542/542 transitions.
Support contains 59 out of 753 places after structural reductions.
[2023-03-20 02:31:48] [INFO ] Flatten gal took : 108 ms
[2023-03-20 02:31:48] [INFO ] Flatten gal took : 81 ms
[2023-03-20 02:31:48] [INFO ] Input system was already deterministic with 542 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 33) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-20 02:31:49] [INFO ] Invariant cache hit.
[2023-03-20 02:31:50] [INFO ] [Real]Absence check using 331 positive place invariants in 83 ms returned sat
[2023-03-20 02:31:53] [INFO ] After 2440ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:24
[2023-03-20 02:31:53] [INFO ] After 2600ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-20 02:31:53] [INFO ] After 3856ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-20 02:31:54] [INFO ] [Nat]Absence check using 331 positive place invariants in 118 ms returned sat
[2023-03-20 02:31:56] [INFO ] After 1930ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-20 02:31:58] [INFO ] After 4334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 1863 ms.
[2023-03-20 02:32:00] [INFO ] After 7524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Fused 25 Parikh solutions to 24 different solutions.
Finished Parikh walk after 937 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=117 )
Parikh walk visited 25 properties in 337 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((X(!(p0 U p1))||(X(p1)&&(X(p2) U G(p0)))))'
Support contains 6 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 103 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-20 02:32:01] [INFO ] Invariant cache hit.
[2023-03-20 02:32:02] [INFO ] Implicit Places using invariants in 628 ms returned []
[2023-03-20 02:32:02] [INFO ] Invariant cache hit.
[2023-03-20 02:32:03] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1515 ms to find 0 implicit places.
[2023-03-20 02:32:03] [INFO ] Invariant cache hit.
[2023-03-20 02:32:03] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2229 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 1040 ms :[(AND (NOT p0) p1), false, (AND p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (OR (AND p0 p1) (AND p1 p2)), true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2), (AND (NOT p0) p2 p1)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 7}, { cond=p1, acceptance={} source=3 dest: 8}, { cond=(AND p0 p1), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 11}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(OR (AND p0 p1) (AND p1 p2)), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}, { cond=(NOT p0), acceptance={0} source=8 dest: 8}, { cond=p0, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p0) p2), acceptance={} source=10 dest: 6}, { cond=(AND p0 p2), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=11 dest: 6}, { cond=(AND p0 p1 p2), acceptance={} source=11 dest: 10}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (EQ s17 1) (EQ s19 1)), p1:(AND (EQ s113 1) (EQ s127 1)), p2:(AND (EQ s404 1) (EQ s423 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1637 ms.
Product exploration explored 100000 steps with 50000 reset in 1504 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 p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 p2)))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 p1) (AND p1 p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 27 factoid took 949 ms. Reduced automaton from 12 states, 29 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030A-LTLFireability-00 finished in 7483 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 U (!p2&&X(p3)))))'
Support contains 7 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 12 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-20 02:32:08] [INFO ] Invariant cache hit.
[2023-03-20 02:32:09] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-20 02:32:09] [INFO ] Invariant cache hit.
[2023-03-20 02:32:10] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1649 ms to find 0 implicit places.
[2023-03-20 02:32:10] [INFO ] Invariant cache hit.
[2023-03-20 02:32:11] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2044 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 399 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (OR (NOT p3) p2), (NOT p3), (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 7}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p2 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2 p1 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2 p1 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 p1), acceptance={0} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 7}], [{ cond=(NOT p3), acceptance={} source=6 dest: 4}], [{ cond=(AND p2 p1 (NOT p3)), acceptance={0} source=7 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s32 1) (EQ s34 1)), p2:(AND (EQ s256 1) (EQ s271 1)), p1:(AND (EQ s487 1) (EQ s489 1)), p3:(NEQ s420 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1414 ms.
Product exploration explored 100000 steps with 50000 reset in 1395 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 p0) (NOT p2) (NOT p1) p3), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p2 p1 (NOT p3)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 p2 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p2 p1 (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X p3), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3))))), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 p1 (NOT p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p3)
Knowledge based reduction with 58 factoid took 1947 ms. Reduced automaton from 8 states, 30 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030A-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030A-LTLFireability-03 finished in 7232 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(((G(p1)&&p0)||(p2&&X(F(p3)))))))'
Support contains 6 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 80 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2023-03-20 02:32:16] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-20 02:32:16] [INFO ] Implicit Places using invariants in 555 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 572 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 37 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-20 02:32:16] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-20 02:32:17] [INFO ] Implicit Places using invariants in 545 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 547 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 31 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-20 02:32:17] [INFO ] Computed 328 place invariants in 7 ms
[2023-03-20 02:32:17] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-20 02:32:17] [INFO ] Invariant cache hit.
[2023-03-20 02:32:18] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2588 ms. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 532 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s699 1) (EQ s161 1) (EQ s171 1)), p2:(EQ s699 1), p1:(EQ s272 1), p3:(AND (EQ s631 1) (EQ s646 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 162 reset in 672 ms.
Stack based approach found an accepted trace after 157 steps with 1 reset with depth 62 and stack size 62 in 2 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-04 finished in 3846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 51 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2023-03-20 02:32:20] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-20 02:32:20] [INFO ] Implicit Places using invariants in 549 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 563 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 26 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-20 02:32:20] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-20 02:32:21] [INFO ] Implicit Places using invariants in 443 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 459 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 33 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-20 02:32:21] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-20 02:32:21] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-20 02:32:21] [INFO ] Invariant cache hit.
[2023-03-20 02:32:22] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2574 ms. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} 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:(EQ s199 1), p0:(OR (EQ s405 0) (EQ s422 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 648 ms.
Stack based approach found an accepted trace after 4004 steps with 0 reset with depth 4005 and stack size 1645 in 61 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-05 finished in 3418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||G(!p1)) U p2))'
Support contains 7 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 63 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2023-03-20 02:32:23] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-20 02:32:24] [INFO ] Implicit Places using invariants in 565 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 567 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 21 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-20 02:32:24] [INFO ] Computed 330 place invariants in 5 ms
[2023-03-20 02:32:24] [INFO ] Implicit Places using invariants in 446 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 448 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 22 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-20 02:32:24] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-20 02:32:25] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-20 02:32:25] [INFO ] Invariant cache hit.
[2023-03-20 02:32:25] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2429 ms. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), true, p1]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s137 1) (EQ s139 1)), p0:(AND (EQ s618 1) (EQ s625 1)), p1:(AND (EQ s353 1) (EQ s376 1) (EQ s137 1) (EQ s139 1) (EQ s249 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]]
Product exploration explored 100000 steps with 0 reset in 612 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-06 finished in 3274 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((p0||X((G(p0)&&(X(p2)||p1)))))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 9 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2023-03-20 02:32:26] [INFO ] Computed 331 place invariants in 5 ms
[2023-03-20 02:32:27] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-20 02:32:27] [INFO ] Invariant cache hit.
[2023-03-20 02:32:28] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
[2023-03-20 02:32:28] [INFO ] Invariant cache hit.
[2023-03-20 02:32:28] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1779 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 359 ms :[true, (NOT p0), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(EQ s122 1), p2:(NEQ s176 1), p1:(OR (NEQ s262 1) (NEQ s264 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-07 finished in 2176 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(p0)))))'
Support contains 1 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 25 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-20 02:32:28] [INFO ] Invariant cache hit.
[2023-03-20 02:32:29] [INFO ] Implicit Places using invariants in 565 ms returned []
[2023-03-20 02:32:29] [INFO ] Invariant cache hit.
[2023-03-20 02:32:30] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1547 ms to find 0 implicit places.
[2023-03-20 02:32:30] [INFO ] Invariant cache hit.
[2023-03-20 02:32:30] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1994 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s401 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-08 finished in 2129 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 p1)&&X(X(X(X(F((G(F(!p2))||(F(!p2)&&X(!p3)))))))))))'
Support contains 8 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 19 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-20 02:32:31] [INFO ] Invariant cache hit.
[2023-03-20 02:32:31] [INFO ] Implicit Places using invariants in 675 ms returned []
[2023-03-20 02:32:31] [INFO ] Invariant cache hit.
[2023-03-20 02:32:32] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
[2023-03-20 02:32:32] [INFO ] Invariant cache hit.
[2023-03-20 02:32:33] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2254 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 509 ms :[(OR (NOT p1) p2), (NOT p1), p2, p2, p2, p2, (AND p3 p2), p2]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}, { cond=p2, acceptance={} source=5 dest: 7}], [{ cond=p3, acceptance={} source=6 dest: 6}, { cond=(AND p2 p3), acceptance={} source=6 dest: 7}], [{ cond=p2, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s615 1) (EQ s649 1)), p0:(AND (EQ s338 1) (EQ s352 1)), p2:(AND (EQ s67 1) (EQ s69 1)), p3:(AND (EQ s563 1) (EQ s577 1))], 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 539 reset in 709 ms.
Stack based approach found an accepted trace after 108 steps with 1 reset with depth 60 and stack size 60 in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-10 finished in 3542 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(p0)&&G(p1))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 33 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2023-03-20 02:32:34] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-20 02:32:35] [INFO ] Implicit Places using invariants in 523 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 525 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 18 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-20 02:32:35] [INFO ] Computed 330 place invariants in 4 ms
[2023-03-20 02:32:35] [INFO ] Implicit Places using invariants in 443 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 457 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 23 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-20 02:32:35] [INFO ] Computed 328 place invariants in 4 ms
[2023-03-20 02:32:36] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-20 02:32:36] [INFO ] Invariant cache hit.
[2023-03-20 02:32:36] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1359 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2416 ms. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s106 1) (EQ s121 1)), p0:(AND (EQ s436 1) (EQ s446 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 608 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-11 finished in 3232 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||(F(p1)&&X(X(X(p2)))))))'
Support contains 6 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 17 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2023-03-20 02:32:37] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-20 02:32:38] [INFO ] Implicit Places using invariants in 896 ms returned []
[2023-03-20 02:32:38] [INFO ] Invariant cache hit.
[2023-03-20 02:32:39] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1741 ms to find 0 implicit places.
[2023-03-20 02:32:39] [INFO ] Invariant cache hit.
[2023-03-20 02:32:39] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2177 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 494 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s286 1) (EQ s296 1)), p1:(AND (EQ s428 1) (EQ s451 1)), p2:(AND (EQ s641 1) (EQ s652 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9 reset in 651 ms.
Stack based approach found an accepted trace after 77 steps with 0 reset with depth 78 and stack size 78 in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-13 finished in 3344 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 U !p1)))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 8 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-20 02:32:41] [INFO ] Invariant cache hit.
[2023-03-20 02:32:41] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-20 02:32:41] [INFO ] Invariant cache hit.
[2023-03-20 02:32:42] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2023-03-20 02:32:42] [INFO ] Invariant cache hit.
[2023-03-20 02:32:42] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1703 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 101 ms :[p1, p1, true]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s4 1) (EQ s23 1)), p0:(AND (EQ s493 1) (EQ s500 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1268 ms.
Product exploration explored 100000 steps with 50000 reset in 1292 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 p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 6 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030A-LTLFireability-15 finished in 4565 ms.
All properties solved by simple procedures.
Total runtime 61203 ms.
ITS solved all properties within timeout
BK_STOP 1679279565938
--------------------
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
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="ShieldPPPt-PT-030A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldPPPt-PT-030A, 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 r391-oct2-167903715500644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030A.tgz
mv ShieldPPPt-PT-030A 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 '
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 ;