About the Execution of ITS-Tools for ShieldIIPs-PT-001B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
322.712 | 12066.00 | 25773.00 | 162.60 | FFFFFFFFTTFTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286024600012.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPs-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024600012
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 9.0K Apr 29 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 29 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 29 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 29 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 17K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652908267695
Running Version 202205111006
[2022-05-18 21:11:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 21:11:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 21:11:09] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2022-05-18 21:11:09] [INFO ] Transformed 63 places.
[2022-05-18 21:11:09] [INFO ] Transformed 62 transitions.
[2022-05-18 21:11:09] [INFO ] Found NUPN structural information;
[2022-05-18 21:11:09] [INFO ] Parsed PT model containing 63 places and 62 transitions in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldIIPs-PT-001B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001B-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 58
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 58
Applied a total of 8 rules in 12 ms. Remains 59 /63 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 59 cols
[2022-05-18 21:11:09] [INFO ] Computed 10 place invariants in 19 ms
[2022-05-18 21:11:09] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 58 rows 59 cols
[2022-05-18 21:11:09] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-18 21:11:09] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
// Phase 1: matrix 58 rows 59 cols
[2022-05-18 21:11:09] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:09] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/63 places, 58/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/63 places, 58/62 transitions.
Support contains 26 out of 59 places after structural reductions.
[2022-05-18 21:11:09] [INFO ] Flatten gal took : 23 ms
[2022-05-18 21:11:09] [INFO ] Flatten gal took : 9 ms
[2022-05-18 21:11:09] [INFO ] Input system was already deterministic with 58 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 24) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 58 rows 59 cols
[2022-05-18 21:11:10] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-18 21:11:10] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-18 21:11:10] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 21:11:10] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 4 ms to minimize.
[2022-05-18 21:11:10] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2022-05-18 21:11:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 89 ms
[2022-05-18 21:11:10] [INFO ] After 115ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0
[2022-05-18 21:11:10] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 13 stabilizing places and 13 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((F(p0)&&X(p1)))||G(p2)))))'
Support contains 7 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 58/58 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 56 transition count 55
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 56 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 55 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 55 transition count 54
Applied a total of 8 rules in 5 ms. Remains 55 /59 variables (removed 4) and now considering 54/58 (removed 4) transitions.
// Phase 1: matrix 54 rows 55 cols
[2022-05-18 21:11:10] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-18 21:11:10] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 54 rows 55 cols
[2022-05-18 21:11:10] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-18 21:11:10] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 55 cols
[2022-05-18 21:11:10] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-18 21:11:10] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/59 places, 54/58 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/59 places, 54/58 transitions.
Stuttering acceptance computed with spot in 777 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=true, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(NOT p2), acceptance={} source=4 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 8}, { cond=p2, acceptance={} source=4 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(NOT p2), acceptance={} source=10 dest: 7}, { cond=p2, acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(AND (EQ s19 1) (EQ s21 1)), p0:(AND (EQ s27 1) (EQ s44 1) (EQ s51 1)), p1:(OR (EQ s15 0) (EQ s36 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 32722 steps with 83 reset in 130 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-00 finished in 1113 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0 U p1))||X(p2))))'
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 58/58 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 56 transition count 55
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 56 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 55 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 55 transition count 54
Applied a total of 8 rules in 10 ms. Remains 55 /59 variables (removed 4) and now considering 54/58 (removed 4) transitions.
// Phase 1: matrix 54 rows 55 cols
[2022-05-18 21:11:11] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:11] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 54 rows 55 cols
[2022-05-18 21:11:11] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:11] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 55 cols
[2022-05-18 21:11:11] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:11] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/59 places, 54/58 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/59 places, 54/58 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 4}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s40 1)), p0:(EQ s7 1), p2:(EQ s13 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33383 reset in 167 ms.
Product exploration explored 100000 steps with 33206 reset in 176 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/55 stabilizing places and 11/54 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 598 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p1) (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), true, (NOT p1), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 54 rows 55 cols
[2022-05-18 21:11:13] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:13] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 21:11:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-18 21:11:13] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) p0 (NOT p2))))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 p0 p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p0) p2))), (F (OR (AND p1 p2) (AND p0 p2))), (F (AND (NOT p1) p0 p2))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p0 p2)))
Knowledge based reduction with 13 factoid took 268 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldIIPs-PT-001B-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-001B-LTLFireability-01 finished in 2110 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||p1)))'
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 58/58 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 58 transition count 51
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 52 transition count 51
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 52 transition count 45
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 46 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 43 transition count 42
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 43 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 30 place count 43 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 42 transition count 41
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 60 place count 28 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 27 transition count 26
Applied a total of 61 rules in 27 ms. Remains 27 /59 variables (removed 32) and now considering 26/58 (removed 32) transitions.
// Phase 1: matrix 26 rows 27 cols
[2022-05-18 21:11:13] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:13] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 26 rows 27 cols
[2022-05-18 21:11:13] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-18 21:11:13] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-18 21:11:13] [INFO ] Redundant transitions in 11 ms returned [25]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 21:11:13] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:13] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/59 places, 25/58 transitions.
Applied a total of 0 rules in 5 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 27/59 places, 25/58 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s3 1), p0:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6995 steps with 1023 reset in 9 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-02 finished in 246 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(p0))))'
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 58/58 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 56 transition count 55
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 56 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 55 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 55 transition count 54
Applied a total of 8 rules in 6 ms. Remains 55 /59 variables (removed 4) and now considering 54/58 (removed 4) transitions.
// Phase 1: matrix 54 rows 55 cols
[2022-05-18 21:11:13] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:13] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 54 rows 55 cols
[2022-05-18 21:11:13] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:14] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 55 cols
[2022-05-18 21:11:14] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:14] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/59 places, 54/58 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/59 places, 54/58 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s13 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 ShieldIIPs-PT-001B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-03 finished in 227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U (p1 U p0)))'
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 58/58 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 56 transition count 55
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 56 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 55 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 55 transition count 54
Applied a total of 8 rules in 5 ms. Remains 55 /59 variables (removed 4) and now considering 54/58 (removed 4) transitions.
// Phase 1: matrix 54 rows 55 cols
[2022-05-18 21:11:14] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:14] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 54 rows 55 cols
[2022-05-18 21:11:14] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-18 21:11:14] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 55 cols
[2022-05-18 21:11:14] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:14] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/59 places, 54/58 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/59 places, 54/58 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(EQ s51 1), p1:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-05 finished in 345 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U G(p1))&&X((X(p1)&&p2))))'
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 58/58 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 57 transition count 56
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 57 transition count 56
Applied a total of 4 rules in 3 ms. Remains 57 /59 variables (removed 2) and now considering 56/58 (removed 2) transitions.
// Phase 1: matrix 56 rows 57 cols
[2022-05-18 21:11:14] [INFO ] Computed 10 place invariants in 16 ms
[2022-05-18 21:11:14] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 56 rows 57 cols
[2022-05-18 21:11:14] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:14] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 57 cols
[2022-05-18 21:11:14] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:14] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/59 places, 56/58 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/59 places, 56/58 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p0)), (NOT p1), (NOT p1), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}, { cond=(OR p1 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}]], initial=0, aps=[p1:(EQ s2 1), p0:(NEQ s4 1), p2:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-10 finished in 420 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((true U !(X(p0)&&p1))))))'
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 58/58 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 58 transition count 51
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 52 transition count 51
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 12 place count 52 transition count 46
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 22 place count 47 transition count 46
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 45 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 45 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 45 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 44 transition count 43
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 58 place count 29 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 28 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 27 transition count 27
Applied a total of 60 rules in 13 ms. Remains 27 /59 variables (removed 32) and now considering 27/58 (removed 31) transitions.
// Phase 1: matrix 27 rows 27 cols
[2022-05-18 21:11:14] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-18 21:11:14] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-18 21:11:14] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-18 21:11:15] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-18 21:11:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-18 21:11:15] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-18 21:11:15] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/59 places, 27/58 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/59 places, 27/58 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s23 1), p0:(EQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 487 reset in 127 ms.
Product exploration explored 100000 steps with 441 reset in 161 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND p0 p1), (AND p0 p1)]
Finished random walk after 438 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=219 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 51 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2022-05-18 21:11:15] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-18 21:11:16] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-18 21:11:16] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-18 21:11:16] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2022-05-18 21:11:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-18 21:11:16] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-18 21:11:16] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 56 ms :[(AND p0 p1), (AND p0 p1)]
Finished random walk after 47 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 52 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 54 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 469 reset in 133 ms.
Product exploration explored 100000 steps with 444 reset in 105 ms.
Built C files in :
/tmp/ltsmin7348619320161565284
[2022-05-18 21:11:17] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2022-05-18 21:11:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 21:11:17] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2022-05-18 21:11:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 21:11:17] [INFO ] Computing Do-Not-Accords matrix : 27 transitions.
[2022-05-18 21:11:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 21:11:17] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7348619320161565284
Running compilation step : cd /tmp/ltsmin7348619320161565284;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 223 ms.
Running link step : cd /tmp/ltsmin7348619320161565284;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7348619320161565284;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12934233334894123682.hoa' '--buchi-type=spotba'
LTSmin run took 782 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-001B-LTLFireability-11 finished in 3149 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((p0 U (F(p0) U p1))))))'
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 58/58 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 57 transition count 56
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 57 transition count 56
Applied a total of 4 rules in 3 ms. Remains 57 /59 variables (removed 2) and now considering 56/58 (removed 2) transitions.
// Phase 1: matrix 56 rows 57 cols
[2022-05-18 21:11:18] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:18] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 56 rows 57 cols
[2022-05-18 21:11:18] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:18] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 57 cols
[2022-05-18 21:11:18] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:18] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/59 places, 56/58 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/59 places, 56/58 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s23 1) (EQ s11 1) (EQ s29 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][false, false]]
Stuttering criterion allowed to conclude after 23264 steps with 0 reset in 35 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-12 finished in 301 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 58/58 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 56 transition count 55
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 56 transition count 55
Applied a total of 6 rules in 4 ms. Remains 56 /59 variables (removed 3) and now considering 55/58 (removed 3) transitions.
// Phase 1: matrix 55 rows 56 cols
[2022-05-18 21:11:18] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-18 21:11:18] [INFO ] Implicit Places using invariants in 498 ms returned []
// Phase 1: matrix 55 rows 56 cols
[2022-05-18 21:11:18] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-18 21:11:18] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 56 cols
[2022-05-18 21:11:18] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-18 21:11:19] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/59 places, 55/58 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/59 places, 55/58 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s28 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Detected a total of 12/56 stabilizing places and 12/55 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-001B-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-001B-LTLFireability-13 finished in 996 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 58/58 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 58 transition count 51
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 52 transition count 51
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 52 transition count 45
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 46 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 43 transition count 42
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 43 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 30 place count 43 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 42 transition count 41
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 26 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 25 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 24 transition count 24
Applied a total of 66 rules in 7 ms. Remains 24 /59 variables (removed 35) and now considering 24/58 (removed 34) transitions.
// Phase 1: matrix 24 rows 24 cols
[2022-05-18 21:11:19] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-18 21:11:19] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2022-05-18 21:11:19] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-18 21:11:19] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2022-05-18 21:11:19] [INFO ] Redundant transitions in 43 ms returned [23]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 23 rows 24 cols
[2022-05-18 21:11:19] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-18 21:11:19] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/59 places, 23/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/59 places, 23/58 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 381 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-15 finished in 307 ms.
All properties solved by simple procedures.
Total runtime 10802 ms.
BK_STOP 1652908279761
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-001B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-001B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286024600012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-001B.tgz
mv ShieldIIPs-PT-001B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;