About the Execution of ITS-Tools for ShieldIIPs-PT-002A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 464.644 | 36670.00 | 37322.00 | 6724.80 | TTFFFFFFTFTFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r216-tall-162098204700181.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPs-PT-002A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098204700181
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 18K May 5 16:52 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-002A-00
FORMULA_NAME ShieldIIPs-PT-002A-01
FORMULA_NAME ShieldIIPs-PT-002A-02
FORMULA_NAME ShieldIIPs-PT-002A-03
FORMULA_NAME ShieldIIPs-PT-002A-04
FORMULA_NAME ShieldIIPs-PT-002A-05
FORMULA_NAME ShieldIIPs-PT-002A-06
FORMULA_NAME ShieldIIPs-PT-002A-07
FORMULA_NAME ShieldIIPs-PT-002A-08
FORMULA_NAME ShieldIIPs-PT-002A-09
FORMULA_NAME ShieldIIPs-PT-002A-10
FORMULA_NAME ShieldIIPs-PT-002A-11
FORMULA_NAME ShieldIIPs-PT-002A-12
FORMULA_NAME ShieldIIPs-PT-002A-13
FORMULA_NAME ShieldIIPs-PT-002A-14
FORMULA_NAME ShieldIIPs-PT-002A-15
=== Now, execution of the tool begins
BK_START 1621051209056
Running Version 0
[2021-05-15 04:00:13] [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]
[2021-05-15 04:00:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 04:00:13] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2021-05-15 04:00:13] [INFO ] Transformed 53 places.
[2021-05-15 04:00:13] [INFO ] Transformed 51 transitions.
[2021-05-15 04:00:13] [INFO ] Found NUPN structural information;
[2021-05-15 04:00:13] [INFO ] Parsed PT model containing 53 places and 51 transitions in 71 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 04:00:13] [INFO ] Initial state test concluded for 1 properties.
Support contains 45 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 9 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:14] [INFO ] Computed 19 place invariants in 6 ms
[2021-05-15 04:00:14] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:14] [INFO ] Computed 19 place invariants in 10 ms
[2021-05-15 04:00:14] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:14] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-15 04:00:14] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 51/51 transitions.
[2021-05-15 04:00:14] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-05-15 04:00:14] [INFO ] Flatten gal took : 28 ms
FORMULA ShieldIIPs-PT-002A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 04:00:14] [INFO ] Flatten gal took : 9 ms
[2021-05-15 04:00:14] [INFO ] Input system was already deterministic with 51 transitions.
Finished random walk after 1386 steps, including 9 resets, run visited all 25 properties in 13 ms. (steps per millisecond=106 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X((X(G(p1))||p0)))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:14] [INFO ] Computed 19 place invariants in 4 ms
[2021-05-15 04:00:14] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:14] [INFO ] Computed 19 place invariants in 4 ms
[2021-05-15 04:00:14] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:14] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 04:00:14] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-002A-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s12 1) (EQ s45 1)), p0:(OR (NEQ s11 1) (NEQ s17 1) (NEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21132 reset in 247 ms.
Product exploration explored 100000 steps with 21117 reset in 173 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 21041 reset in 134 ms.
Product exploration explored 100000 steps with 21119 reset in 205 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 5 out of 53 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 53/53 places, 51/51 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 53 transition count 54
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 53 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 54
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 12 ms. Remains 53 /53 variables (removed 0) and now considering 54/51 (removed -3) transitions.
[2021-05-15 04:00:16] [INFO ] Redundant transitions in 10 ms returned [48]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[48]
// Phase 1: matrix 53 rows 53 cols
[2021-05-15 04:00:16] [INFO ] Computed 19 place invariants in 5 ms
[2021-05-15 04:00:16] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 53/53 places, 53/51 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2021-05-15 04:00:16] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 53 rows 53 cols
[2021-05-15 04:00:16] [INFO ] Computed 19 place invariants in 8 ms
[2021-05-15 04:00:16] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 2 iterations. Remains : 53/53 places, 53/51 transitions.
Product exploration explored 100000 steps with 25083 reset in 308 ms.
Product exploration explored 100000 steps with 25032 reset in 205 ms.
[2021-05-15 04:00:16] [INFO ] Flatten gal took : 6 ms
[2021-05-15 04:00:17] [INFO ] Flatten gal took : 6 ms
[2021-05-15 04:00:17] [INFO ] Time to serialize gal into /tmp/LTL13979843343117149016.gal : 1 ms
[2021-05-15 04:00:17] [INFO ] Time to serialize properties into /tmp/LTL11821246020685085176.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13979843343117149016.gal, -t, CGAL, -LTL, /tmp/LTL11821246020685085176.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13979843343117149016.gal -t CGAL -LTL /tmp/LTL11821246020685085176.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(X(("(((p11==0)||(p17==0))||(p27==0))")||(X(G("((p12==1)&&(p45==1))"))))))&&(F("((p12==1)&&(p45==1))"))))
Formula 0 simplified : !(XX("(((p11==0)||(p17==0))||(p27==0))" | XG"((p12==1)&&(p45==1))") & F"((p12==1)&&(p45==1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t16, t21, t23, t28, t29, t32, t33, t35, t36, t38, t43, t44, t46, t47, t48, t50, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/30/51
Computing Next relation with stutter on 22 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
67 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.684553,33616,1,0,193,116228,131,89,1975,95138,226
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-002A-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPs-PT-002A-01 finished in 3235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((X(p0)||(G(p1)&&X(p2))))&&X(p3))))], workingDir=/home/mcc/execution]
Support contains 7 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:17] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 04:00:17] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:17] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 04:00:17] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:17] [INFO ] Computed 19 place invariants in 8 ms
[2021-05-15 04:00:17] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p3) (NOT p0)), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true]
Running random walk in product with property : ShieldIIPs-PT-002A-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0 p3), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0 p3), acceptance={} source=0 dest: 3}, { cond=(OR (NOT p0) (NOT p3)), acceptance={} source=0 dest: 7}], [{ cond=(AND (NOT p1) p0 p3), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0 p3), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0) p2 p3), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)) (NOT p3)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND p1 p0) (AND p1 p2)), acceptance={} source=4 dest: 4}, { cond=(OR (NOT p1) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 1}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=5, aps=[p1:(OR (EQ s33 0) (EQ s47 0)), p0:(AND (EQ s33 1) (EQ s47 1)), p3:(AND (EQ s7 1) (EQ s9 1)), p2:(AND (EQ s11 1) (EQ s17 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-002A-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002A-02 finished in 410 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 51/51 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 52 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 50 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 49 transition count 48
Applied a total of 5 rules in 10 ms. Remains 49 /53 variables (removed 4) and now considering 48/51 (removed 3) transitions.
// Phase 1: matrix 48 rows 49 cols
[2021-05-15 04:00:18] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-15 04:00:18] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 48 rows 49 cols
[2021-05-15 04:00:18] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-15 04:00:18] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2021-05-15 04:00:18] [INFO ] Redundant transitions in 7 ms returned [42]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[42]
// Phase 1: matrix 47 rows 49 cols
[2021-05-15 04:00:18] [INFO ] Computed 18 place invariants in 8 ms
[2021-05-15 04:00:18] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 49/53 places, 47/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2021-05-15 04:00:18] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 47 rows 49 cols
[2021-05-15 04:00:18] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-15 04:00:18] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/53 places, 47/51 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002A-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s14 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002A-05 finished in 234 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||(G(p1)&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 51/51 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 50
Applied a total of 2 rules in 4 ms. Remains 52 /53 variables (removed 1) and now considering 50/51 (removed 1) transitions.
// Phase 1: matrix 50 rows 52 cols
[2021-05-15 04:00:18] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 04:00:18] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 50 rows 52 cols
[2021-05-15 04:00:18] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 04:00:18] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2021-05-15 04:00:18] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 50 rows 52 cols
[2021-05-15 04:00:18] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 04:00:18] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/53 places, 50/51 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-002A-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s11 1) (NEQ s15 1) (NEQ s27 1)), p1:(AND (EQ s1 1) (EQ s20 1) (EQ s38 1) (EQ s47 1) (EQ s49 1)), p2:(OR (NEQ s38 1) (NEQ s47 1) (NEQ s49 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 795 reset in 241 ms.
Stack based approach found an accepted trace after 14973 steps with 113 reset with depth 135 and stack size 133 in 39 ms.
FORMULA ShieldIIPs-PT-002A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002A-07 finished in 515 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:18] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 04:00:19] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:19] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 04:00:19] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:19] [INFO ] Computed 19 place invariants in 6 ms
[2021-05-15 04:00:19] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002A-08 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (NEQ s8 1) (NEQ s22 1)), p0:(OR (NEQ s30 1) (NEQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 120 ms.
Product exploration explored 100000 steps with 33333 reset in 128 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 111 ms.
Product exploration explored 100000 steps with 33333 reset in 130 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 53 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 53/53 places, 51/51 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 53 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 53 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 54
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 5 ms. Remains 53 /53 variables (removed 0) and now considering 54/51 (removed -3) transitions.
[2021-05-15 04:00:25] [INFO ] Redundant transitions in 19 ms returned [48]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[48]
// Phase 1: matrix 53 rows 53 cols
[2021-05-15 04:00:25] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 04:00:25] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Starting structural reductions, iteration 1 : 53/53 places, 53/51 transitions.
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2021-05-15 04:00:25] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 53 rows 53 cols
[2021-05-15 04:00:25] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 04:00:25] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 2 iterations. Remains : 53/53 places, 53/51 transitions.
Product exploration explored 100000 steps with 33333 reset in 238 ms.
Product exploration explored 100000 steps with 33333 reset in 247 ms.
[2021-05-15 04:00:26] [INFO ] Flatten gal took : 5 ms
[2021-05-15 04:00:26] [INFO ] Flatten gal took : 5 ms
[2021-05-15 04:00:26] [INFO ] Time to serialize gal into /tmp/LTL6098990715816602215.gal : 1 ms
[2021-05-15 04:00:26] [INFO ] Time to serialize properties into /tmp/LTL322037535802149068.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6098990715816602215.gal, -t, CGAL, -LTL, /tmp/LTL322037535802149068.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6098990715816602215.gal -t CGAL -LTL /tmp/LTL322037535802149068.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("((p30==0)||(p43==0))")||(F("((p8==0)||(p22==0))"))))))
Formula 0 simplified : !XX("((p30==0)||(p43==0))" | F"((p8==0)||(p22==0))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t16, t21, t23, t28, t29, t32, t33, t35, t36, t38, t43, t44, t46, t47, t48, t50, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/30/51
Computing Next relation with stutter on 22 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
70 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.704093,33388,1,0,144,115048,126,57,1974,93813,116
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-002A-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPs-PT-002A-08 finished in 7874 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:26] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 04:00:26] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:26] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 04:00:26] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:26] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 04:00:26] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002A-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s21 1) (EQ s27 1) (EQ s38 1) (EQ s48 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 187 steps with 1 reset in 0 ms.
FORMULA ShieldIIPs-PT-002A-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002A-09 finished in 193 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 51/51 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 50
Applied a total of 2 rules in 6 ms. Remains 52 /53 variables (removed 1) and now considering 50/51 (removed 1) transitions.
// Phase 1: matrix 50 rows 52 cols
[2021-05-15 04:00:27] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 04:00:27] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 50 rows 52 cols
[2021-05-15 04:00:27] [INFO ] Computed 19 place invariants in 4 ms
[2021-05-15 04:00:27] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2021-05-15 04:00:27] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 50 rows 52 cols
[2021-05-15 04:00:27] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 04:00:27] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/53 places, 50/51 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002A-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s38 1) (NEQ s45 1) (NEQ s51 1)), p0:(OR (NEQ s33 1) (NEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 717 reset in 152 ms.
Product exploration explored 100000 steps with 720 reset in 167 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 723 reset in 151 ms.
Product exploration explored 100000 steps with 720 reset in 166 ms.
[2021-05-15 04:00:27] [INFO ] Flatten gal took : 4 ms
[2021-05-15 04:00:27] [INFO ] Flatten gal took : 4 ms
[2021-05-15 04:00:27] [INFO ] Time to serialize gal into /tmp/LTL15538842189139171373.gal : 1 ms
[2021-05-15 04:00:27] [INFO ] Time to serialize properties into /tmp/LTL3151904791461467473.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15538842189139171373.gal, -t, CGAL, -LTL, /tmp/LTL3151904791461467473.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15538842189139171373.gal -t CGAL -LTL /tmp/LTL3151904791461467473.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p33==0)||(p48==0))")||(G("(((p38==0)||(p46==0))||(p52==0))"))))))
Formula 0 simplified : !GF("((p33==0)||(p48==0))" | G"(((p38==0)||(p46==0))||(p52==0))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t10, t11, t12, t13, t21, t28, t29, t32, t35, t36, t38, t43, t44, t46, t47, t48, t50, t8.t16, t9.t16, t23.t16, t33.t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/29/50
Computing Next relation with stutter on 22 deadlock states
37 unique states visited
0 strongly connected components in search stack
37 transitions explored
37 items max in DFS search stack
101 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.01297,46088,1,0,176,152808,128,128,1984,189742,404
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-002A-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPs-PT-002A-10 finished in 2112 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F((X(p1)&&p0))||G(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:29] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-15 04:00:29] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:29] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 04:00:29] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:29] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 04:00:29] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-002A-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s6 1) (EQ s17 1)), p1:(AND (EQ s6 1) (EQ s17 1)), p2:(NEQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4858 steps with 104 reset in 22 ms.
FORMULA ShieldIIPs-PT-002A-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002A-12 finished in 294 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U X(p1)) U (G(p2) U X(G(p3))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:29] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 04:00:29] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:29] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 04:00:29] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:29] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 04:00:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 427 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) p3), (NOT p1), (AND p3 (NOT p2) (NOT p1)), true, (AND p3 (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : ShieldIIPs-PT-002A-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=p3, acceptance={} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND p2 p0 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) p0 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 8}, { cond=(AND p2 (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 9}], [{ cond=(AND p2 p0 p3 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0) p3 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 10}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=4 dest: 11}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=4 dest: 12}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 13}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 14}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 10}, { cond=(AND p3 (NOT p1)), acceptance={} source=5 dest: 12}], [{ cond=(NOT p1), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0) p3 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p2 p0 p3 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) p0 p3 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND p2 (NOT p0) p3 (NOT p1)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=9 dest: 10}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=9 dest: 11}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p2) p3), acceptance={} source=11 dest: 10}, { cond=(AND p2 p3), acceptance={} source=11 dest: 11}], [{ cond=(NOT p3), acceptance={} source=12 dest: 10}, { cond=p3, acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=13 dest: 10}, { cond=(AND p2 (NOT p3)), acceptance={} source=13 dest: 11}], [{ cond=(NOT p2), acceptance={} source=14 dest: 12}, { cond=p2, acceptance={} source=14 dest: 13}, { cond=(AND p2 (NOT p3)), acceptance={0} source=14 dest: 14}, { cond=(AND p2 p3), acceptance={} source=14 dest: 14}]], initial=0, aps=[p3:(AND (EQ s14 1) (EQ s35 1)), p2:(OR (EQ s13 0) (EQ s23 0) (EQ s25 0)), p0:(AND (EQ s29 1) (EQ s44 1)), p1:(AND (EQ s13 1) (EQ s23 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15877 reset in 150 ms.
Product exploration explored 100000 steps with 15854 reset in 150 ms.
Knowledge obtained : [(NOT p3), p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 397 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) p3), (NOT p1), (AND p3 (NOT p2) (NOT p1)), true, (AND p3 (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2)), (NOT p3)]
Product exploration explored 100000 steps with 15855 reset in 136 ms.
Product exploration explored 100000 steps with 15838 reset in 153 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 399 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) p3), (NOT p1), (AND p3 (NOT p2) (NOT p1)), true, (AND p3 (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2)), (NOT p3)]
Support contains 7 out of 53 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 53/53 places, 51/51 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 53 transition count 54
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 53 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 54
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 5 ms. Remains 53 /53 variables (removed 0) and now considering 54/51 (removed -3) transitions.
[2021-05-15 04:00:34] [INFO ] Redundant transitions in 6 ms returned [48]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[48]
// Phase 1: matrix 53 rows 53 cols
[2021-05-15 04:00:34] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 04:00:34] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 53/53 places, 53/51 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2021-05-15 04:00:34] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 53 rows 53 cols
[2021-05-15 04:00:34] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 04:00:34] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 53/53 places, 53/51 transitions.
Product exploration explored 100000 steps with 15854 reset in 201 ms.
Product exploration explored 100000 steps with 15853 reset in 217 ms.
[2021-05-15 04:00:34] [INFO ] Flatten gal took : 4 ms
[2021-05-15 04:00:35] [INFO ] Flatten gal took : 4 ms
[2021-05-15 04:00:35] [INFO ] Time to serialize gal into /tmp/LTL555625520903251818.gal : 1 ms
[2021-05-15 04:00:35] [INFO ] Time to serialize properties into /tmp/LTL5185313810028284729.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL555625520903251818.gal, -t, CGAL, -LTL, /tmp/LTL5185313810028284729.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL555625520903251818.gal -t CGAL -LTL /tmp/LTL5185313810028284729.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("((p29==1)&&(p44==1))")U(X("(((p13==1)&&(p23==1))&&(p25==1))")))U((G("(((p13==0)||(p23==0))||(p25==0))"))U(X(G("((p14==1)&&(p35==1))")))))))
Formula 0 simplified : !X(("((p29==1)&&(p44==1))" U X"(((p13==1)&&(p23==1))&&(p25==1))") U (G"(((p13==0)||(p23==0))||(p25==0))" U XG"((p14==1)&&(p35==1))"))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t16, t21, t23, t28, t29, t32, t33, t35, t36, t38, t43, t44, t46, t47, t48, t50, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/30/51
Computing Next relation with stutter on 22 deadlock states
14 unique states visited
8 strongly connected components in search stack
14 transitions explored
8 items max in DFS search stack
215 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.18693,81400,1,0,213,322505,173,110,2072,438038,311
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPs-PT-002A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPs-PT-002A-13 finished in 8121 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 51/51 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 53 transition count 50
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 49
Applied a total of 4 rules in 5 ms. Remains 51 /53 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 51 cols
[2021-05-15 04:00:37] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 04:00:37] [INFO ] Implicit Places using invariants in 27 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
[2021-05-15 04:00:37] [INFO ] Redundant transitions in 6 ms returned [43]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[43]
// Phase 1: matrix 48 rows 50 cols
[2021-05-15 04:00:37] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-15 04:00:37] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 50/53 places, 48/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2021-05-15 04:00:37] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 48 rows 50 cols
[2021-05-15 04:00:37] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-15 04:00:37] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 50/53 places, 48/51 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002A-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (NEQ s2 1) (NEQ s10 1)) (OR (NEQ s2 1) (NEQ s10 1) (NEQ s0 0))), p0:(OR (NEQ s2 1) (NEQ s10 1) (NEQ s0 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3546 reset in 181 ms.
Product exploration explored 100000 steps with 3482 reset in 162 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3505 reset in 149 ms.
Product exploration explored 100000 steps with 3541 reset in 163 ms.
[2021-05-15 04:00:38] [INFO ] Flatten gal took : 3 ms
[2021-05-15 04:00:38] [INFO ] Flatten gal took : 3 ms
[2021-05-15 04:00:38] [INFO ] Time to serialize gal into /tmp/LTL10031003914191909320.gal : 0 ms
[2021-05-15 04:00:38] [INFO ] Time to serialize properties into /tmp/LTL14104720332466659984.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10031003914191909320.gal, -t, CGAL, -LTL, /tmp/LTL14104720332466659984.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10031003914191909320.gal -t CGAL -LTL /tmp/LTL14104720332466659984.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((p2==0)||(p10==0))||(p0==1))")U((G("(((p2==0)||(p10==0))||(p0==1))"))||("(((p2==0)||(p10==0))&&(((p2==0)||(p10==0))||(p0==1)))"))))))
Formula 0 simplified : !GF("(((p2==0)||(p10==0))||(p0==1))" U ("(((p2==0)||(p10==0))&&(((p2==0)||(p10==0))||(p0==1)))" | G"(((p2==0)||(p10==0))||(p0==1))"))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t10, t11, t12, t13, t21, t32, t36, t38, t43, t44, t46, t47, t48, t50, t15.t35, t15.t28, t8.t16, t9.t16, t23.t16, t33.t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/20/28/48
Computing Next relation with stutter on 22 deadlock states
34 unique states visited
0 strongly connected components in search stack
66 transitions explored
34 items max in DFS search stack
490 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.91604,167284,1,0,326,696711,136,199,1885,1.02555e+06,1011
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-002A-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPs-PT-002A-14 finished in 6804 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(!p0)&&F((p1&&(X(p3)||p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:44] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 04:00:44] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:44] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 04:00:44] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 53 cols
[2021-05-15 04:00:44] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 04:00:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) p0 (AND (NOT p2) (NOT p3))), p0, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldIIPs-PT-002A-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s41 1), p1:(OR (NEQ s36 1) (NEQ s42 1) (NEQ s51 1)), p2:(OR (NEQ s36 1) (NEQ s42 1) (NEQ s51 1)), p3:(AND (NEQ s31 0) (NEQ s42 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 712 steps with 11 reset in 2 ms.
FORMULA ShieldIIPs-PT-002A-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002A-15 finished in 234 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621051245726
--------------------
content from stderr:
+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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-002A"
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-002A, 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 r216-tall-162098204700181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-002A.tgz
mv ShieldIIPs-PT-002A 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 ;