About the Execution of ITS-Tools for ShieldIIPs-PT-001A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 356.287 | 29540.00 | 26518.00 | 6852.50 | FFTTTTTFFTFFFFFT | 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-162098204700165.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-001A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098204700165
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 119K 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.0K Mar 28 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 17:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 17:38 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 9.0K 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-001A-00
FORMULA_NAME ShieldIIPs-PT-001A-01
FORMULA_NAME ShieldIIPs-PT-001A-02
FORMULA_NAME ShieldIIPs-PT-001A-03
FORMULA_NAME ShieldIIPs-PT-001A-04
FORMULA_NAME ShieldIIPs-PT-001A-05
FORMULA_NAME ShieldIIPs-PT-001A-06
FORMULA_NAME ShieldIIPs-PT-001A-07
FORMULA_NAME ShieldIIPs-PT-001A-08
FORMULA_NAME ShieldIIPs-PT-001A-09
FORMULA_NAME ShieldIIPs-PT-001A-10
FORMULA_NAME ShieldIIPs-PT-001A-11
FORMULA_NAME ShieldIIPs-PT-001A-12
FORMULA_NAME ShieldIIPs-PT-001A-13
FORMULA_NAME ShieldIIPs-PT-001A-14
FORMULA_NAME ShieldIIPs-PT-001A-15
=== Now, execution of the tool begins
BK_START 1621050644194
Running Version 0
[2021-05-15 03:50:50] [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 03:50:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 03:50:50] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2021-05-15 03:50:50] [INFO ] Transformed 28 places.
[2021-05-15 03:50:50] [INFO ] Transformed 27 transitions.
[2021-05-15 03:50:50] [INFO ] Found NUPN structural information;
[2021-05-15 03:50:50] [INFO ] Parsed PT model containing 28 places and 27 transitions in 67 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 03:50:50] [INFO ] Initial state test concluded for 5 properties.
FORMULA ShieldIIPs-PT-001A-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 9 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:50] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-15 03:50:50] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:50] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-15 03:50:50] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:50] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:50:50] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 27/27 transitions.
[2021-05-15 03:50:50] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-15 03:50:50] [INFO ] Flatten gal took : 23 ms
FORMULA ShieldIIPs-PT-001A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001A-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 03:50:50] [INFO ] Flatten gal took : 6 ms
[2021-05-15 03:50:50] [INFO ] Input system was already deterministic with 27 transitions.
Incomplete random walk after 100000 steps, including 303 resets, run finished after 315 ms. (steps per millisecond=317 ) properties (out of 27) seen :26
Running SMT prover for 1 properties.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:51] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:50:51] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-15 03:50:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 03:50:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-15 03:50:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 03:50:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2021-05-15 03:50:51] [INFO ] Initial state test concluded for 1 properties.
FORMULA ShieldIIPs-PT-001A-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((X(p0)&&(p0||F(p1)||X(p2))) U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:53] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-15 03:50:53] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:53] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-15 03:50:53] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:53] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:50:53] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 27/27 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldIIPs-PT-001A-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s6 1) (EQ s17 1)), p0:(AND (EQ s5 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-001A-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001A-00 finished in 2348 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U p1)&&X(G(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:53] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:50:53] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:53] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:50:53] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:53] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:50:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 27/27 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : ShieldIIPs-PT-001A-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 p2), acceptance={0} source=1 dest: 3}, { cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s25 1), p0:(OR (EQ s11 0) (EQ s15 0) (EQ s27 0)), p2:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-001A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001A-01 finished in 249 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:53] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:50:53] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:53] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:50:53] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:53] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-15 03:50:53] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 27/27 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001A-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s21 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]]
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 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 28 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 28 transition count 30
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 28 transition count 30
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 8 ms. Remains 28 /28 variables (removed 0) and now considering 30/27 (removed -3) transitions.
[2021-05-15 03:50:54] [INFO ] Redundant transitions in 6 ms returned [22]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[22]
// Phase 1: matrix 29 rows 28 cols
[2021-05-15 03:50:54] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-15 03:50:54] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 28/28 places, 29/27 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2021-05-15 03:50:54] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 29 rows 28 cols
[2021-05-15 03:50:54] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:50:54] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/28 places, 29/27 transitions.
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 204 ms.
[2021-05-15 03:50:55] [INFO ] Flatten gal took : 4 ms
[2021-05-15 03:50:55] [INFO ] Flatten gal took : 3 ms
[2021-05-15 03:50:55] [INFO ] Time to serialize gal into /tmp/LTL2681730130723926896.gal : 1 ms
[2021-05-15 03:50:55] [INFO ] Time to serialize properties into /tmp/LTL18023042215947457046.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/LTL2681730130723926896.gal, -t, CGAL, -LTL, /tmp/LTL18023042215947457046.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/LTL2681730130723926896.gal -t CGAL -LTL /tmp/LTL18023042215947457046.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p21==0)"))))
Formula 0 simplified : !XF"(p21==0)"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t9, t12, t19, t20, t23, t24, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/13/14/27
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
6 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.076889,17840,1,0,79,9628,80,32,1004,10584,67
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-001A-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPs-PT-001A-02 finished in 1668 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((p1||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:50:55] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:50:55] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:50:55] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 27/27 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-001A-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s16 1), p2:(OR (NEQ s1 1) (NEQ s20 1)), p1:(AND (EQ s2 1) (EQ s10 1) (EQ s8 1) (EQ s23 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 123 ms.
Product exploration explored 100000 steps with 33333 reset in 98 ms.
Knowledge obtained : [(NOT p0), p2, (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 33333 reset in 97 ms.
Product exploration explored 100000 steps with 33333 reset in 104 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 7 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 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 28 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 28 transition count 30
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 28 transition count 30
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 30/27 (removed -3) transitions.
[2021-05-15 03:50:56] [INFO ] Redundant transitions in 5 ms returned [22]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[22]
// Phase 1: matrix 29 rows 28 cols
[2021-05-15 03:50:56] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:50:56] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 28/28 places, 29/27 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2021-05-15 03:50:56] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 29 rows 28 cols
[2021-05-15 03:50:56] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:50:56] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/28 places, 29/27 transitions.
Product exploration explored 100000 steps with 33333 reset in 211 ms.
Product exploration explored 100000 steps with 33333 reset in 210 ms.
[2021-05-15 03:50:57] [INFO ] Flatten gal took : 4 ms
[2021-05-15 03:50:57] [INFO ] Flatten gal took : 3 ms
[2021-05-15 03:50:57] [INFO ] Time to serialize gal into /tmp/LTL898323838204772033.gal : 0 ms
[2021-05-15 03:50:57] [INFO ] Time to serialize properties into /tmp/LTL15919252846128561958.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/LTL898323838204772033.gal, -t, CGAL, -LTL, /tmp/LTL15919252846128561958.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/LTL898323838204772033.gal -t CGAL -LTL /tmp/LTL15919252846128561958.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p16==1)")||(X(("((((p2==1)&&(p10==1))&&(p8==1))&&(p23==1))")||(F("((p1==0)||(p20==0))")))))))
Formula 0 simplified : !X("(p16==1)" | X("((((p2==1)&&(p10==1))&&(p8==1))&&(p23==1))" | F"((p1==0)||(p20==0))"))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t9, t12, t19, t20, t23, t24, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/13/14/27
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
7 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.073395,18284,1,0,80,9631,81,33,1030,10584,70
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-001A-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPs-PT-001A-04 finished in 1601 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(p1)||(p2 U X(p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:57] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:50:57] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:57] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:50:57] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:50:57] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:50:57] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 27/27 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-001A-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s26 1), p1:(OR (EQ s7 0) (EQ s9 0)), p3:(AND (EQ s2 1) (EQ s10 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]]
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Knowledge obtained : [(NOT p0), p1, (NOT p3)]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 5 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 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 28 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 28 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 28 transition count 30
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 30/27 (removed -3) transitions.
[2021-05-15 03:51:01] [INFO ] Redundant transitions in 10 ms returned [22]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[22]
// Phase 1: matrix 29 rows 28 cols
[2021-05-15 03:51:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:01] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 28/28 places, 29/27 transitions.
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2021-05-15 03:51:01] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 29 rows 28 cols
[2021-05-15 03:51:01] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:51:01] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/28 places, 29/27 transitions.
Product exploration explored 100000 steps with 50000 reset in 237 ms.
Product exploration explored 100000 steps with 50000 reset in 217 ms.
[2021-05-15 03:51:01] [INFO ] Flatten gal took : 3 ms
[2021-05-15 03:51:01] [INFO ] Flatten gal took : 3 ms
[2021-05-15 03:51:01] [INFO ] Time to serialize gal into /tmp/LTL14225080081157960513.gal : 1 ms
[2021-05-15 03:51:01] [INFO ] Time to serialize properties into /tmp/LTL8745101935537381707.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/LTL14225080081157960513.gal, -t, CGAL, -LTL, /tmp/LTL8745101935537381707.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/LTL14225080081157960513.gal -t CGAL -LTL /tmp/LTL8745101935537381707.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((("(p26==1)")||(X("((p7==0)||(p9==0))")))||(("((p7==1)&&(p9==1))")U(X("((p2==1)&&(p10==1))"))))))
Formula 0 simplified : !F("(p26==1)" | X"((p7==0)||(p9==0))" | ("((p7==1)&&(p9==1))" U X"((p2==1)&&(p10==1))"))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t9, t12, t19, t20, t23, t24, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/13/14/27
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
6 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.072679,18312,1,0,79,9628,89,32,1022,10584,69
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-001A-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPs-PT-001A-05 finished in 4738 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)||(p0&&G(F(((p1&&F(p2))||G(p1)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:01] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:01] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:51:01] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:01] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 27/27 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001A-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=4 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(OR (NEQ s11 1) (NEQ s15 1) (NEQ s27 1)), p1:(NEQ s12 1), p2:(NEQ s15 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14107 reset in 137 ms.
Stack based approach found an accepted trace after 26989 steps with 3853 reset with depth 43 and stack size 42 in 52 ms.
FORMULA ShieldIIPs-PT-001A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001A-07 finished in 466 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((((X(p2)||p1) U ((!p3&&X(!p4)&&(X(p2)||p5))||G((X(p2)||p6))))&&p0)))], workingDir=/home/mcc/execution]
Support contains 7 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:02] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:02] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:02] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:02] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:02] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:02] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 27/27 transitions.
Stuttering acceptance computed with spot in 652 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p5) (NOT p6)) (AND (NOT p2) p3 (NOT p6)) (AND (NOT p2) p4 (NOT p6))), (OR (NOT p0) (AND (NOT p2) (NOT p5) (NOT p6)) (AND (NOT p2) p4 (NOT p6)) (AND (NOT p2) p3 (NOT p6))), true, (NOT p2), (OR (AND (NOT p2) (NOT p5) (NOT p6)) (AND (NOT p2) p4 (NOT p6)) (AND (NOT p2) p3 (NOT p6))), (AND (NOT p2) p4 (NOT p6)), (OR (AND (NOT p2) (NOT p5) (NOT p6)) (AND (NOT p2) p4 (NOT p6)) (AND (NOT p2) p3 (NOT p6))), (AND (NOT p2) p4 (NOT p6)), (AND (NOT p6) (NOT p2)), (AND (NOT p2) p4 (NOT p6)), (AND (NOT p2) p4), (AND (NOT p6) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-001A-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p3 (NOT p6) (NOT p1)) (AND p0 (NOT p5) (NOT p6) (NOT p1))), acceptance={} source=1 dest: 3}, { cond=(AND p0 p3), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(OR (AND p0 (NOT p3) (NOT p5) p1) (AND p0 p3 (NOT p6) p1)), acceptance={} source=1 dest: 6}, { cond=(AND p0 (NOT p3) p5 (NOT p6) p1), acceptance={} source=1 dest: 7}, { cond=(OR (AND p0 p3 p6 (NOT p1)) (AND p0 (NOT p5) p6 (NOT p1))), acceptance={} source=1 dest: 8}, { cond=(AND p0 (NOT p3) p5 p6 (NOT p1)), acceptance={} source=1 dest: 9}, { cond=(AND p0 (NOT p3) p5 (NOT p6) (NOT p1)), acceptance={} source=1 dest: 10}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}], [{ cond=(OR (AND p3 (NOT p6) (NOT p1)) (AND (NOT p5) (NOT p6) (NOT p1))), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}, { cond=(NOT p3), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) (NOT p5) p6 p1), acceptance={} source=4 dest: 6}, { cond=(OR (AND p3 (NOT p6) p1) (AND (NOT p5) (NOT p6) p1)), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p3) p5 (NOT p6) p1), acceptance={0} source=4 dest: 7}, { cond=(OR (AND p3 p6 (NOT p1)) (AND (NOT p5) p6 (NOT p1))), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p3) p5 p6 (NOT p1)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p3) p5 (NOT p6) (NOT p1)), acceptance={} source=4 dest: 10}], [{ cond=(OR (AND p3 (NOT p6) (NOT p1) p4) (AND (NOT p5) (NOT p6) (NOT p1) p4)), acceptance={} source=5 dest: 3}, { cond=(AND p3 p4), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p4), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p5) p6 p1 p4), acceptance={} source=5 dest: 6}, { cond=(OR (AND p3 (NOT p6) p1 p4) (AND (NOT p5) (NOT p6) p1 p4)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p3) p5 (NOT p6) p1 p4), acceptance={0} source=5 dest: 7}, { cond=(OR (AND p3 p6 (NOT p1) p4) (AND (NOT p5) p6 (NOT p1) p4)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p3) p5 p6 (NOT p1) p4), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p3) p5 (NOT p6) (NOT p1) p4), acceptance={} source=5 dest: 10}], [{ cond=(OR (AND p3 (NOT p6) (NOT p1) (NOT p2)) (AND (NOT p5) (NOT p6) (NOT p1) (NOT p2))), acceptance={} source=6 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) (NOT p5) p6 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(OR (AND p3 (NOT p6) p1 (NOT p2)) (AND (NOT p5) (NOT p6) p1 (NOT p2))), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p3) p5 (NOT p6) p1 (NOT p2)), acceptance={0} source=6 dest: 7}, { cond=(OR (AND p3 p6 (NOT p1) (NOT p2)) (AND (NOT p5) p6 (NOT p1) (NOT p2))), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p3) p5 p6 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p3) p5 (NOT p6) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=(OR (AND p3 (NOT p6) (NOT p1) p4 (NOT p2)) (AND (NOT p5) (NOT p6) (NOT p1) p4 (NOT p2))), acceptance={} source=7 dest: 3}, { cond=(AND p3 p4 (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) p4 (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) (NOT p5) p6 p1 p4 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(OR (AND p3 (NOT p6) p1 p4 (NOT p2)) (AND (NOT p5) (NOT p6) p1 p4 (NOT p2))), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p3) p5 (NOT p6) p1 p4 (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(OR (AND p3 p6 (NOT p1) p4 (NOT p2)) (AND (NOT p5) p6 (NOT p1) p4 (NOT p2))), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p3) p5 p6 (NOT p1) p4 (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p3) p5 (NOT p6) (NOT p1) p4 (NOT p2)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p6) (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(NOT p2), acceptance={} source=8 dest: 11}], [{ cond=(OR (AND (NOT p3) p5 (NOT p6) p4 (NOT p2)) (AND (NOT p6) p1 p4 (NOT p2))), acceptance={} source=9 dest: 3}, { cond=(AND p4 (NOT p2)), acceptance={} source=9 dest: 11}], [{ cond=(AND p4 (NOT p2)), acceptance={} source=10 dest: 2}], [{ cond=(NOT p6), acceptance={} source=11 dest: 3}, { cond=true, acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s16 1)), p3:(EQ s25 1), p6:(OR (NEQ s13 1) (NEQ s21 1) (NEQ s27 1)), p1:(OR (NEQ s13 1) (NEQ s21 1) (NEQ s27 1)), p5:(OR (NEQ s13 1) (NEQ s21 1) (NEQ s27 1)), p2:(OR (NEQ s13 1) (NEQ s21 1) (NEQ s27 1)), p4:(AND (EQ s6 1) (EQ s17 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][false, false, false, false, false, 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-001A-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001A-08 finished in 766 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X((G(p1) U (p2&&G(p1))))||p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:03] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:03] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:03] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:51:03] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:03] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:03] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 27/27 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-001A-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s3 1) (EQ s24 1)) (AND (EQ s21 1) (EQ s11 1) (EQ s15 1) (EQ s26 1))), p2:(OR (AND (EQ s3 1) (EQ s24 1)) (AND (EQ s21 1) (EQ s11 1) (EQ s15 1) (EQ s26 1))), p1:(AND (EQ s11 1) (EQ s15 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 15680 reset in 151 ms.
Product exploration explored 100000 steps with 15721 reset in 178 ms.
Knowledge obtained : [(NOT p0), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 15721 reset in 125 ms.
Product exploration explored 100000 steps with 15720 reset in 159 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 84 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 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 28 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 28 transition count 30
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 28 transition count 30
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 30/27 (removed -3) transitions.
[2021-05-15 03:51:04] [INFO ] Redundant transitions in 5 ms returned [22]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[22]
// Phase 1: matrix 29 rows 28 cols
[2021-05-15 03:51:04] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:04] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 28/28 places, 29/27 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2021-05-15 03:51:04] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 29 rows 28 cols
[2021-05-15 03:51:04] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:04] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/28 places, 29/27 transitions.
Product exploration explored 100000 steps with 20554 reset in 214 ms.
Product exploration explored 100000 steps with 20530 reset in 173 ms.
[2021-05-15 03:51:04] [INFO ] Flatten gal took : 3 ms
[2021-05-15 03:51:04] [INFO ] Flatten gal took : 3 ms
[2021-05-15 03:51:04] [INFO ] Time to serialize gal into /tmp/LTL8395453324770023940.gal : 1 ms
[2021-05-15 03:51:04] [INFO ] Time to serialize properties into /tmp/LTL11547474359723063376.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/LTL8395453324770023940.gal, -t, CGAL, -LTL, /tmp/LTL11547474359723063376.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/LTL8395453324770023940.gal -t CGAL -LTL /tmp/LTL11547474359723063376.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(((X((G("(((p11==1)&&(p15==1))&&(p26==1))"))U(("(((p3==1)&&(p24==1))||((((p21==1)&&(p11==1))&&(p15==1))&&(p26==1)))")&&(G("(((p11==1)&&(p15==1))&&(p26==1))")))))||("((p3==1)&&(p24==1))"))||("((((p21==1)&&(p11==1))&&(p15==1))&&(p26==1))"))))
Formula 0 simplified : !F("((((p21==1)&&(p11==1))&&(p15==1))&&(p26==1))" | "((p3==1)&&(p24==1))" | X(G"(((p11==1)&&(p15==1))&&(p26==1))" U ("(((p3==1)&&(p24==1))||((((p21==1)&&(p11==1))&&(p15==1))&&(p26==1)))" & G"(((p11==1)&&(p15==1))&&(p26==1))")))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t9, t12, t19, t20, t23, t24, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/13/14/27
Computing Next relation with stutter on 1 deadlock states
9 unique states visited
0 strongly connected components in search stack
8 transitions explored
9 items max in DFS search stack
7 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.080442,18928,1,0,106,9962,97,56,1044,10584,152
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-001A-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPs-PT-001A-09 finished in 1680 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||(!p1 U (p2||G(!p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 transitions.
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 2 place count 27 transition count 26
Applied a total of 2 rules in 7 ms. Remains 27 /28 variables (removed 1) and now considering 26/27 (removed 1) transitions.
// Phase 1: matrix 26 rows 27 cols
[2021-05-15 03:51:04] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:04] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 26 rows 27 cols
[2021-05-15 03:51:04] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:04] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-15 03:51:04] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 26 rows 27 cols
[2021-05-15 03:51:04] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:51:04] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/28 places, 26/27 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001A-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p1)) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (NEQ s0 1) (OR (NEQ s4 1) (NEQ s18 1))), p1:(EQ s0 1), p0:(OR (NEQ s13 1) (NEQ s20 1) (NEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 34 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-001A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001A-10 finished in 182 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1) U (F(p2) U X(G(p3)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:04] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:04] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:04] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:04] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:04] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:51:05] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 27/27 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-001A-11 automaton TGBA [mat=[[{ cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p1 p3) (AND p0 p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s18 1)), p3:(OR (EQ s13 0) (EQ s21 0) (EQ s25 0)), p0:(EQ s0 1), p2:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30213 reset in 133 ms.
Product exploration explored 100000 steps with 30190 reset in 144 ms.
Knowledge obtained : [(NOT p1), p3, p0, (NOT p2)]
Stuttering acceptance computed with spot in 167 ms :[(NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 30386 reset in 133 ms.
Product exploration explored 100000 steps with 30073 reset in 142 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 162 ms :[(NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 7 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 28 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2021-05-15 03:51:06] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:06] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:06] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 27/27 transitions.
Product exploration explored 100000 steps with 30256 reset in 197 ms.
Product exploration explored 100000 steps with 30183 reset in 207 ms.
[2021-05-15 03:51:06] [INFO ] Flatten gal took : 3 ms
[2021-05-15 03:51:06] [INFO ] Flatten gal took : 3 ms
[2021-05-15 03:51:06] [INFO ] Time to serialize gal into /tmp/LTL15668119622523305930.gal : 1 ms
[2021-05-15 03:51:06] [INFO ] Time to serialize properties into /tmp/LTL16571501489418547540.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/LTL15668119622523305930.gal, -t, CGAL, -LTL, /tmp/LTL16571501489418547540.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/LTL15668119622523305930.gal -t CGAL -LTL /tmp/LTL16571501489418547540.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("(p0==1)")U("((p5==1)&&(p18==1))"))U((F("(p26==1)"))U(X(G("(((p13==0)||(p21==0))||(p25==0))"))))))
Formula 0 simplified : !(("(p0==1)" U "((p5==1)&&(p18==1))") U (F"(p26==1)" U XG"(((p13==0)||(p21==0))||(p25==0))"))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t9, t12, t19, t20, t23, t24, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/13/14/27
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
39 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.416298,31732,1,0,241,64938,113,181,1070,104241,398
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPs-PT-001A-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPs-PT-001A-11 finished in 2277 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 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 27 transition count 25
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 25 transition count 25
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 24 transition count 24
Applied a total of 5 rules in 4 ms. Remains 24 /28 variables (removed 4) and now considering 24/27 (removed 3) transitions.
// Phase 1: matrix 24 rows 24 cols
[2021-05-15 03:51:07] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-15 03:51:07] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2021-05-15 03:51:07] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-15 03:51:07] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2021-05-15 03:51:07] [INFO ] Redundant transitions in 4 ms returned [16]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[16]
// Phase 1: matrix 23 rows 24 cols
[2021-05-15 03:51:07] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-15 03:51:07] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 24/28 places, 23/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2021-05-15 03:51:07] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 23 rows 24 cols
[2021-05-15 03:51:07] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-15 03:51:07] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 24/28 places, 23/27 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001A-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s11 1) (EQ s22 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 112 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-001A-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001A-12 finished in 135 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U (p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:07] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:51:07] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:07] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 03:51:07] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 28 cols
[2021-05-15 03:51:07] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 03:51:07] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 27/27 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-001A-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}, { cond=p0, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s26 1), p1:(AND (EQ s4 1) (EQ s19 1))], 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 8192 steps with 719 reset in 10 ms.
FORMULA ShieldIIPs-PT-001A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001A-13 finished in 186 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621050673734
--------------------
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-001A"
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-001A, 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-162098204700165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-001A.tgz
mv ShieldIIPs-PT-001A 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 ;