fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r216-tall-162098205000365
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ShieldIIPt-PT-002B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
412.023 15507.00 29184.00 211.30 TFFFTTFFFFFTTFFF 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-162098205000365.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 ShieldIIPt-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205000365
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 25 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.9K Mar 25 17:52 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 34K 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 ShieldIIPt-PT-002B-00
FORMULA_NAME ShieldIIPt-PT-002B-01
FORMULA_NAME ShieldIIPt-PT-002B-02
FORMULA_NAME ShieldIIPt-PT-002B-03
FORMULA_NAME ShieldIIPt-PT-002B-04
FORMULA_NAME ShieldIIPt-PT-002B-05
FORMULA_NAME ShieldIIPt-PT-002B-06
FORMULA_NAME ShieldIIPt-PT-002B-07
FORMULA_NAME ShieldIIPt-PT-002B-08
FORMULA_NAME ShieldIIPt-PT-002B-09
FORMULA_NAME ShieldIIPt-PT-002B-10
FORMULA_NAME ShieldIIPt-PT-002B-11
FORMULA_NAME ShieldIIPt-PT-002B-12
FORMULA_NAME ShieldIIPt-PT-002B-13
FORMULA_NAME ShieldIIPt-PT-002B-14
FORMULA_NAME ShieldIIPt-PT-002B-15

=== Now, execution of the tool begins

BK_START 1621095655838

Running Version 0
[2021-05-15 16:20:57] [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 16:20:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 16:20:57] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2021-05-15 16:20:57] [INFO ] Transformed 143 places.
[2021-05-15 16:20:57] [INFO ] Transformed 133 transitions.
[2021-05-15 16:20:57] [INFO ] Found NUPN structural information;
[2021-05-15 16:20:57] [INFO ] Parsed PT model containing 143 places and 133 transitions in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Support contains 34 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 133/133 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 131 transition count 121
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 131 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 130 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 130 transition count 120
Applied a total of 26 rules in 43 ms. Remains 130 /143 variables (removed 13) and now considering 120/133 (removed 13) transitions.
// Phase 1: matrix 120 rows 130 cols
[2021-05-15 16:20:57] [INFO ] Computed 19 place invariants in 7 ms
[2021-05-15 16:20:57] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 120 rows 130 cols
[2021-05-15 16:20:57] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-15 16:20:57] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
// Phase 1: matrix 120 rows 130 cols
[2021-05-15 16:20:57] [INFO ] Computed 19 place invariants in 9 ms
[2021-05-15 16:20:57] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Finished structural reductions, in 1 iterations. Remains : 130/143 places, 120/133 transitions.
[2021-05-15 16:20:58] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-15 16:20:58] [INFO ] Flatten gal took : 34 ms
FORMULA ShieldIIPt-PT-002B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 16:20:58] [INFO ] Flatten gal took : 12 ms
[2021-05-15 16:20:58] [INFO ] Input system was already deterministic with 120 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 333 ms. (steps per millisecond=300 ) properties (out of 24) seen :23
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 130 cols
[2021-05-15 16:20:58] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 16:20:58] [INFO ] [Real]Absence check using 19 positive place invariants in 4 ms returned sat
[2021-05-15 16:20:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 16:20:58] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-15 16:20:58] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 3 ms to minimize.
[2021-05-15 16:20:58] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2021-05-15 16:20:58] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2021-05-15 16:20:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 150 ms
[2021-05-15 16:20:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 16:20:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2021-05-15 16:20:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 16:20:58] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-15 16:20:58] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2021-05-15 16:20:58] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2021-05-15 16:20:58] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2021-05-15 16:20:58] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2021-05-15 16:20:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 122 ms
[2021-05-15 16:20:58] [INFO ] Computed and/alt/rep : 119/178/119 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-15 16:20:59] [INFO ] Added : 101 causal constraints over 21 iterations in 201 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (p1 U p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 120/120 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 121 transition count 111
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 121 transition count 111
Applied a total of 18 rules in 12 ms. Remains 121 /130 variables (removed 9) and now considering 111/120 (removed 9) transitions.
// Phase 1: matrix 111 rows 121 cols
[2021-05-15 16:20:59] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 16:20:59] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 111 rows 121 cols
[2021-05-15 16:20:59] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 16:20:59] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 111 rows 121 cols
[2021-05-15 16:20:59] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 16:20:59] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 121/130 places, 111/120 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-002B-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s92 0), p0:(EQ s6 0), p1:(EQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Knowledge obtained : [p2, p0, (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p2)]
Support contains 3 out of 121 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 121/121 places, 111/111 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 121 transition count 111
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 20 place count 121 transition count 127
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 32 place count 121 transition count 127
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 70 place count 121 transition count 127
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 82 place count 109 transition count 115
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 94 place count 109 transition count 115
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 109 transition count 154
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 107 place count 102 transition count 140
Deduced a syphon composed of 57 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 114 place count 102 transition count 140
Deduced a syphon composed of 57 places in 1 ms
Applied a total of 114 rules in 31 ms. Remains 102 /121 variables (removed 19) and now considering 140/111 (removed -29) transitions.
[2021-05-15 16:21:00] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 140 rows 102 cols
[2021-05-15 16:21:00] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 16:21:00] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 102/121 places, 140/111 transitions.
Product exploration explored 100000 steps with 50000 reset in 461 ms.
Product exploration explored 100000 steps with 50000 reset in 435 ms.
[2021-05-15 16:21:01] [INFO ] Flatten gal took : 7 ms
[2021-05-15 16:21:01] [INFO ] Flatten gal took : 7 ms
[2021-05-15 16:21:01] [INFO ] Time to serialize gal into /tmp/LTL8666073964666214427.gal : 3 ms
[2021-05-15 16:21:01] [INFO ] Time to serialize properties into /tmp/LTL10585716766511421357.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/LTL8666073964666214427.gal, -t, CGAL, -LTL, /tmp/LTL10585716766511421357.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/LTL8666073964666214427.gal -t CGAL -LTL /tmp/LTL10585716766511421357.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("(p6==0)"))U(("(p59==1)")U("(p103==0)")))))
Formula 0 simplified : !X(G"(p6==0)" U ("(p59==1)" U "(p103==0)"))
Reverse transition relation is NOT exact ! Due to transitions t5, t10, t15, t20, t25, t30, t33, t37, t38, t41, t42, t43, t44, t45, t47, t48, t52, t58, t63, t69, t71, t74, t79, t83, t88, t91, t92, t93, t94, t95, t97, t98, t99, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/78/33/111
Computing Next relation with stutter on 22 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
138 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.40249,51216,1,0,241,118846,261,116,3313,234653,239
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-002B-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-002B-00 finished in 4135 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p0 U p1) U p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 129 transition count 98
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 108 transition count 98
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 42 place count 108 transition count 86
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 66 place count 96 transition count 86
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 73 place count 89 transition count 79
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 89 transition count 79
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 80 place count 89 transition count 74
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 90 place count 84 transition count 74
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 156 place count 51 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 51 transition count 40
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 3 with 2 rules applied. Total rules applied 159 place count 50 transition count 39
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 167 place count 46 transition count 41
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 46 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 45 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 171 place count 43 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 171 place count 43 transition count 39
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 173 place count 42 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 41 transition count 38
Applied a total of 174 rules in 23 ms. Remains 41 /130 variables (removed 89) and now considering 38/120 (removed 82) transitions.
// Phase 1: matrix 38 rows 41 cols
[2021-05-15 16:21:03] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-15 16:21:03] [INFO ] Implicit Places using invariants in 21 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
[2021-05-15 16:21:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 38 rows 40 cols
[2021-05-15 16:21:03] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-15 16:21:03] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 40/130 places, 38/120 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 39 transition count 37
Applied a total of 2 rules in 5 ms. Remains 39 /40 variables (removed 1) and now considering 37/38 (removed 1) transitions.
// Phase 1: matrix 37 rows 39 cols
[2021-05-15 16:21:03] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-15 16:21:03] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 37 rows 39 cols
[2021-05-15 16:21:03] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-15 16:21:03] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 39/130 places, 37/120 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-002B-01 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p2 p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s8 1) (EQ s22 1)), p1:(EQ s31 1), p0:(EQ s21 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 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-002B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-01 finished in 228 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0)) U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 120/120 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 120 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 120 transition count 110
Applied a total of 20 rules in 3 ms. Remains 120 /130 variables (removed 10) and now considering 110/120 (removed 10) transitions.
// Phase 1: matrix 110 rows 120 cols
[2021-05-15 16:21:03] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 16:21:03] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 110 rows 120 cols
[2021-05-15 16:21:03] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 16:21:03] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 120 cols
[2021-05-15 16:21:03] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-15 16:21:03] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 120/130 places, 110/120 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-002B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s100 1), p0:(EQ s56 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 659 reset in 187 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 1 ms.
FORMULA ShieldIIPt-PT-002B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-03 finished in 462 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||(p1&&F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 129 transition count 95
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 105 transition count 95
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 105 transition count 83
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 93 transition count 83
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 87 transition count 77
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 87 transition count 77
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 84 place count 87 transition count 72
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 82 transition count 72
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 164 place count 47 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 165 place count 47 transition count 36
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 3 with 2 rules applied. Total rules applied 167 place count 46 transition count 35
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 177 place count 41 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 40 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 179 place count 39 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 179 place count 39 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 181 place count 38 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 182 place count 37 transition count 35
Applied a total of 182 rules in 15 ms. Remains 37 /130 variables (removed 93) and now considering 35/120 (removed 85) transitions.
// Phase 1: matrix 35 rows 37 cols
[2021-05-15 16:21:04] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-15 16:21:04] [INFO ] Implicit Places using invariants in 23 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
[2021-05-15 16:21:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 35 rows 36 cols
[2021-05-15 16:21:04] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-15 16:21:04] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 36/130 places, 35/120 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 35 transition count 34
Applied a total of 2 rules in 1 ms. Remains 35 /36 variables (removed 1) and now considering 34/35 (removed 1) transitions.
// Phase 1: matrix 34 rows 35 cols
[2021-05-15 16:21:04] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-15 16:21:04] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 34 rows 35 cols
[2021-05-15 16:21:04] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-15 16:21:04] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 35/130 places, 34/120 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-002B-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s28 1), p0:(NEQ s28 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
[2021-05-15 16:21:04] [INFO ] Flatten gal took : 3 ms
[2021-05-15 16:21:04] [INFO ] Flatten gal took : 3 ms
[2021-05-15 16:21:04] [INFO ] Time to serialize gal into /tmp/LTL6553299365967768936.gal : 1 ms
[2021-05-15 16:21:04] [INFO ] Time to serialize properties into /tmp/LTL6759412404303085891.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/LTL6553299365967768936.gal, -t, CGAL, -LTL, /tmp/LTL6759412404303085891.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/LTL6553299365967768936.gal -t CGAL -LTL /tmp/LTL6759412404303085891.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(p96!=0)")))||(("(p96!=1)")&&(F("(p96!=0)"))))))
Formula 0 simplified : !F(GF"(p96!=0)" | ("(p96!=1)" & F"(p96!=0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 22 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
2 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.030159,17468,1,0,8,3531,24,3,918,4122,14
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-002B-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-002B-04 finished in 801 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 129 transition count 98
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 108 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 107 transition count 97
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 44 place count 107 transition count 87
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 64 place count 97 transition count 87
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 69 place count 92 transition count 82
Iterating global reduction 3 with 5 rules applied. Total rules applied 74 place count 92 transition count 82
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 74 place count 92 transition count 77
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 84 place count 87 transition count 77
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 160 place count 49 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 161 place count 49 transition count 38
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 4 with 2 rules applied. Total rules applied 163 place count 48 transition count 37
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 171 place count 44 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 43 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 174 place count 41 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 174 place count 41 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 176 place count 40 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 39 transition count 36
Applied a total of 177 rules in 17 ms. Remains 39 /130 variables (removed 91) and now considering 36/120 (removed 84) transitions.
// Phase 1: matrix 36 rows 39 cols
[2021-05-15 16:21:04] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-15 16:21:04] [INFO ] Implicit Places using invariants in 21 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
[2021-05-15 16:21:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 36 rows 38 cols
[2021-05-15 16:21:04] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-15 16:21:04] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 38/130 places, 36/120 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 37 transition count 35
Applied a total of 2 rules in 2 ms. Remains 37 /38 variables (removed 1) and now considering 35/36 (removed 1) transitions.
// Phase 1: matrix 35 rows 37 cols
[2021-05-15 16:21:04] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-15 16:21:04] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 35 rows 37 cols
[2021-05-15 16:21:04] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-15 16:21:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 16:21:04] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 37/130 places, 35/120 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-002B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s35 1), p0:(OR (NEQ s18 1) (NEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 162 ms.
Product exploration explored 100000 steps with 2 reset in 214 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4 reset in 158 ms.
Product exploration explored 100000 steps with 1 reset in 208 ms.
[2021-05-15 16:21:05] [INFO ] Flatten gal took : 3 ms
[2021-05-15 16:21:05] [INFO ] Flatten gal took : 2 ms
[2021-05-15 16:21:05] [INFO ] Time to serialize gal into /tmp/LTL15232241345133617134.gal : 1 ms
[2021-05-15 16:21:05] [INFO ] Time to serialize properties into /tmp/LTL8721385002724229000.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/LTL15232241345133617134.gal, -t, CGAL, -LTL, /tmp/LTL8721385002724229000.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/LTL15232241345133617134.gal -t CGAL -LTL /tmp/LTL8721385002724229000.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p50!=1)||(p139!=1))")U(("(p139!=1)")||(G("((p50!=1)||(p139!=1))")))))))
Formula 0 simplified : !GF("((p50!=1)||(p139!=1))" U ("(p139!=1)" | G"((p50!=1)||(p139!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t0.t97, t74.t75, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/33/2/35
Computing Next relation with stutter on 22 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 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.137663,21592,1,0,234,26692,110,139,1229,37512,488
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-002B-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-002B-05 finished in 1200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 129 transition count 96
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 106 transition count 96
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 46 place count 106 transition count 84
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 70 place count 94 transition count 84
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 76 place count 88 transition count 78
Iterating global reduction 2 with 6 rules applied. Total rules applied 82 place count 88 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 82 place count 88 transition count 73
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 83 transition count 73
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 164 place count 47 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 165 place count 47 transition count 36
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 3 with 2 rules applied. Total rules applied 167 place count 46 transition count 35
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 175 place count 42 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 41 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 178 place count 39 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 178 place count 39 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 38 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 181 place count 37 transition count 34
Applied a total of 181 rules in 12 ms. Remains 37 /130 variables (removed 93) and now considering 34/120 (removed 86) transitions.
// Phase 1: matrix 34 rows 37 cols
[2021-05-15 16:21:06] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-15 16:21:06] [INFO ] Implicit Places using invariants in 23 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
[2021-05-15 16:21:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 34 rows 36 cols
[2021-05-15 16:21:06] [INFO ] Computed 16 place invariants in 6 ms
[2021-05-15 16:21:06] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 36/130 places, 34/120 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 35 transition count 33
Applied a total of 2 rules in 2 ms. Remains 35 /36 variables (removed 1) and now considering 33/34 (removed 1) transitions.
// Phase 1: matrix 33 rows 35 cols
[2021-05-15 16:21:06] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-15 16:21:06] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 33 rows 35 cols
[2021-05-15 16:21:06] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-15 16:21:06] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 35/130 places, 33/120 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-002B-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s32 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 44687 steps with 0 reset in 75 ms.
FORMULA ShieldIIPt-PT-002B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-07 finished in 224 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 119 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 119 transition count 109
Applied a total of 22 rules in 2 ms. Remains 119 /130 variables (removed 11) and now considering 109/120 (removed 11) transitions.
// Phase 1: matrix 109 rows 119 cols
[2021-05-15 16:21:06] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 16:21:06] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 109 rows 119 cols
[2021-05-15 16:21:06] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 16:21:06] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 109 rows 119 cols
[2021-05-15 16:21:06] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 16:21:06] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 119/130 places, 109/120 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-002B-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s59 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-002B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-08 finished in 203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0&&X(p1)&&(p2||F(p3)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 120/120 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 120 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 120 transition count 110
Applied a total of 20 rules in 2 ms. Remains 120 /130 variables (removed 10) and now considering 110/120 (removed 10) transitions.
// Phase 1: matrix 110 rows 120 cols
[2021-05-15 16:21:06] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 16:21:06] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 110 rows 120 cols
[2021-05-15 16:21:06] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 16:21:06] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 120 cols
[2021-05-15 16:21:06] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 16:21:06] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 120/130 places, 110/120 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-002B-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p3) (NOT p1))), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s51 1), p2:(EQ s102 1), p3:(EQ s57 0), p1:(AND (EQ s72 1) (EQ s115 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 250 reset in 167 ms.
Stack based approach found an accepted trace after 525 steps with 1 reset with depth 89 and stack size 89 in 2 ms.
FORMULA ShieldIIPt-PT-002B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-09 finished in 526 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 129 transition count 95
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 105 transition count 95
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 48 place count 105 transition count 84
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 70 place count 94 transition count 84
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 89 transition count 79
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 89 transition count 79
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 80 place count 89 transition count 75
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 88 place count 85 transition count 75
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 162 place count 48 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 163 place count 48 transition count 37
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 3 with 2 rules applied. Total rules applied 165 place count 47 transition count 36
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 175 place count 42 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 41 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 40 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 39 transition count 37
Applied a total of 178 rules in 9 ms. Remains 39 /130 variables (removed 91) and now considering 37/120 (removed 83) transitions.
// Phase 1: matrix 37 rows 39 cols
[2021-05-15 16:21:06] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-15 16:21:07] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 37 rows 39 cols
[2021-05-15 16:21:07] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-15 16:21:07] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2021-05-15 16:21:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 37 rows 39 cols
[2021-05-15 16:21:07] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-15 16:21:07] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/130 places, 37/120 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-002B-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s17 1) (EQ s31 1)), p0:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-002B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-10 finished in 159 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 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 119 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 119 transition count 109
Applied a total of 22 rules in 2 ms. Remains 119 /130 variables (removed 11) and now considering 109/120 (removed 11) transitions.
// Phase 1: matrix 109 rows 119 cols
[2021-05-15 16:21:07] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 16:21:07] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 109 rows 119 cols
[2021-05-15 16:21:07] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 16:21:07] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 109 rows 119 cols
[2021-05-15 16:21:07] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 16:21:07] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 119/130 places, 109/120 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-002B-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s64 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 23836 reset in 85 ms.
Product exploration explored 100000 steps with 23857 reset in 96 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23814 reset in 85 ms.
Product exploration explored 100000 steps with 23923 reset in 94 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 119 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 119/119 places, 109/109 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 119 transition count 109
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 22 place count 119 transition count 124
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 33 place count 119 transition count 124
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 70 place count 119 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 119 transition count 123
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 84 place count 106 transition count 110
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 97 place count 106 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 106 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 104 transition count 108
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 104 transition count 108
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 61 places in 1 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 104 transition count 137
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 99 transition count 127
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 99 transition count 127
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 117 rules in 13 ms. Remains 99 /119 variables (removed 20) and now considering 127/109 (removed -18) transitions.
[2021-05-15 16:21:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 127 rows 99 cols
[2021-05-15 16:21:07] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 16:21:07] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 99/119 places, 127/109 transitions.
Product exploration explored 100000 steps with 28552 reset in 331 ms.
Product exploration explored 100000 steps with 28594 reset in 296 ms.
[2021-05-15 16:21:08] [INFO ] Flatten gal took : 6 ms
[2021-05-15 16:21:08] [INFO ] Flatten gal took : 6 ms
[2021-05-15 16:21:08] [INFO ] Time to serialize gal into /tmp/LTL18089429060193898939.gal : 8 ms
[2021-05-15 16:21:08] [INFO ] Time to serialize properties into /tmp/LTL7408196340736653215.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/LTL18089429060193898939.gal, -t, CGAL, -LTL, /tmp/LTL7408196340736653215.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/LTL18089429060193898939.gal -t CGAL -LTL /tmp/LTL7408196340736653215.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p75==1)"))))
Formula 0 simplified : !XF"(p75==1)"
Reverse transition relation is NOT exact ! Due to transitions t5, t10, t15, t20, t25, t30, t36, t38, t41, t42, t43, t44, t45, t47, t48, t52, t58, t63, t69, t74, t79, t83, t88, t91, t92, t93, t94, t95, t97, t98, t99, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/78/31/109
Computing Next relation with stutter on 22 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
113 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.14313,43848,1,0,334,109569,244,176,3241,186199,438
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-002B-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-002B-11 finished in 2664 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(F(p0))) U G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 119 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 119 transition count 109
Applied a total of 22 rules in 1 ms. Remains 119 /130 variables (removed 11) and now considering 109/120 (removed 11) transitions.
// Phase 1: matrix 109 rows 119 cols
[2021-05-15 16:21:09] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-15 16:21:09] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 109 rows 119 cols
[2021-05-15 16:21:09] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 16:21:09] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 109 rows 119 cols
[2021-05-15 16:21:09] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-15 16:21:09] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 119/130 places, 109/120 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-002B-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s38 1), p0:(OR (EQ s82 1) (EQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23591 reset in 94 ms.
Stack based approach found an accepted trace after 2619 steps with 574 reset with depth 63 and stack size 63 in 3 ms.
FORMULA ShieldIIPt-PT-002B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-14 finished in 367 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 129 transition count 96
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 106 transition count 96
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 46 place count 106 transition count 84
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 70 place count 94 transition count 84
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 89 transition count 79
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 89 transition count 79
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 80 place count 89 transition count 75
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 88 place count 85 transition count 75
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 158 place count 50 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 50 transition count 39
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 3 with 2 rules applied. Total rules applied 161 place count 49 transition count 38
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 171 place count 44 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 43 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 174 place count 41 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 174 place count 41 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 40 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 177 place count 39 transition count 38
Applied a total of 177 rules in 9 ms. Remains 39 /130 variables (removed 91) and now considering 38/120 (removed 82) transitions.
// Phase 1: matrix 38 rows 39 cols
[2021-05-15 16:21:10] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-15 16:21:10] [INFO ] Implicit Places using invariants in 26 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
[2021-05-15 16:21:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 38 rows 38 cols
[2021-05-15 16:21:10] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-15 16:21:10] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 38/130 places, 38/120 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 37 transition count 37
Applied a total of 2 rules in 2 ms. Remains 37 /38 variables (removed 1) and now considering 37/38 (removed 1) transitions.
// Phase 1: matrix 37 rows 37 cols
[2021-05-15 16:21:10] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-15 16:21:10] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 37 rows 37 cols
[2021-05-15 16:21:10] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-15 16:21:10] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 37/130 places, 37/120 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-002B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s31 1), p1:(AND (EQ s22 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-002B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-15 finished in 169 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621095671345

--------------------
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="ShieldIIPt-PT-002B"
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 ShieldIIPt-PT-002B, 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-162098205000365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-002B.tgz
mv ShieldIIPt-PT-002B 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;