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-162098205600749.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 ShieldPPPt-PT-004B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205600749
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K 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 98K 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:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 12:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 18:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 18:33 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 74K 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 ShieldPPPt-PT-004B-00
FORMULA_NAME ShieldPPPt-PT-004B-01
FORMULA_NAME ShieldPPPt-PT-004B-02
FORMULA_NAME ShieldPPPt-PT-004B-03
FORMULA_NAME ShieldPPPt-PT-004B-04
FORMULA_NAME ShieldPPPt-PT-004B-05
FORMULA_NAME ShieldPPPt-PT-004B-06
FORMULA_NAME ShieldPPPt-PT-004B-07
FORMULA_NAME ShieldPPPt-PT-004B-08
FORMULA_NAME ShieldPPPt-PT-004B-09
FORMULA_NAME ShieldPPPt-PT-004B-10
FORMULA_NAME ShieldPPPt-PT-004B-11
FORMULA_NAME ShieldPPPt-PT-004B-12
FORMULA_NAME ShieldPPPt-PT-004B-13
FORMULA_NAME ShieldPPPt-PT-004B-14
FORMULA_NAME ShieldPPPt-PT-004B-15

=== Now, execution of the tool begins

BK_START 1621170928183

Running Version 0
[2021-05-16 13:15:40] [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-16 13:15:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 13:15:40] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2021-05-16 13:15:40] [INFO ] Transformed 315 places.
[2021-05-16 13:15:40] [INFO ] Transformed 287 transitions.
[2021-05-16 13:15:40] [INFO ] Found NUPN structural information;
[2021-05-16 13:15:40] [INFO ] Parsed PT model containing 315 places and 287 transitions in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 13:15:40] [INFO ] Initial state test concluded for 1 properties.
FORMULA ShieldPPPt-PT-004B-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 315 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 315/315 places, 287/287 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 275 transition count 247
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 275 transition count 247
Applied a total of 80 rules in 58 ms. Remains 275 /315 variables (removed 40) and now considering 247/287 (removed 40) transitions.
// Phase 1: matrix 247 rows 275 cols
[2021-05-16 13:15:40] [INFO ] Computed 45 place invariants in 15 ms
[2021-05-16 13:15:41] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 247 rows 275 cols
[2021-05-16 13:15:41] [INFO ] Computed 45 place invariants in 3 ms
[2021-05-16 13:15:41] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
// Phase 1: matrix 247 rows 275 cols
[2021-05-16 13:15:41] [INFO ] Computed 45 place invariants in 2 ms
[2021-05-16 13:15:41] [INFO ] Dead Transitions using invariants and state equation in 138 ms returned []
Finished structural reductions, in 1 iterations. Remains : 275/315 places, 247/287 transitions.
[2021-05-16 13:15:41] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-16 13:15:41] [INFO ] Flatten gal took : 62 ms
FORMULA ShieldPPPt-PT-004B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-004B-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-004B-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 13:15:41] [INFO ] Flatten gal took : 23 ms
[2021-05-16 13:15:41] [INFO ] Input system was already deterministic with 247 transitions.
Finished random walk after 744 steps, including 0 resets, run visited all 22 properties in 11 ms. (steps per millisecond=67 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F(G(p0)) U (p0 U X(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 275/275 places, 247/247 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 271 transition count 243
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 270 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 269 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 269 transition count 241
Applied a total of 12 rules in 36 ms. Remains 269 /275 variables (removed 6) and now considering 241/247 (removed 6) transitions.
// Phase 1: matrix 241 rows 269 cols
[2021-05-16 13:15:42] [INFO ] Computed 45 place invariants in 2 ms
[2021-05-16 13:15:42] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 241 rows 269 cols
[2021-05-16 13:15:42] [INFO ] Computed 45 place invariants in 3 ms
[2021-05-16 13:15:42] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
// Phase 1: matrix 241 rows 269 cols
[2021-05-16 13:15:42] [INFO ] Computed 45 place invariants in 5 ms
[2021-05-16 13:15:42] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/275 places, 241/247 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={1} source=4 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s51 1), p1:(EQ s248 1)], nbAcceptance=2, 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 613 reset in 365 ms.
Stack based approach found an accepted trace after 1068 steps with 5 reset with depth 214 and stack size 214 in 4 ms.
FORMULA ShieldPPPt-PT-004B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-01 finished in 1145 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 275/275 places, 247/247 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 274 transition count 187
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 62 rules applied. Total rules applied 121 place count 215 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 123 place count 213 transition count 184
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 123 place count 213 transition count 156
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 179 place count 185 transition count 156
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 182 place count 182 transition count 153
Iterating global reduction 3 with 3 rules applied. Total rules applied 185 place count 182 transition count 153
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 185 place count 182 transition count 150
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 191 place count 179 transition count 150
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 321 place count 114 transition count 85
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 343 place count 103 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 344 place count 102 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 345 place count 101 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 345 place count 101 transition count 82
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 349 place count 99 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 350 place count 98 transition count 81
Applied a total of 350 rules in 57 ms. Remains 98 /275 variables (removed 177) and now considering 81/247 (removed 166) transitions.
// Phase 1: matrix 81 rows 98 cols
[2021-05-16 13:15:43] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-16 13:15:43] [INFO ] Implicit Places using invariants in 59 ms returned [81, 85]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
[2021-05-16 13:15:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 96 cols
[2021-05-16 13:15:43] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-16 13:15:43] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 96/275 places, 81/247 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 94 transition count 79
Applied a total of 4 rules in 5 ms. Remains 94 /96 variables (removed 2) and now considering 79/81 (removed 2) transitions.
// Phase 1: matrix 79 rows 94 cols
[2021-05-16 13:15:43] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-16 13:15:43] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 79 rows 94 cols
[2021-05-16 13:15:43] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-16 13:15:43] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 94/275 places, 79/247 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-03 automaton TGBA [mat=[[{ cond=true, 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=[p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 784 reset in 217 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA ShieldPPPt-PT-004B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-03 finished in 583 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(((G(p0) U X(p1)) U p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 275/275 places, 247/247 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 271 transition count 243
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 270 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 269 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 269 transition count 241
Applied a total of 12 rules in 22 ms. Remains 269 /275 variables (removed 6) and now considering 241/247 (removed 6) transitions.
// Phase 1: matrix 241 rows 269 cols
[2021-05-16 13:15:43] [INFO ] Computed 45 place invariants in 2 ms
[2021-05-16 13:15:43] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 241 rows 269 cols
[2021-05-16 13:15:43] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-16 13:15:44] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
// Phase 1: matrix 241 rows 269 cols
[2021-05-16 13:15:44] [INFO ] Computed 45 place invariants in 2 ms
[2021-05-16 13:15:44] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/275 places, 241/247 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut4210541077897537195.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 13734 ms :[(NOT p2), (NOT p2), (NOT p2), false, (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s52 0), p0:(EQ s135 1), p1:(EQ s126 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 212 ms.
Product exploration explored 100000 steps with 33333 reset in 241 ms.
Knowledge obtained : [p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 203 ms.
Product exploration explored 100000 steps with 33333 reset in 238 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p1), true, (NOT p0)]
Support contains 3 out of 269 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 269/269 places, 241/241 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 269 transition count 241
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 54 place count 269 transition count 256
Deduced a syphon composed of 73 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 73 place count 269 transition count 256
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 149 place count 269 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 150 place count 269 transition count 255
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 180 place count 239 transition count 225
Deduced a syphon composed of 119 places in 1 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 210 place count 239 transition count 225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 239 transition count 225
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 213 place count 237 transition count 223
Deduced a syphon composed of 118 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 215 place count 237 transition count 223
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 130 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 227 place count 237 transition count 274
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 239 place count 225 transition count 250
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 251 place count 225 transition count 250
Deduced a syphon composed of 118 places in 0 ms
Applied a total of 251 rules in 82 ms. Remains 225 /269 variables (removed 44) and now considering 250/241 (removed -9) transitions.
[2021-05-16 13:15:59] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 250 rows 225 cols
[2021-05-16 13:15:59] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-16 13:15:59] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 1 iterations. Remains : 225/269 places, 250/241 transitions.
Product exploration explored 100000 steps with 33333 reset in 294 ms.
Product exploration explored 100000 steps with 33333 reset in 288 ms.
[2021-05-16 13:16:00] [INFO ] Flatten gal took : 15 ms
[2021-05-16 13:16:00] [INFO ] Flatten gal took : 13 ms
[2021-05-16 13:16:00] [INFO ] Time to serialize gal into /tmp/LTL4235925912419187061.gal : 104 ms
[2021-05-16 13:16:00] [INFO ] Time to serialize properties into /tmp/LTL11210026584717964903.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/LTL4235925912419187061.gal, -t, CGAL, -LTL, /tmp/LTL11210026584717964903.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/LTL4235925912419187061.gal -t CGAL -LTL /tmp/LTL11210026584717964903.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(((G("(p155==1)"))U(X("(p143==1)")))U("(p56==0)")))))
Formula 0 simplified : !XX((G"(p155==1)" U X"(p143==1)") U "(p56==0)")
Detected timeout of ITS tools.
[2021-05-16 13:16:22] [INFO ] Flatten gal took : 15 ms
[2021-05-16 13:16:22] [INFO ] Applying decomposition
[2021-05-16 13:16:22] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8426940080212764332.txt, -o, /tmp/graph8426940080212764332.bin, -w, /tmp/graph8426940080212764332.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8426940080212764332.bin, -l, -1, -v, -w, /tmp/graph8426940080212764332.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 13:16:23] [INFO ] Decomposing Gal with order
[2021-05-16 13:16:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 13:16:23] [INFO ] Removed a total of 43 redundant transitions.
[2021-05-16 13:16:23] [INFO ] Flatten gal took : 58 ms
[2021-05-16 13:16:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-16 13:16:23] [INFO ] Time to serialize gal into /tmp/LTL168038697438671253.gal : 7 ms
[2021-05-16 13:16:23] [INFO ] Time to serialize properties into /tmp/LTL13492436009536181034.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/LTL168038697438671253.gal, -t, CGAL, -LTL, /tmp/LTL13492436009536181034.ltl, -c, -stutter-deadlock], 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/LTL168038697438671253.gal -t CGAL -LTL /tmp/LTL13492436009536181034.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(((G("(i7.i1.u48.p155==1)"))U(X("(i4.i2.u46.p143==1)")))U("(i1.i2.u18.p56==0)")))))
Formula 0 simplified : !XX((G"(i7.i1.u48.p155==1)" U X"(i4.i2.u46.p143==1)") U "(i1.i2.u18.p56==0)")
Reverse transition relation is NOT exact ! Due to transitions t50, t53, t96, t99, t142, t145, t190, t193, t221, t235, t244, i0.t183, i0.u14.t187, i1.t196, i1.i0.u6.t199, i1.i1.u7.t198, i1.i2.t175, i1.i2.t179, i2.t239, i2.i0.u11.t192, i2.i1.t165, i2.i1.u21.t170, i3.i0.u2.t200, i3.i1.u9.t195, i3.i2.t160, i3.i2.u23.t155, i4.t230, i4.i1.u35.t144, i4.i2.t118, i4.i2.u46.t122, i5.t148, i5.i0.u30.t151, i5.i1.u31.t150, i5.i2.t127, i5.i2.t131, i6.i0.t135, i6.i0.u38.t139, i6.i1.u57.t101, i7.i0.u33.t147, i7.i1.t113, i7.i1.u47.t109, i8.t89, i8.u61.t93, i9.t102, i9.i0.u54.t105, i9.i1.u55.t104, i9.i2.t81, i9.i2.t85, i10.t72, i10.u68.t76, i11.t226, i11.i0.u59.t98, i11.i1.t67, i11.i1.u71.t63, i12.i0.u80.t55, i12.i1.t45, i12.i1.t47, i13.u82.t52, i13.i1.t19, i13.i1.u93.t15, i14.t56, i14.i0.u77.t59, i14.i1.u78.t58, i14.i2.t34, i14.i2.t38, i15.i1.t24, i15.i1.u92.t29, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/174/67/241
Computing Next relation with stutter on 369558 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
376 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,3.78958,90232,1,0,146425,425,2726,332472,314,1623,168669
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-004B-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldPPPt-PT-004B-04 finished in 43806 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U G((p1 U p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 275/275 places, 247/247 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 274 transition count 190
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 59 rules applied. Total rules applied 115 place count 218 transition count 187
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 119 place count 216 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 121 place count 214 transition count 185
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 121 place count 214 transition count 157
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 177 place count 186 transition count 157
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 181 place count 182 transition count 153
Iterating global reduction 4 with 4 rules applied. Total rules applied 185 place count 182 transition count 153
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 185 place count 182 transition count 149
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 193 place count 178 transition count 149
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 317 place count 116 transition count 87
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 337 place count 106 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 338 place count 105 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 104 transition count 86
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 339 place count 104 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 343 place count 102 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 344 place count 101 transition count 83
Applied a total of 344 rules in 36 ms. Remains 101 /275 variables (removed 174) and now considering 83/247 (removed 164) transitions.
// Phase 1: matrix 83 rows 101 cols
[2021-05-16 13:16:27] [INFO ] Computed 44 place invariants in 0 ms
[2021-05-16 13:16:27] [INFO ] Implicit Places using invariants in 101 ms returned [84, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 108 ms to find 2 implicit places.
[2021-05-16 13:16:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 83 rows 99 cols
[2021-05-16 13:16:27] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-16 13:16:27] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 99/275 places, 83/247 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 97 transition count 81
Applied a total of 4 rules in 20 ms. Remains 97 /99 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 97 cols
[2021-05-16 13:16:27] [INFO ] Computed 42 place invariants in 5 ms
[2021-05-16 13:16:27] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 81 rows 97 cols
[2021-05-16 13:16:27] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-16 13:16:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-16 13:16:27] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 97/275 places, 81/247 transitions.
Stuttering acceptance computed with spot in 12374 ms :[(NOT p2), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-004B-05 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s28 1), p1:(EQ s80 1), p0:(OR (NEQ s6 1) (NEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 22012 reset in 272 ms.
Stack based approach found an accepted trace after 528 steps with 119 reset with depth 3 and stack size 3 in 2 ms.
FORMULA ShieldPPPt-PT-004B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-05 finished in 13132 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 275/275 places, 247/247 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 271 transition count 243
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 270 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 269 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 269 transition count 241
Applied a total of 12 rules in 16 ms. Remains 269 /275 variables (removed 6) and now considering 241/247 (removed 6) transitions.
// Phase 1: matrix 241 rows 269 cols
[2021-05-16 13:16:40] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-16 13:16:40] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 241 rows 269 cols
[2021-05-16 13:16:40] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-16 13:16:41] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
// Phase 1: matrix 241 rows 269 cols
[2021-05-16 13:16:41] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-16 13:16:41] [INFO ] Dead Transitions using invariants and state equation in 145 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/275 places, 241/247 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s14 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 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-004B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-06 finished in 626 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 275/275 places, 247/247 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 274 transition count 189
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 117 place count 217 transition count 186
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 120 place count 215 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 214 transition count 185
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 121 place count 214 transition count 158
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 175 place count 187 transition count 158
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 179 place count 183 transition count 154
Iterating global reduction 4 with 4 rules applied. Total rules applied 183 place count 183 transition count 154
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 183 place count 183 transition count 150
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 191 place count 179 transition count 150
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 319 place count 115 transition count 86
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 339 place count 105 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 340 place count 104 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 341 place count 103 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 341 place count 103 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 345 place count 101 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 346 place count 100 transition count 82
Applied a total of 346 rules in 28 ms. Remains 100 /275 variables (removed 175) and now considering 82/247 (removed 165) transitions.
// Phase 1: matrix 82 rows 100 cols
[2021-05-16 13:16:41] [INFO ] Computed 44 place invariants in 0 ms
[2021-05-16 13:16:41] [INFO ] Implicit Places using invariants in 55 ms returned [82, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
[2021-05-16 13:16:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 82 rows 98 cols
[2021-05-16 13:16:41] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-16 13:16:41] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 98/275 places, 82/247 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 96 transition count 80
Applied a total of 4 rules in 7 ms. Remains 96 /98 variables (removed 2) and now considering 80/82 (removed 2) transitions.
// Phase 1: matrix 80 rows 96 cols
[2021-05-16 13:16:41] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-16 13:16:41] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 80 rows 96 cols
[2021-05-16 13:16:41] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-16 13:16:41] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 96/275 places, 80/247 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-004B-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s78 1), p0:(AND (EQ s91 1) (EQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 829 reset in 209 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA ShieldPPPt-PT-004B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-07 finished in 551 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G((X(p1)||G(p2))))||p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 275/275 places, 247/247 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 272 transition count 244
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 272 transition count 244
Applied a total of 6 rules in 6 ms. Remains 272 /275 variables (removed 3) and now considering 244/247 (removed 3) transitions.
// Phase 1: matrix 244 rows 272 cols
[2021-05-16 13:16:41] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-16 13:16:41] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 244 rows 272 cols
[2021-05-16 13:16:41] [INFO ] Computed 45 place invariants in 4 ms
[2021-05-16 13:16:42] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
// Phase 1: matrix 244 rows 272 cols
[2021-05-16 13:16:42] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-16 13:16:42] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 272/275 places, 244/247 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : ShieldPPPt-PT-004B-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(OR (EQ s162 0) (EQ s204 0)), p2:(AND (NEQ s162 0) (NEQ s204 0) (NEQ s245 1)), p1:(EQ s245 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 264 ms.
Product exploration explored 100000 steps with 50000 reset in 275 ms.
Knowledge obtained : [p0, (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), true]
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Product exploration explored 100000 steps with 50000 reset in 271 ms.
Applying partial POR strategy [false, true, true, true, false, false, true]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), true]
Support contains 3 out of 272 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 272/272 places, 244/244 transitions.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 272 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 272 transition count 243
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 58 place count 272 transition count 257
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 79 place count 272 transition count 257
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 268 transition count 253
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 268 transition count 253
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 2 with 74 rules applied. Total rules applied 161 place count 268 transition count 253
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 190 place count 239 transition count 224
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 219 place count 239 transition count 224
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 234 place count 239 transition count 285
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 249 place count 224 transition count 255
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 264 place count 224 transition count 255
Deduced a syphon composed of 119 places in 0 ms
Applied a total of 264 rules in 26 ms. Remains 224 /272 variables (removed 48) and now considering 255/244 (removed -11) transitions.
[2021-05-16 13:16:43] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 255 rows 224 cols
[2021-05-16 13:16:43] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-16 13:16:44] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Finished structural reductions, in 1 iterations. Remains : 224/272 places, 255/244 transitions.
Product exploration explored 100000 steps with 50000 reset in 304 ms.
Product exploration explored 100000 steps with 50000 reset in 313 ms.
[2021-05-16 13:16:44] [INFO ] Flatten gal took : 11 ms
[2021-05-16 13:16:44] [INFO ] Flatten gal took : 9 ms
[2021-05-16 13:16:44] [INFO ] Time to serialize gal into /tmp/LTL9190094765652285374.gal : 2 ms
[2021-05-16 13:16:44] [INFO ] Time to serialize properties into /tmp/LTL15024661588609856383.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/LTL9190094765652285374.gal, -t, CGAL, -LTL, /tmp/LTL15024661588609856383.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/LTL9190094765652285374.gal -t CGAL -LTL /tmp/LTL15024661588609856383.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p184==0)||(p236==0))")||(X(G((X("(p280==1)"))||(G("(((p184!=0)&&(p236!=0))&&(p280!=1))"))))))))
Formula 0 simplified : !X("((p184==0)||(p236==0))" | XG(X"(p280==1)" | G"(((p184!=0)&&(p236!=0))&&(p280!=1))"))
Detected timeout of ITS tools.
[2021-05-16 13:16:59] [INFO ] Flatten gal took : 9 ms
[2021-05-16 13:16:59] [INFO ] Applying decomposition
[2021-05-16 13:16:59] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2400221447856168456.txt, -o, /tmp/graph2400221447856168456.bin, -w, /tmp/graph2400221447856168456.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2400221447856168456.bin, -l, -1, -v, -w, /tmp/graph2400221447856168456.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 13:16:59] [INFO ] Decomposing Gal with order
[2021-05-16 13:16:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 13:16:59] [INFO ] Removed a total of 40 redundant transitions.
[2021-05-16 13:16:59] [INFO ] Flatten gal took : 21 ms
[2021-05-16 13:16:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-16 13:16:59] [INFO ] Time to serialize gal into /tmp/LTL16630091564879337171.gal : 4 ms
[2021-05-16 13:16:59] [INFO ] Time to serialize properties into /tmp/LTL13119319442056873577.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/LTL16630091564879337171.gal, -t, CGAL, -LTL, /tmp/LTL13119319442056873577.ltl, -c, -stutter-deadlock], 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/LTL16630091564879337171.gal -t CGAL -LTL /tmp/LTL13119319442056873577.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i8.i2.u57.p184==0)||(i8.i4.u70.p236==0))")||(X(G((X("(i14.u86.p280==1)"))||(G("(((i8.i2.u57.p184!=0)&&(i8.i4.u70.p236!=0))&&(i14.u86.p280!=1))"))))))))
Formula 0 simplified : !X("((i8.i2.u57.p184==0)||(i8.i4.u70.p236==0))" | XG(X"(i14.u86.p280==1)" | G"(((i8.i2.u57.p184!=0)&&(i8.i4.u70.p236!=0))&&(i14.u86.p280!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t50, t53, t102, t142, t145, t190, t193, t221, t235, t239, i0.t230, i0.i1.u35.t144, i0.i2.t118, i0.i2.u45.t122, i1.i0.u2.t200, i1.i2.t165, i1.i2.u21.t170, i2.t196, i2.i0.u6.t199, i2.i1.u7.t198, i2.i2.t175, i2.i2.t179, i3.t244, i3.i0.u11.t192, i3.i1.t160, i3.i1.u24.t155, i4.i0.u33.t147, i4.i1.t113, i4.i1.u47.t109, i5.i0.u9.t195, i5.i1.t183, i5.i1.u14.t187, i6.t148, i6.i0.u30.t151, i6.i1.u31.t150, i6.i2.t127, i6.i2.t131, i7.t72, i7.u69.t76, i8.t226, i8.t99, i8.t96, i8.i1.u53.t105, i8.i2.u56.t101, i8.i3.u58.t98, i8.i4.t67, i8.i4.u70.t63, i9.t89, i9.u60.t93, i10.t135, i10.u39.t139, i11.i0.u54.t104, i11.i1.t81, i11.i1.t85, i12.i0.u80.t55, i12.i1.t19, i12.i1.u96.t15, i13.t56, i13.i0.u77.t59, i13.i1.u78.t58, i13.i2.t34, i13.i2.t38, i14.t48, i14.u86.t43, i15.i0.u82.t52, i15.i1.t24, i15.i1.u93.t29, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/177/67/244
Computing Next relation with stutter on 369558 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
581 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,5.84456,109096,1,0,177415,599,2808,417118,318,1607,207582
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-004B-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldPPPt-PT-004B-08 finished in 24524 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X(!p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 275/275 places, 247/247 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 272 transition count 244
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 272 transition count 244
Applied a total of 6 rules in 5 ms. Remains 272 /275 variables (removed 3) and now considering 244/247 (removed 3) transitions.
// Phase 1: matrix 244 rows 272 cols
[2021-05-16 13:17:06] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-16 13:17:06] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 244 rows 272 cols
[2021-05-16 13:17:06] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-16 13:17:06] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 244 rows 272 cols
[2021-05-16 13:17:06] [INFO ] Computed 45 place invariants in 7 ms
[2021-05-16 13:17:06] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 1 iterations. Remains : 272/275 places, 244/247 transitions.
Stuttering acceptance computed with spot in 8679 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s32 0) (EQ s125 0)), p1:(EQ s245 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Product exploration explored 100000 steps with 50000 reset in 272 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 272 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 272/272 places, 244/244 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 272 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 272 transition count 243
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 56 place count 272 transition count 258
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 79 place count 272 transition count 258
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 268 transition count 254
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 268 transition count 254
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 2 with 74 rules applied. Total rules applied 161 place count 268 transition count 254
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 190 place count 239 transition count 225
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 219 place count 239 transition count 225
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 234 place count 239 transition count 288
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 249 place count 224 transition count 258
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 264 place count 224 transition count 258
Deduced a syphon composed of 119 places in 0 ms
Applied a total of 264 rules in 28 ms. Remains 224 /272 variables (removed 48) and now considering 258/244 (removed -14) transitions.
[2021-05-16 13:17:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 258 rows 224 cols
[2021-05-16 13:17:16] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-16 13:17:16] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 1 iterations. Remains : 224/272 places, 258/244 transitions.
Product exploration explored 100000 steps with 50000 reset in 272 ms.
Product exploration explored 100000 steps with 50000 reset in 278 ms.
[2021-05-16 13:17:17] [INFO ] Flatten gal took : 7 ms
[2021-05-16 13:17:17] [INFO ] Flatten gal took : 7 ms
[2021-05-16 13:17:17] [INFO ] Time to serialize gal into /tmp/LTL889955844293047603.gal : 1 ms
[2021-05-16 13:17:17] [INFO ] Time to serialize properties into /tmp/LTL13131889494982004231.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/LTL889955844293047603.gal, -t, CGAL, -LTL, /tmp/LTL13131889494982004231.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/LTL889955844293047603.gal -t CGAL -LTL /tmp/LTL13131889494982004231.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((p32==0)||(p142==0))")||(X("(p280!=1)"))))))
Formula 0 simplified : !XF("((p32==0)||(p142==0))" | X"(p280!=1)")
Detected timeout of ITS tools.
[2021-05-16 13:17:32] [INFO ] Flatten gal took : 8 ms
[2021-05-16 13:17:32] [INFO ] Applying decomposition
[2021-05-16 13:17:32] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14785529540138468399.txt, -o, /tmp/graph14785529540138468399.bin, -w, /tmp/graph14785529540138468399.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14785529540138468399.bin, -l, -1, -v, -w, /tmp/graph14785529540138468399.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 13:17:32] [INFO ] Decomposing Gal with order
[2021-05-16 13:17:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 13:17:32] [INFO ] Removed a total of 40 redundant transitions.
[2021-05-16 13:17:32] [INFO ] Flatten gal took : 15 ms
[2021-05-16 13:17:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-16 13:17:32] [INFO ] Time to serialize gal into /tmp/LTL4743227908050956051.gal : 3 ms
[2021-05-16 13:17:32] [INFO ] Time to serialize properties into /tmp/LTL4187206232767020825.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/LTL4743227908050956051.gal, -t, CGAL, -LTL, /tmp/LTL4187206232767020825.ltl, -c, -stutter-deadlock], 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/LTL4743227908050956051.gal -t CGAL -LTL /tmp/LTL4187206232767020825.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("((i1.i2.u11.p32==0)||(i9.u45.p142==0))")||(X("(i16.u85.p280!=1)"))))))
Formula 0 simplified : !XF("((i1.i2.u11.p32==0)||(i9.u45.p142==0))" | X"(i16.u85.p280!=1)")
Reverse transition relation is NOT exact ! Due to transitions t50, t53, t96, t99, t148, t193, t196, t221, t226, t230, t239, i0.t165, i0.u21.t170, i1.t244, i1.t190, i1.i1.u6.t199, i1.i2.u11.t192, i1.i3.t160, i1.i3.u23.t155, i2.t183, i2.u14.t187, i3.i0.u2.t200, i3.i1.u9.t195, i4.i0.u7.t198, i4.i1.t175, i4.i1.t179, i5.t72, i5.u69.t76, i6.t235, i6.t145, i6.t142, i6.i1.u30.t151, i6.i2.u33.t147, i6.i3.u35.t144, i6.i4.t113, i6.i4.u48.t109, i7.t135, i7.u37.t139, i8.i0.u31.t150, i8.i1.t127, i8.i1.t131, i9.t118, i9.u45.t122, i10.t102, i10.i0.u53.t105, i10.i1.u54.t104, i10.i2.t81, i10.i2.t85, i11.i0.t89, i11.i0.u61.t93, i11.i1.u80.t55, i12.i0.u56.t101, i12.i1.t67, i12.i1.u71.t63, i13.i0.u58.t98, i13.i1.t24, i13.i1.u91.t29, i14.i1.u82.t52, i14.i2.t19, i14.i2.u93.t15, i15.i0.t56, i15.i0.u77.t59, i15.i0.u78.t58, i15.i1.t34, i15.i1.t38, i16.t48, i16.u85.t43, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/177/67/244
Computing Next relation with stutter on 369558 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
539 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,5.41285,130272,1,0,203467,445,2854,669411,334,1439,208691
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-004B-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldPPPt-PT-004B-09 finished in 41158 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 275/275 places, 247/247 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 274 transition count 189
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 117 place count 217 transition count 186
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 121 place count 215 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 213 transition count 184
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 123 place count 213 transition count 156
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 179 place count 185 transition count 156
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 183 place count 181 transition count 152
Iterating global reduction 4 with 4 rules applied. Total rules applied 187 place count 181 transition count 152
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 187 place count 181 transition count 148
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 195 place count 177 transition count 148
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 319 place count 115 transition count 86
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 341 place count 104 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 342 place count 103 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 343 place count 102 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 343 place count 102 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 347 place count 100 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 348 place count 99 transition count 82
Applied a total of 348 rules in 21 ms. Remains 99 /275 variables (removed 176) and now considering 82/247 (removed 165) transitions.
// Phase 1: matrix 82 rows 99 cols
[2021-05-16 13:17:48] [INFO ] Computed 44 place invariants in 0 ms
[2021-05-16 13:17:48] [INFO ] Implicit Places using invariants in 49 ms returned [82, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
[2021-05-16 13:17:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 82 rows 97 cols
[2021-05-16 13:17:48] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-16 13:17:48] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 97/275 places, 82/247 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 95 transition count 80
Applied a total of 4 rules in 4 ms. Remains 95 /97 variables (removed 2) and now considering 80/82 (removed 2) transitions.
// Phase 1: matrix 80 rows 95 cols
[2021-05-16 13:17:48] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-16 13:17:48] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 80 rows 95 cols
[2021-05-16 13:17:48] [INFO ] Computed 42 place invariants in 2 ms
[2021-05-16 13:17:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 13:17:48] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 95/275 places, 80/247 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s18 1) (NEQ s45 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 53876 steps with 0 reset in 117 ms.
FORMULA ShieldPPPt-PT-004B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-10 finished in 1429 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 275/275 places, 247/247 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 274 transition count 188
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 61 rules applied. Total rules applied 119 place count 216 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 214 transition count 185
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 121 place count 214 transition count 157
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 177 place count 186 transition count 157
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 181 place count 182 transition count 153
Iterating global reduction 3 with 4 rules applied. Total rules applied 185 place count 182 transition count 153
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 185 place count 182 transition count 149
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 193 place count 178 transition count 149
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 319 place count 115 transition count 86
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 341 place count 104 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 342 place count 103 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 343 place count 102 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 343 place count 102 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 347 place count 100 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 348 place count 99 transition count 82
Applied a total of 348 rules in 18 ms. Remains 99 /275 variables (removed 176) and now considering 82/247 (removed 165) transitions.
// Phase 1: matrix 82 rows 99 cols
[2021-05-16 13:17:48] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-16 13:17:49] [INFO ] Implicit Places using invariants in 53 ms returned [82, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 62 ms to find 2 implicit places.
[2021-05-16 13:17:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 82 rows 97 cols
[2021-05-16 13:17:49] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-16 13:17:49] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 97/275 places, 82/247 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 95 transition count 80
Applied a total of 4 rules in 2 ms. Remains 95 /97 variables (removed 2) and now considering 80/82 (removed 2) transitions.
// Phase 1: matrix 80 rows 95 cols
[2021-05-16 13:17:49] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-16 13:17:49] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 80 rows 95 cols
[2021-05-16 13:17:49] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-16 13:17:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 13:17:49] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 95/275 places, 80/247 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s74 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19645 reset in 165 ms.
Stack based approach found an accepted trace after 10 steps with 2 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldPPPt-PT-004B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-12 finished in 471 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G((G(p2)||p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 275/275 places, 247/247 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 274 transition count 189
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 117 place count 217 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 215 transition count 186
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 119 place count 215 transition count 158
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 175 place count 187 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 178 place count 184 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 181 place count 184 transition count 155
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 181 place count 184 transition count 152
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 187 place count 181 transition count 152
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 313 place count 118 transition count 89
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 335 place count 107 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 336 place count 106 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 337 place count 105 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 337 place count 105 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 341 place count 103 transition count 86
Applied a total of 341 rules in 15 ms. Remains 103 /275 variables (removed 172) and now considering 86/247 (removed 161) transitions.
// Phase 1: matrix 86 rows 103 cols
[2021-05-16 13:17:49] [INFO ] Computed 44 place invariants in 0 ms
[2021-05-16 13:17:49] [INFO ] Implicit Places using invariants in 54 ms returned [86, 90]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
[2021-05-16 13:17:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 86 rows 101 cols
[2021-05-16 13:17:49] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-16 13:17:49] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 101/275 places, 86/247 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 84
Applied a total of 4 rules in 2 ms. Remains 99 /101 variables (removed 2) and now considering 84/86 (removed 2) transitions.
// Phase 1: matrix 84 rows 99 cols
[2021-05-16 13:17:49] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-16 13:17:49] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 84 rows 99 cols
[2021-05-16 13:17:49] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-16 13:17:49] [INFO ] State equation strengthened by 19 read => feed constraints.
[2021-05-16 13:17:49] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 99/275 places, 84/247 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-14 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s15 1) (EQ s32 1)) (EQ s29 1)), p2:(EQ s1 1), p0:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 45815 steps with 0 reset in 100 ms.
FORMULA ShieldPPPt-PT-004B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-14 finished in 457 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U (p1||G(F(!p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 275/275 places, 247/247 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 274 transition count 189
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 117 place count 217 transition count 186
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 120 place count 215 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 214 transition count 185
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 121 place count 214 transition count 158
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 175 place count 187 transition count 158
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 179 place count 183 transition count 154
Iterating global reduction 4 with 4 rules applied. Total rules applied 183 place count 183 transition count 154
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 183 place count 183 transition count 150
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 191 place count 179 transition count 150
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 317 place count 116 transition count 87
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 337 place count 106 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 338 place count 105 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 104 transition count 86
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 339 place count 104 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 343 place count 102 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 344 place count 101 transition count 83
Applied a total of 344 rules in 19 ms. Remains 101 /275 variables (removed 174) and now considering 83/247 (removed 164) transitions.
// Phase 1: matrix 83 rows 101 cols
[2021-05-16 13:17:49] [INFO ] Computed 44 place invariants in 0 ms
[2021-05-16 13:17:49] [INFO ] Implicit Places using invariants in 49 ms returned [84, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
[2021-05-16 13:17:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 83 rows 99 cols
[2021-05-16 13:17:49] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-16 13:17:50] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 99/275 places, 83/247 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 97 transition count 81
Applied a total of 4 rules in 2 ms. Remains 97 /99 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 97 cols
[2021-05-16 13:17:50] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-16 13:17:50] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 81 rows 97 cols
[2021-05-16 13:17:50] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-16 13:17:50] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 97/275 places, 81/247 transitions.
Stuttering acceptance computed with spot in 77 ms :[false, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-004B-15 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s73 1), p0:(OR (NEQ s68 1) (NEQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 215 reset in 225 ms.
Product exploration explored 100000 steps with 222 reset in 270 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 69 ms :[false, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 206 reset in 204 ms.
Product exploration explored 100000 steps with 221 reset in 227 ms.
[2021-05-16 13:17:51] [INFO ] Flatten gal took : 4 ms
[2021-05-16 13:17:51] [INFO ] Flatten gal took : 3 ms
[2021-05-16 13:17:51] [INFO ] Time to serialize gal into /tmp/LTL7586640115635591981.gal : 0 ms
[2021-05-16 13:17:51] [INFO ] Time to serialize properties into /tmp/LTL1563289265618208248.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/LTL7586640115635591981.gal, -t, CGAL, -LTL, /tmp/LTL1563289265618208248.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/LTL7586640115635591981.gal -t CGAL -LTL /tmp/LTL1563289265618208248.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(F("((p191!=1)||(p224!=1))")))U(("(p199==1)")||(G(F("(p199!=1)"))))))
Formula 0 simplified : !(GF"((p191!=1)||(p224!=1))" U ("(p199==1)" | GF"(p199!=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 369558 deadlock states
Detected timeout of ITS tools.
[2021-05-16 13:18:06] [INFO ] Flatten gal took : 3 ms
[2021-05-16 13:18:06] [INFO ] Applying decomposition
[2021-05-16 13:18:06] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17467260035217929263.txt, -o, /tmp/graph17467260035217929263.bin, -w, /tmp/graph17467260035217929263.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17467260035217929263.bin, -l, -1, -v, -w, /tmp/graph17467260035217929263.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 13:18:06] [INFO ] Decomposing Gal with order
[2021-05-16 13:18:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 13:18:06] [INFO ] Removed a total of 33 redundant transitions.
[2021-05-16 13:18:06] [INFO ] Flatten gal took : 6 ms
[2021-05-16 13:18:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 2 ms.
[2021-05-16 13:18:06] [INFO ] Time to serialize gal into /tmp/LTL17762417721081951532.gal : 1 ms
[2021-05-16 13:18:06] [INFO ] Time to serialize properties into /tmp/LTL1896514511245616976.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/LTL17762417721081951532.gal, -t, CGAL, -LTL, /tmp/LTL1896514511245616976.ltl, -c, -stutter-deadlock], 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/LTL17762417721081951532.gal -t CGAL -LTL /tmp/LTL1896514511245616976.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G(F("((i7.u24.p191!=1)||(i7.u27.p224!=1))")))U(("(i6.u26.p199==1)")||(G(F("(i6.u26.p199!=1)"))))))
Formula 0 simplified : !(GF"((i7.u24.p191!=1)||(i7.u27.p224!=1))" U ("(i6.u26.p199==1)" | GF"(i6.u26.p199!=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 369558 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
15 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.165828,22264,1,0,8731,150,866,19082,173,507,13129
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-004B-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldPPPt-PT-004B-15 finished in 16723 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621171087907

--------------------
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="ShieldPPPt-PT-004B"
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 ShieldPPPt-PT-004B, 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-162098205600749"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-004B.tgz
mv ShieldPPPt-PT-004B 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 ;