About the Execution of ITS-Tools for ShieldRVs-PT-001B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 331.336 | 21274.00 | 45152.00 | 479.90 | TTFFFTFFFFTFFTFF | 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.r235-smll-162106564300013.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVs-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564300013
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 9.9K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 104K 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:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 18:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 18:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 13K 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 ShieldRVs-PT-001B-00
FORMULA_NAME ShieldRVs-PT-001B-01
FORMULA_NAME ShieldRVs-PT-001B-02
FORMULA_NAME ShieldRVs-PT-001B-03
FORMULA_NAME ShieldRVs-PT-001B-04
FORMULA_NAME ShieldRVs-PT-001B-05
FORMULA_NAME ShieldRVs-PT-001B-06
FORMULA_NAME ShieldRVs-PT-001B-07
FORMULA_NAME ShieldRVs-PT-001B-08
FORMULA_NAME ShieldRVs-PT-001B-09
FORMULA_NAME ShieldRVs-PT-001B-10
FORMULA_NAME ShieldRVs-PT-001B-11
FORMULA_NAME ShieldRVs-PT-001B-12
FORMULA_NAME ShieldRVs-PT-001B-13
FORMULA_NAME ShieldRVs-PT-001B-14
FORMULA_NAME ShieldRVs-PT-001B-15
=== Now, execution of the tool begins
BK_START 1621112026859
Running Version 0
[2021-05-15 20:53: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 20:53:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 20:53:50] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2021-05-15 20:53:50] [INFO ] Transformed 43 places.
[2021-05-15 20:53:50] [INFO ] Transformed 48 transitions.
[2021-05-15 20:53:50] [INFO ] Found NUPN structural information;
[2021-05-15 20:53:50] [INFO ] Parsed PT model containing 43 places and 48 transitions in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 20:53:50] [INFO ] Initial state test concluded for 2 properties.
FORMULA ShieldRVs-PT-001B-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 42 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 47
Applied a total of 2 rules in 18 ms. Remains 42 /43 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 42 cols
[2021-05-15 20:53:50] [INFO ] Computed 5 place invariants in 11 ms
[2021-05-15 20:53:50] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 47 rows 42 cols
[2021-05-15 20:53:50] [INFO ] Computed 5 place invariants in 5 ms
[2021-05-15 20:53:51] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
// Phase 1: matrix 47 rows 42 cols
[2021-05-15 20:53:51] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-15 20:53:51] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/43 places, 47/48 transitions.
[2021-05-15 20:53:51] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-15 20:53:51] [INFO ] Flatten gal took : 56 ms
FORMULA ShieldRVs-PT-001B-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 20:53:51] [INFO ] Flatten gal took : 20 ms
[2021-05-15 20:53:51] [INFO ] Input system was already deterministic with 47 transitions.
Incomplete random walk after 100000 steps, including 263 resets, run finished after 423 ms. (steps per millisecond=236 ) properties (out of 25) seen :24
Running SMT prover for 1 properties.
// Phase 1: matrix 47 rows 42 cols
[2021-05-15 20:53:52] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-15 20:53:52] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-15 20:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:53:52] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-15 20:53:52] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 4 ms to minimize.
[2021-05-15 20:53:52] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
[2021-05-15 20:53:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 154 ms
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2021-05-15 20:53:52] [INFO ] Initial state test concluded for 1 properties.
FORMULA ShieldRVs-PT-001B-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p1)||G(p2)||p0))))], workingDir=/home/mcc/execution]
Support contains 6 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 47/47 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 38 transition count 43
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 38 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 37 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 37 transition count 42
Applied a total of 10 rules in 5 ms. Remains 37 /42 variables (removed 5) and now considering 42/47 (removed 5) transitions.
// Phase 1: matrix 42 rows 37 cols
[2021-05-15 20:53:52] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-15 20:53:52] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 42 rows 37 cols
[2021-05-15 20:53:52] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:53:52] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 37 cols
[2021-05-15 20:53:52] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:53:52] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/42 places, 42/47 transitions.
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-001B-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s12 1), p0:(OR (EQ s27 1) (AND (EQ s3 1) (EQ s11 1) (EQ s34 1))), p2:(EQ s31 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 11418 reset in 599 ms.
Product exploration explored 100000 steps with 11438 reset in 236 ms.
Knowledge obtained : [(NOT p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 11452 reset in 127 ms.
Product exploration explored 100000 steps with 11466 reset in 362 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 6 out of 37 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 37/37 places, 42/42 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 37 transition count 42
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 37 transition count 49
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 37 transition count 49
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 16 place count 37 transition count 49
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 32 transition count 44
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 32 transition count 44
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 26 rules in 20 ms. Remains 32 /37 variables (removed 5) and now considering 44/42 (removed -2) transitions.
[2021-05-15 20:53:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 32 cols
[2021-05-15 20:53:54] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-15 20:53:55] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 32/37 places, 44/42 transitions.
Product exploration explored 100000 steps with 25000 reset in 670 ms.
Product exploration explored 100000 steps with 25000 reset in 367 ms.
[2021-05-15 20:53:56] [INFO ] Flatten gal took : 12 ms
[2021-05-15 20:53:56] [INFO ] Flatten gal took : 10 ms
[2021-05-15 20:53:56] [INFO ] Time to serialize gal into /tmp/LTL4462759258991983876.gal : 3 ms
[2021-05-15 20:53:56] [INFO ] Time to serialize properties into /tmp/LTL16268884673078241211.ltl : 2 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/LTL4462759258991983876.gal, -t, CGAL, -LTL, /tmp/LTL16268884673078241211.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/LTL4462759258991983876.gal -t CGAL -LTL /tmp/LTL16268884673078241211.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(((("(p31==1)")||(G("(p13==1)")))||(G("(p35==1)")))||("(((p3==1)&&(p12==1))&&(p39==1))")))))
Formula 0 simplified : !XF("(((p3==1)&&(p12==1))&&(p39==1))" | "(p31==1)" | G"(p13==1)" | G"(p35==1)")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t7, t8, t9, t11, t15, t21, t23, t24, t31, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/27/15/42
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
10 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.128349,19388,1,0,156,11962,144,83,1241,13811,378
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVs-PT-001B-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVs-PT-001B-00 finished in 3953 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U (p1 U (p2 U p3))) U X((p1||X((!p3 U p4))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 47/47 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 37 transition count 42
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 37 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 36 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 36 transition count 41
Applied a total of 12 rules in 7 ms. Remains 36 /42 variables (removed 6) and now considering 41/47 (removed 6) transitions.
// Phase 1: matrix 41 rows 36 cols
[2021-05-15 20:53:56] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:53:56] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 41 rows 36 cols
[2021-05-15 20:53:56] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-15 20:53:56] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 36 cols
[2021-05-15 20:53:56] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:53:56] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 36/42 places, 41/47 transitions.
Stuttering acceptance computed with spot in 1003 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (OR (AND (NOT p0) (NOT p1) p2 (NOT p4)) (AND (NOT p0) (NOT p1) p3 (NOT p4))), (AND (NOT p1) (NOT p3) (NOT p4)), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (OR (AND (NOT p0) (NOT p1) p2 (NOT p4)) (AND (NOT p0) (NOT p1) p3 (NOT p4))), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p0) p1 (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p0), (AND (NOT p3) (NOT p4))]
Running random walk in product with property : ShieldRVs-PT-001B-02 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p3 p2 p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 10}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 11}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 12}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=3 dest: 13}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 14}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 15}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=3 dest: 16}], [{ cond=(OR (AND p3 (NOT p1) (NOT p0)) (AND p2 (NOT p1) (NOT p0))), acceptance={} source=4 dest: 6}, { cond=(OR (AND p3 (NOT p1) p0) (AND p2 (NOT p1) p0)), acceptance={} source=4 dest: 14}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 15}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={0} source=6 dest: 6}, { cond=(AND p3 (NOT p4)), acceptance={0} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(OR (AND p3 (NOT p1) (NOT p4)) (AND p2 (NOT p1) (NOT p4)) (AND (NOT p1) p0 (NOT p4))), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p4)), acceptance={0} source=8 dest: 9}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0 (NOT p4)), acceptance={0} source=8 dest: 10}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0) (NOT p4)), acceptance={0} source=8 dest: 11}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0) (NOT p4)), acceptance={0} source=8 dest: 12}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0) (NOT p4)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1) p0 (NOT p4)), acceptance={} source=9 dest: 13}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0 (NOT p4)), acceptance={} source=9 dest: 14}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0) (NOT p4)), acceptance={} source=9 dest: 15}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p4)), acceptance={} source=9 dest: 16}], [{ cond=(OR (AND p3 (NOT p1) (NOT p0) (NOT p4)) (AND p2 (NOT p1) (NOT p0) (NOT p4))), acceptance={} source=10 dest: 6}, { cond=(OR (AND p3 (NOT p1) p0 (NOT p4)) (AND p2 (NOT p1) p0 (NOT p4))), acceptance={} source=10 dest: 14}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p4)), acceptance={} source=11 dest: 15}], [{ cond=(AND (NOT p1) (NOT p4)), acceptance={} source=12 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0) (NOT p4)), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p3) p2 p1 p0 (NOT p4)), acceptance={} source=13 dest: 13}, { cond=(AND (NOT p3) (NOT p2) p1 p0 (NOT p4)), acceptance={} source=13 dest: 14}, { cond=(AND (NOT p3) p2 p1 (NOT p0) (NOT p4)), acceptance={} source=13 dest: 15}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p4)), acceptance={} source=14 dest: 6}, { cond=(AND p3 (NOT p0) (NOT p4)), acceptance={} source=14 dest: 7}, { cond=(AND (NOT p3) p0 (NOT p4)), acceptance={} source=14 dest: 14}, { cond=(AND p3 p0 (NOT p4)), acceptance={} source=14 dest: 17}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p4)), acceptance={0} source=15 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p4)), acceptance={0} source=15 dest: 15}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0) (NOT p4)), acceptance={0} source=16 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1) p0 (NOT p4)), acceptance={0} source=16 dest: 13}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0 (NOT p4)), acceptance={0} source=16 dest: 14}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0) (NOT p4)), acceptance={0} source=16 dest: 15}, { cond=(AND (NOT p3) p0 (NOT p4)), acceptance={0} source=16 dest: 16}, { cond=(AND (NOT p3) p1 (NOT p0) (NOT p4)), acceptance={0} source=16 dest: 18}], [{ cond=(NOT p0), acceptance={} source=17 dest: 7}, { cond=p0, acceptance={} source=17 dest: 17}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p4)), acceptance={0} source=18 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p4)), acceptance={0} source=18 dest: 15}, { cond=(AND (NOT p3) p1 (NOT p4)), acceptance={0} source=18 dest: 18}]], initial=0, aps=[p3:(EQ s32 1), p2:(AND (EQ s12 1) (EQ s16 1) (EQ s23 1)), p1:(AND (EQ s3 1) (EQ s13 1) (EQ s34 1)), p0:(EQ s2 1), p4:(AND (EQ s3 1) (EQ s13 1) (EQ s34 1) (NEQ s32 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, 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, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 346 steps with 12 reset in 2 ms.
FORMULA ShieldRVs-PT-001B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-02 finished in 1215 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0&&X((p0&&X((p0 U (p1||G(p0)))))))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 42 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 42/42 places, 47/47 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 37 transition count 42
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 37 transition count 42
Applied a total of 10 rules in 3 ms. Remains 37 /42 variables (removed 5) and now considering 42/47 (removed 5) transitions.
// Phase 1: matrix 42 rows 37 cols
[2021-05-15 20:53:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:53:57] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 42 rows 37 cols
[2021-05-15 20:53:57] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-15 20:53:57] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 37 cols
[2021-05-15 20:53:57] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-15 20:53:57] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/42 places, 42/47 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(NEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-03 finished in 312 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X((p1||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 47/47 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 36 transition count 41
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 35 transition count 40
Applied a total of 14 rules in 6 ms. Remains 35 /42 variables (removed 7) and now considering 40/47 (removed 7) transitions.
// Phase 1: matrix 40 rows 35 cols
[2021-05-15 20:53:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:53:57] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 40 rows 35 cols
[2021-05-15 20:53:57] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-15 20:53:57] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 35 cols
[2021-05-15 20:53:58] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-15 20:53:58] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/42 places, 40/47 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-05 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s18 1), p1:(AND (EQ s12 1) (EQ s16 1) (EQ s23 1)), p2:(OR (EQ s12 0) (EQ s16 0) (EQ s23 0))], 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 127 ms.
Product exploration explored 100000 steps with 33333 reset in 132 ms.
Knowledge obtained : [(NOT p0), (NOT p1), p2]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 114 ms.
Product exploration explored 100000 steps with 33333 reset in 135 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Support contains 4 out of 35 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 35/35 places, 40/40 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 35 transition count 40
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 4 place count 35 transition count 44
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 35 transition count 44
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 17 place count 35 transition count 44
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 29 transition count 38
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 29 transition count 38
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 29 rules in 11 ms. Remains 29 /35 variables (removed 6) and now considering 38/40 (removed 2) transitions.
[2021-05-15 20:53:59] [INFO ] Redundant transitions in 36 ms returned [37]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[37]
// Phase 1: matrix 37 rows 29 cols
[2021-05-15 20:53:59] [INFO ] Computed 5 place invariants in 7 ms
[2021-05-15 20:53:59] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Starting structural reductions, iteration 1 : 29/35 places, 37/40 transitions.
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 0 rules in 5 ms. Remains 29 /29 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2021-05-15 20:53:59] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 37 rows 29 cols
[2021-05-15 20:53:59] [INFO ] Computed 5 place invariants in 7 ms
[2021-05-15 20:53:59] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/35 places, 37/40 transitions.
Product exploration explored 100000 steps with 33333 reset in 281 ms.
Product exploration explored 100000 steps with 33333 reset in 300 ms.
[2021-05-15 20:54:00] [INFO ] Flatten gal took : 9 ms
[2021-05-15 20:54:00] [INFO ] Flatten gal took : 8 ms
[2021-05-15 20:54:00] [INFO ] Time to serialize gal into /tmp/LTL14974627693228700998.gal : 16 ms
[2021-05-15 20:54:00] [INFO ] Time to serialize properties into /tmp/LTL15392521860805341584.ltl : 2 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/LTL14974627693228700998.gal, -t, CGAL, -LTL, /tmp/LTL15392521860805341584.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/LTL14974627693228700998.gal -t CGAL -LTL /tmp/LTL15392521860805341584.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p22==1)"))||(X(("(((p14==1)&&(p20==1))&&(p28==1))")||(X("(((p14==0)||(p20==0))||(p28==0))"))))))
Formula 0 simplified : !(F"(p22==1)" | X("(((p14==1)&&(p20==1))&&(p28==1))" | X"(((p14==0)||(p20==0))||(p28==0))"))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t7, t8, t9, t11, t15, t20, t24, t31, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/27/13/40
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
13 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.146808,18664,1,0,98,9298,110,46,1172,10455,98
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVs-PT-001B-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldRVs-PT-001B-05 finished in 2656 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 47/47 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 36 transition count 41
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 35 transition count 40
Applied a total of 14 rules in 6 ms. Remains 35 /42 variables (removed 7) and now considering 40/47 (removed 7) transitions.
// Phase 1: matrix 40 rows 35 cols
[2021-05-15 20:54:00] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-15 20:54:00] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 40 rows 35 cols
[2021-05-15 20:54:00] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:54:00] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 35 cols
[2021-05-15 20:54:00] [INFO ] Computed 5 place invariants in 7 ms
[2021-05-15 20:54:00] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/42 places, 40/47 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-001B-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s13 1) (EQ s16 1) (EQ s24 1)), p0:(AND (EQ s3 1) (EQ s11 1) (EQ s32 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 310 steps with 9 reset in 2 ms.
FORMULA ShieldRVs-PT-001B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-06 finished in 369 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 47/47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 41 transition count 42
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 37 transition count 42
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 37 transition count 37
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 32 transition count 37
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 27 transition count 32
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 27 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 28 place count 27 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 26 transition count 31
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 44 place count 19 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 18 transition count 23
Applied a total of 45 rules in 19 ms. Remains 18 /42 variables (removed 24) and now considering 23/47 (removed 24) transitions.
// Phase 1: matrix 23 rows 18 cols
[2021-05-15 20:54:00] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-15 20:54:00] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 23 rows 18 cols
[2021-05-15 20:54:00] [INFO ] Computed 5 place invariants in 7 ms
[2021-05-15 20:54:00] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2021-05-15 20:54:00] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 23 rows 18 cols
[2021-05-15 20:54:00] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-15 20:54:01] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/42 places, 23/47 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : ShieldRVs-PT-001B-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s14 1), p1:(AND (EQ s1 1) (EQ s5 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 391 steps with 12 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-07 finished in 322 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p0)||G((X(G(p2))||p1))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 47/47 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 36 transition count 41
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 35 transition count 40
Applied a total of 14 rules in 4 ms. Remains 35 /42 variables (removed 7) and now considering 40/47 (removed 7) transitions.
// Phase 1: matrix 40 rows 35 cols
[2021-05-15 20:54:01] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-15 20:54:01] [INFO ] Implicit Places using invariants in 362 ms returned []
// Phase 1: matrix 40 rows 35 cols
[2021-05-15 20:54:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:54:01] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 35 cols
[2021-05-15 20:54:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:54:01] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/42 places, 40/47 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s12 1) (NEQ s16 1) (NEQ s24 1)), p1:(OR (AND (EQ s24 1) (EQ s31 1)) (AND (EQ s1 1) (EQ s20 1))), p2:(OR (NEQ s22 1) (NEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 389 reset in 220 ms.
Product exploration explored 100000 steps with 362 reset in 374 ms.
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 404 reset in 145 ms.
Product exploration explored 100000 steps with 368 reset in 526 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 7 out of 35 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 35/35 places, 40/40 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 35 transition count 40
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 3 place count 35 transition count 44
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 35 transition count 44
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 16 place count 35 transition count 44
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 30 transition count 39
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 30 transition count 39
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 26 rules in 6 ms. Remains 30 /35 variables (removed 5) and now considering 39/40 (removed 1) transitions.
[2021-05-15 20:54:03] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 39 rows 30 cols
[2021-05-15 20:54:03] [INFO ] Computed 5 place invariants in 7 ms
[2021-05-15 20:54:03] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/35 places, 39/40 transitions.
Product exploration explored 100000 steps with 368 reset in 84 ms.
Product exploration explored 100000 steps with 399 reset in 216 ms.
[2021-05-15 20:54:04] [INFO ] Flatten gal took : 8 ms
[2021-05-15 20:54:04] [INFO ] Flatten gal took : 10 ms
[2021-05-15 20:54:04] [INFO ] Time to serialize gal into /tmp/LTL17499753605154760304.gal : 4 ms
[2021-05-15 20:54:04] [INFO ] Time to serialize properties into /tmp/LTL17673000241824578285.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/LTL17499753605154760304.gal, -t, CGAL, -LTL, /tmp/LTL17673000241824578285.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/LTL17499753605154760304.gal -t CGAL -LTL /tmp/LTL17673000241824578285.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(((p14!=1)||(p20!=1))||(p29!=1))"))||(G(("(((p29==1)&&(p37==1))||((p1==1)&&(p24==1)))")||(X(G("((p26!=1)||(p37!=1))")))))))))
Formula 0 simplified : !XG(F"(((p14!=1)||(p20!=1))||(p29!=1))" | G("(((p29==1)&&(p37==1))||((p1==1)&&(p24==1)))" | XG"((p26!=1)||(p37!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t7, t8, t9, t11, t15, t20, t24, t31, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/27/13/40
Computing Next relation with stutter on 1 deadlock states
20 unique states visited
0 strongly connected components in search stack
37 transitions explored
20 items max in DFS search stack
21 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.229932,20704,1,0,118,13780,120,82,1245,18912,243
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVs-PT-001B-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVs-PT-001B-10 finished in 3401 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(X(G(!p0))))&&G((p1||(!p2 U (p3||G(!p2)))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 47/47 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 38 transition count 43
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 38 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 37 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 37 transition count 42
Applied a total of 10 rules in 4 ms. Remains 37 /42 variables (removed 5) and now considering 42/47 (removed 5) transitions.
// Phase 1: matrix 42 rows 37 cols
[2021-05-15 20:54:04] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:54:04] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 42 rows 37 cols
[2021-05-15 20:54:04] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:54:04] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 37 cols
[2021-05-15 20:54:04] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-15 20:54:04] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/42 places, 42/47 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR p0 (AND (NOT p1) p2 (NOT p3))), true, p0, (AND p1 (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), p0, p0]
Running random walk in product with property : ShieldRVs-PT-001B-11 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(OR p1 p3 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(OR p1 p3 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR p1 p3 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s12 0), p3:(AND (NEQ s31 1) (NEQ s30 1) (NEQ s24 1)), p2:(EQ s31 1), p0:(OR (NEQ s13 1) (NEQ s17 1) (NEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1200 steps with 4 reset in 2 ms.
FORMULA ShieldRVs-PT-001B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-11 finished in 449 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(p0)||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 47/47 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 36 transition count 41
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 35 transition count 40
Applied a total of 14 rules in 3 ms. Remains 35 /42 variables (removed 7) and now considering 40/47 (removed 7) transitions.
// Phase 1: matrix 40 rows 35 cols
[2021-05-15 20:54:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:54:05] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 40 rows 35 cols
[2021-05-15 20:54:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:54:05] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 35 cols
[2021-05-15 20:54:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:54:05] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/42 places, 40/47 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldRVs-PT-001B-12 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(OR (NEQ s24 1) (NEQ s31 1)), p0:(NEQ s26 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 244 steps with 1 reset in 1 ms.
FORMULA ShieldRVs-PT-001B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-12 finished in 442 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 47/47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 41 transition count 41
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 36 transition count 41
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 36 transition count 37
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 32 transition count 37
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 27 transition count 32
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 27 transition count 32
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 28 place count 27 transition count 30
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 25 transition count 30
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 44 place count 19 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 18 transition count 23
Applied a total of 45 rules in 13 ms. Remains 18 /42 variables (removed 24) and now considering 23/47 (removed 24) transitions.
// Phase 1: matrix 23 rows 18 cols
[2021-05-15 20:54:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:54:05] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 23 rows 18 cols
[2021-05-15 20:54:05] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-15 20:54:05] [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.
[2021-05-15 20:54:05] [INFO ] Redundant transitions in 11 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 22 rows 18 cols
[2021-05-15 20:54:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:54:05] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 18/42 places, 22/47 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2021-05-15 20:54:05] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 22 rows 18 cols
[2021-05-15 20:54:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 20:54:05] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 18/42 places, 22/47 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-001B-13 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s7 1), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 32063 reset in 194 ms.
Product exploration explored 100000 steps with 32068 reset in 256 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 31932 reset in 160 ms.
Product exploration explored 100000 steps with 31929 reset in 169 ms.
[2021-05-15 20:54:06] [INFO ] Flatten gal took : 3 ms
[2021-05-15 20:54:06] [INFO ] Flatten gal took : 2 ms
[2021-05-15 20:54:06] [INFO ] Time to serialize gal into /tmp/LTL9205788311500859098.gal : 1 ms
[2021-05-15 20:54:06] [INFO ] Time to serialize properties into /tmp/LTL15798122371940124039.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/LTL9205788311500859098.gal, -t, CGAL, -LTL, /tmp/LTL15798122371940124039.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/LTL9205788311500859098.gal -t CGAL -LTL /tmp/LTL15798122371940124039.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(p2==1)"))||(F("(p18==1)"))))
Formula 0 simplified : !(G"(p2==1)" | F"(p18==1)")
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t9, t11, t24, t25, t31, t18.t16.t36.t4, t27.t28.t29.t42.t26.t4, t43.t0.t26.t4, t27.t28.t29.t37.t8, t20.t21.t22.t33.t8, t38.t0.t8, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/7/15/22
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
5 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.05212,16596,1,0,90,3123,78,39,691,3349,99
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVs-PT-001B-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldRVs-PT-001B-13 finished in 1399 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621112048133
--------------------
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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ 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="ShieldRVs-PT-001B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-001B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r235-smll-162106564300013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-001B.tgz
mv ShieldRVs-PT-001B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;