Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025100380.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPs-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025100380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 8.1K Apr 30 03:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 30 03:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 03:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 03:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 35K May 10 09:34 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 ShieldPPPs-PT-002B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652973172505

Running Version 202205111006
[2022-05-19 15:12:53] [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]
[2022-05-19 15:12:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:12:53] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2022-05-19 15:12:53] [INFO ] Transformed 139 places.
[2022-05-19 15:12:53] [INFO ] Transformed 129 transitions.
[2022-05-19 15:12:53] [INFO ] Found NUPN structural information;
[2022-05-19 15:12:53] [INFO ] Parsed PT model containing 139 places and 129 transitions in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPs-PT-002B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 129/129 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 131 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 131 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 130 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 130 transition count 120
Applied a total of 18 rules in 25 ms. Remains 130 /139 variables (removed 9) and now considering 120/129 (removed 9) transitions.
// Phase 1: matrix 120 rows 130 cols
[2022-05-19 15:12:53] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-19 15:12:54] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 120 rows 130 cols
[2022-05-19 15:12:54] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-19 15:12:54] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
// Phase 1: matrix 120 rows 130 cols
[2022-05-19 15:12:54] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-19 15:12:54] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/139 places, 120/129 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/139 places, 120/129 transitions.
Support contains 28 out of 130 places after structural reductions.
[2022-05-19 15:12:54] [INFO ] Flatten gal took : 32 ms
[2022-05-19 15:12:54] [INFO ] Flatten gal took : 12 ms
[2022-05-19 15:12:54] [INFO ] Input system was already deterministic with 120 transitions.
Finished random walk after 555 steps, including 1 resets, run visited all 22 properties in 55 ms. (steps per millisecond=10 )
Computed a total of 28 stabilizing places and 28 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(p1))))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 120/120 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 125 transition count 115
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 125 transition count 115
Applied a total of 10 rules in 11 ms. Remains 125 /130 variables (removed 5) and now considering 115/120 (removed 5) transitions.
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:12:54] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-19 15:12:55] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:12:55] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-19 15:12:55] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:12:55] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:12:55] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/130 places, 115/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/130 places, 115/120 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(EQ s124 1), p1:(AND (EQ s79 1) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-00 finished in 617 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 120/120 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 125 transition count 115
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 125 transition count 115
Applied a total of 10 rules in 11 ms. Remains 125 /130 variables (removed 5) and now considering 115/120 (removed 5) transitions.
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:12:55] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:12:55] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:12:55] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-19 15:12:55] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:12:55] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-19 15:12:55] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/130 places, 115/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/130 places, 115/120 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(NEQ s108 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 213 ms.
Product exploration explored 100000 steps with 33333 reset in 110 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-002B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-002B-LTLFireability-01 finished in 826 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 129 transition count 103
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 113 transition count 103
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 32 place count 113 transition count 94
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 50 place count 104 transition count 94
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 98 transition count 88
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 98 transition count 88
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 62 place count 98 transition count 84
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 70 place count 94 transition count 84
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 128 place count 65 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 63 transition count 53
Applied a total of 130 rules in 28 ms. Remains 63 /130 variables (removed 67) and now considering 53/120 (removed 67) transitions.
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:12:56] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:12:56] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:12:56] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:12:56] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-05-19 15:12:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:12:56] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-19 15:12:56] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/130 places, 53/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/130 places, 53/120 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s34 1) (EQ s54 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 159 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-02 finished in 238 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 129 transition count 103
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 113 transition count 103
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 113 transition count 93
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 103 transition count 93
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 98 transition count 88
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 98 transition count 88
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 62 place count 98 transition count 84
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 70 place count 94 transition count 84
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 128 place count 65 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 63 transition count 53
Applied a total of 130 rules in 22 ms. Remains 63 /130 variables (removed 67) and now considering 53/120 (removed 67) transitions.
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:12:56] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:12:56] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:12:56] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:12:56] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2022-05-19 15:12:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:12:56] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:12:56] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/130 places, 53/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/130 places, 53/120 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 214 steps with 1 reset in 1 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-03 finished in 195 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 129 transition count 105
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 115 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 114 transition count 104
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 30 place count 114 transition count 94
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 50 place count 104 transition count 94
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 56 place count 98 transition count 88
Iterating global reduction 3 with 6 rules applied. Total rules applied 62 place count 98 transition count 88
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 62 place count 98 transition count 84
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 70 place count 94 transition count 84
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 128 place count 65 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 63 transition count 53
Applied a total of 130 rules in 21 ms. Remains 63 /130 variables (removed 67) and now considering 53/120 (removed 67) transitions.
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:12:56] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:12:56] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:12:56] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:12:56] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2022-05-19 15:12:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:12:56] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:12:56] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/130 places, 53/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/130 places, 53/120 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s5 1), p0:(OR (NEQ s38 1) (NEQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1960 reset in 316 ms.
Product exploration explored 100000 steps with 2016 reset in 195 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 62 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 53/53 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 53/53 (removed 0) transitions.
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:12:58] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-19 15:12:58] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:12:58] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-19 15:12:58] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2022-05-19 15:12:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:12:58] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:12:58] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 53/53 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1204 steps, including 7 resets, run visited all 2 properties in 16 ms. (steps per millisecond=75 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1976 reset in 160 ms.
Product exploration explored 100000 steps with 2021 reset in 201 ms.
Built C files in :
/tmp/ltsmin7078580170820563715
[2022-05-19 15:12:59] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2022-05-19 15:12:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:12:59] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2022-05-19 15:12:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:12:59] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2022-05-19 15:12:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:12:59] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7078580170820563715
Running compilation step : cd /tmp/ltsmin7078580170820563715;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 225 ms.
Running link step : cd /tmp/ltsmin7078580170820563715;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin7078580170820563715;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17464992377368217005.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 53/53 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 53/53 (removed 0) transitions.
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:13:14] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:13:14] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:13:14] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:13:14] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2022-05-19 15:13:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:13:14] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:13:14] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 53/53 transitions.
Built C files in :
/tmp/ltsmin16824986672784905464
[2022-05-19 15:13:14] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2022-05-19 15:13:14] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:13:14] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2022-05-19 15:13:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:13:14] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2022-05-19 15:13:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:13:14] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16824986672784905464
Running compilation step : cd /tmp/ltsmin16824986672784905464;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 136 ms.
Running link step : cd /tmp/ltsmin16824986672784905464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin16824986672784905464;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6794155149972191526.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 15:13:29] [INFO ] Flatten gal took : 5 ms
[2022-05-19 15:13:29] [INFO ] Flatten gal took : 5 ms
[2022-05-19 15:13:29] [INFO ] Time to serialize gal into /tmp/LTL17924335463047111882.gal : 2 ms
[2022-05-19 15:13:29] [INFO ] Time to serialize properties into /tmp/LTL12810611235374354072.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17924335463047111882.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12810611235374354072.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1792433...268
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p87!=1)||(p89!=1))")||(G("(p17==1)"))))))
Formula 0 simplified : !GF("((p87!=1)||(p89!=1))" | G"(p17==1)")
Reverse transition relation is NOT exact ! Due to transitions t1.t79, t2.t76, t4, t6, t8, t9, t11, t12, t14.t49, t17, t18, t20, t21, t23, t24, t82, t13.t52...375
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2022-05-19 15:13:44] [INFO ] Flatten gal took : 7 ms
[2022-05-19 15:13:44] [INFO ] Applying decomposition
[2022-05-19 15:13:44] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3814671673076537618.txt' '-o' '/tmp/graph3814671673076537618.bin' '-w' '/tmp/graph3814671673076537618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3814671673076537618.bin' '-l' '-1' '-v' '-w' '/tmp/graph3814671673076537618.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:13:44] [INFO ] Decomposing Gal with order
[2022-05-19 15:13:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:13:44] [INFO ] Removed a total of 12 redundant transitions.
[2022-05-19 15:13:44] [INFO ] Flatten gal took : 38 ms
[2022-05-19 15:13:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2022-05-19 15:13:44] [INFO ] Time to serialize gal into /tmp/LTL14692045508418085123.gal : 2 ms
[2022-05-19 15:13:44] [INFO ] Time to serialize properties into /tmp/LTL14335622945177863897.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14692045508418085123.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14335622945177863897.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1469204...247
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i5.u14.p87!=1)||(i4.u15.p89!=1))")||(G("(i1.u2.p17==1)"))))))
Formula 0 simplified : !GF("((i5.u14.p87!=1)||(i4.u15.p89!=1))" | G"(i1.u2.p17==1)")
Reverse transition relation is NOT exact ! Due to transitions t1_t79, t2_t76, t14_t49, t13_t52, t15_t46_t85_t45, i0.t108_t7, i0.t106_t7, i0.u11.t8, i0.u11....533
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5101511169486385014
[2022-05-19 15:14:00] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5101511169486385014
Running compilation step : cd /tmp/ltsmin5101511169486385014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 139 ms.
Running link step : cd /tmp/ltsmin5101511169486385014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5101511169486385014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-002B-LTLFireability-04 finished in 78353 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(X(!F(!p0))) U (X(F(p1))&&G(p1)))))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 120/120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 124 transition count 114
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 124 transition count 114
Applied a total of 12 rules in 4 ms. Remains 124 /130 variables (removed 6) and now considering 114/120 (removed 6) transitions.
// Phase 1: matrix 114 rows 124 cols
[2022-05-19 15:14:15] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:14:15] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 114 rows 124 cols
[2022-05-19 15:14:15] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:14:15] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
// Phase 1: matrix 114 rows 124 cols
[2022-05-19 15:14:15] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:15] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 114/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/130 places, 114/120 transitions.
Stuttering acceptance computed with spot in 236 ms :[p1, p1, p1, (AND p1 p0), (AND p0 p1), (AND p1 p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s64 1), p0:(AND (EQ s27 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 91 ms.
Product exploration explored 100000 steps with 25000 reset in 99 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 172 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 1760 steps, including 4 resets, run visited all 2 properties in 11 ms. (steps per millisecond=160 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (AND p0 p1))]
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 168 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 156 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 124 cols
[2022-05-19 15:14:16] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:14:16] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 114 rows 124 cols
[2022-05-19 15:14:16] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:14:16] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 114 rows 124 cols
[2022-05-19 15:14:16] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:14:16] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 114/114 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 167 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 153 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F p0), (F (AND p0 p1))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 150 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 176 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 166 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 25000 reset in 65 ms.
Product exploration explored 100000 steps with 25000 reset in 83 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 167 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 124 transition count 114
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 14 place count 124 transition count 115
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 124 transition count 115
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 59 place count 124 transition count 115
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 73 place count 110 transition count 101
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 87 place count 110 transition count 101
Deduced a syphon composed of 45 places in 0 ms
Applied a total of 87 rules in 26 ms. Remains 110 /124 variables (removed 14) and now considering 101/114 (removed 13) transitions.
[2022-05-19 15:14:18] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 101 rows 110 cols
[2022-05-19 15:14:18] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:18] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/124 places, 101/114 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/124 places, 101/114 transitions.
Product exploration explored 100000 steps with 25000 reset in 272 ms.
Product exploration explored 100000 steps with 25000 reset in 257 ms.
Built C files in :
/tmp/ltsmin5725349240813471018
[2022-05-19 15:14:18] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5725349240813471018
Running compilation step : cd /tmp/ltsmin5725349240813471018;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 187 ms.
Running link step : cd /tmp/ltsmin5725349240813471018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5725349240813471018;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15169839112367540389.hoa' '--buchi-type=spotba'
LTSmin run took 204 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-002B-LTLFireability-05 finished in 4245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&((p0 U X(p1))||X(G(X(p2))))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 120/120 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 125 transition count 115
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 125 transition count 115
Applied a total of 10 rules in 6 ms. Remains 125 /130 variables (removed 5) and now considering 115/120 (removed 5) transitions.
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:14:19] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-19 15:14:19] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:14:19] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:19] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:14:19] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:14:19] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/130 places, 115/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/130 places, 115/120 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 7}, { cond=p0, acceptance={} source=1 dest: 8}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 2}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 3}]], initial=1, aps=[p0:(EQ s68 1), p2:(AND (EQ s74 1) (EQ s118 1)), p1:(EQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-06 finished in 499 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p0)))'
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 129 transition count 103
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 113 transition count 103
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 113 transition count 93
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 103 transition count 93
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 97 transition count 87
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 97 transition count 87
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 64 place count 97 transition count 83
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 72 place count 93 transition count 83
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 130 place count 64 transition count 54
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 62 transition count 52
Applied a total of 132 rules in 12 ms. Remains 62 /130 variables (removed 68) and now considering 52/120 (removed 68) transitions.
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:14:19] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:19] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:14:19] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:19] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-19 15:14:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:14:19] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:20] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/130 places, 52/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/130 places, 52/120 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s28 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 7939 reset in 107 ms.
Product exploration explored 100000 steps with 8002 reset in 114 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:14:20] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:20] [INFO ] [Real]Absence check using 23 positive place invariants in 4 ms returned sat
[2022-05-19 15:14:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:14:20] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-19 15:14:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:14:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 4 ms returned sat
[2022-05-19 15:14:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:14:20] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-19 15:14:20] [INFO ] Computed and/alt/rep : 50/93/50 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 15:14:20] [INFO ] Added : 30 causal constraints over 6 iterations in 71 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:14:20] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:20] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:14:20] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:21] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2022-05-19 15:14:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:14:21] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:14:21] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 52/52 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:14:21] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:14:21] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2022-05-19 15:14:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:14:21] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-19 15:14:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:14:21] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2022-05-19 15:14:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:14:21] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-19 15:14:21] [INFO ] Computed and/alt/rep : 50/93/50 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-19 15:14:21] [INFO ] Added : 30 causal constraints over 6 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7913 reset in 115 ms.
Product exploration explored 100000 steps with 7991 reset in 115 ms.
Built C files in :
/tmp/ltsmin7046817064857814409
[2022-05-19 15:14:21] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2022-05-19 15:14:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:14:21] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2022-05-19 15:14:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:14:21] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2022-05-19 15:14:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:14:21] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7046817064857814409
Running compilation step : cd /tmp/ltsmin7046817064857814409;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 129 ms.
Running link step : cd /tmp/ltsmin7046817064857814409;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin7046817064857814409;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9667353095211925628.hoa' '--buchi-type=spotba'
LTSmin run took 90 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-002B-LTLFireability-07 finished in 2253 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 120/120 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 125 transition count 115
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 125 transition count 115
Applied a total of 10 rules in 5 ms. Remains 125 /130 variables (removed 5) and now considering 115/120 (removed 5) transitions.
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:14:22] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:14:22] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:14:22] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:14:22] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:14:22] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:14:22] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/130 places, 115/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/130 places, 115/120 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-09 automaton TGBA Formula[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 s65 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-09 finished in 328 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(p0)))&&(!F(X(p1)) U !p1)))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 120/120 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 125 transition count 115
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 125 transition count 115
Applied a total of 10 rules in 3 ms. Remains 125 /130 variables (removed 5) and now considering 115/120 (removed 5) transitions.
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:14:22] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:14:22] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:14:22] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:22] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:14:22] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:14:22] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/130 places, 115/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/130 places, 115/120 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) p1), (NOT p0), p1, true]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s108 1), p0:(EQ s46 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-10 finished in 325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 120/120 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 125 transition count 115
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 125 transition count 115
Applied a total of 10 rules in 8 ms. Remains 125 /130 variables (removed 5) and now considering 115/120 (removed 5) transitions.
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:14:22] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:14:22] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:14:22] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:14:22] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 115 rows 125 cols
[2022-05-19 15:14:22] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:22] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/130 places, 115/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/130 places, 115/120 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-11 finished in 292 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(X(F(p0)))||p1))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 129 transition count 105
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 115 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 114 transition count 104
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 30 place count 114 transition count 94
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 50 place count 104 transition count 94
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 56 place count 98 transition count 88
Iterating global reduction 3 with 6 rules applied. Total rules applied 62 place count 98 transition count 88
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 62 place count 98 transition count 84
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 70 place count 94 transition count 84
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 124 place count 67 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 66 transition count 56
Applied a total of 125 rules in 20 ms. Remains 66 /130 variables (removed 64) and now considering 56/120 (removed 64) transitions.
// Phase 1: matrix 56 rows 66 cols
[2022-05-19 15:14:23] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:14:23] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 56 rows 66 cols
[2022-05-19 15:14:23] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-19 15:14:23] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2022-05-19 15:14:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 56 rows 66 cols
[2022-05-19 15:14:23] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:23] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/130 places, 56/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/130 places, 56/120 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s3 1), p0:(EQ s48 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5652 reset in 122 ms.
Product exploration explored 100000 steps with 5776 reset in 141 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/66 stabilizing places and 2/56 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 271 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 197 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 56/56 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 66 cols
[2022-05-19 15:14:24] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:14:24] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 56 rows 66 cols
[2022-05-19 15:14:24] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:24] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2022-05-19 15:14:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 56 rows 66 cols
[2022-05-19 15:14:24] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:24] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 56/56 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/66 stabilizing places and 2/56 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 293 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 255 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5814 reset in 134 ms.
Product exploration explored 100000 steps with 5910 reset in 137 ms.
Built C files in :
/tmp/ltsmin17984170968658132599
[2022-05-19 15:14:25] [INFO ] Computing symmetric may disable matrix : 56 transitions.
[2022-05-19 15:14:25] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:14:25] [INFO ] Computing symmetric may enable matrix : 56 transitions.
[2022-05-19 15:14:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:14:25] [INFO ] Computing Do-Not-Accords matrix : 56 transitions.
[2022-05-19 15:14:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:14:25] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17984170968658132599
Running compilation step : cd /tmp/ltsmin17984170968658132599;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 142 ms.
Running link step : cd /tmp/ltsmin17984170968658132599;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17984170968658132599;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18417770931706480098.hoa' '--buchi-type=spotba'
LTSmin run took 94 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-002B-LTLFireability-12 finished in 2883 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(((p1 U p2) U G(X(p3))))))'
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 120/120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 124 transition count 114
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 124 transition count 114
Applied a total of 12 rules in 6 ms. Remains 124 /130 variables (removed 6) and now considering 114/120 (removed 6) transitions.
// Phase 1: matrix 114 rows 124 cols
[2022-05-19 15:14:25] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:26] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 114 rows 124 cols
[2022-05-19 15:14:26] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:14:26] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 114 rows 124 cols
[2022-05-19 15:14:26] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:14:26] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 114/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/130 places, 114/120 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2 p3) (AND (NOT p0) p1 p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(EQ s120 1), p2:(AND (EQ s94 1) (EQ s96 1)), p3:(AND (EQ s34 1) (EQ s36 1)), p1:(AND (EQ s120 1) (EQ s34 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17425 steps with 102 reset in 29 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-14 finished in 488 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
[2022-05-19 15:14:26] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13037541802526538082
[2022-05-19 15:14:26] [INFO ] Applying decomposition
[2022-05-19 15:14:26] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2022-05-19 15:14:26] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:14:26] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2022-05-19 15:14:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:14:26] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2022-05-19 15:14:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:14:26] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13037541802526538082
Running compilation step : cd /tmp/ltsmin13037541802526538082;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 15:14:26] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14039760842212322633.txt' '-o' '/tmp/graph14039760842212322633.bin' '-w' '/tmp/graph14039760842212322633.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14039760842212322633.bin' '-l' '-1' '-v' '-w' '/tmp/graph14039760842212322633.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:14:26] [INFO ] Decomposing Gal with order
[2022-05-19 15:14:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:14:26] [INFO ] Removed a total of 18 redundant transitions.
[2022-05-19 15:14:26] [INFO ] Flatten gal took : 23 ms
[2022-05-19 15:14:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-19 15:14:26] [INFO ] Time to serialize gal into /tmp/LTLFireability7939602885389315173.gal : 13 ms
[2022-05-19 15:14:26] [INFO ] Time to serialize properties into /tmp/LTLFireability6435080932765350575.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7939602885389315173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6435080932765350575.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i8.u30.p87!=1)||(i9.u31.p89!=1))")||(G("(i0.i1.u6.p17==1)"))))))
Formula 0 simplified : !GF("((i8.u30.p87!=1)||(i9.u31.p89!=1))" | G"(i0.i1.u6.p17==1)")
Compilation finished in 218 ms.
Running link step : cd /tmp/ltsmin13037541802526538082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin13037541802526538082;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t44, t47, t50, t74, t77, i0.t80, i0.i0.u5.t83, i0.i1.u6.t82, i0.i2.u18.t68, i0.i2.u18.t69, i1...691
Computing Next relation with stutter on 162 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: LTL layer: formula: [](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 1/ 8), 0.011: "[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.011: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.016: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: Initializing POR dependencies: labels 122, guards 120
pins2lts-mc-linux64( 2/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.055: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.061: There are 123 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.061: State length is 131, there are 126 groups
pins2lts-mc-linux64( 0/ 8), 0.061: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.061: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.061: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.061: Visible groups: 0 / 126, labels: 2 / 123
pins2lts-mc-linux64( 0/ 8), 0.061: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.061: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.075: [Blue] ~116 levels ~960 states ~1496 transitions
pins2lts-mc-linux64( 4/ 8), 0.102: [Blue] ~229 levels ~1920 states ~3336 transitions
pins2lts-mc-linux64( 5/ 8), 0.113: [Blue] ~258 levels ~3840 states ~5696 transitions
pins2lts-mc-linux64( 5/ 8), 0.131: [Blue] ~258 levels ~7680 states ~10800 transitions
pins2lts-mc-linux64( 5/ 8), 0.186: [Blue] ~258 levels ~15360 states ~20752 transitions
pins2lts-mc-linux64( 5/ 8), 0.320: [Blue] ~259 levels ~30720 states ~42480 transitions
pins2lts-mc-linux64( 3/ 8), 0.565: [Blue] ~251 levels ~61440 states ~79112 transitions
pins2lts-mc-linux64( 3/ 8), 0.987: [Blue] ~256 levels ~122880 states ~162776 transitions
pins2lts-mc-linux64( 1/ 8), 1.749: [Blue] ~297 levels ~245760 states ~348368 transitions
pins2lts-mc-linux64( 3/ 8), 3.057: [Blue] ~256 levels ~491520 states ~668864 transitions
pins2lts-mc-linux64( 3/ 8), 4.990: [Blue] ~267 levels ~983040 states ~1366592 transitions
pins2lts-mc-linux64( 3/ 8), 8.270: [Blue] ~267 levels ~1966080 states ~2776016 transitions
pins2lts-mc-linux64( 3/ 8), 14.687: [Blue] ~267 levels ~3932160 states ~5614416 transitions
pins2lts-mc-linux64( 3/ 8), 27.389: [Blue] ~272 levels ~7864320 states ~11234968 transitions
pins2lts-mc-linux64( 3/ 8), 54.548: [Blue] ~281 levels ~15728640 states ~22613512 transitions
pins2lts-mc-linux64( 3/ 8), 107.962: [Blue] ~281 levels ~31457280 states ~46001512 transitions
pins2lts-mc-linux64( 3/ 8), 214.508: [Blue] ~281 levels ~62914560 states ~92074136 transitions
pins2lts-mc-linux64( 3/ 8), 430.900: [Blue] ~281 levels ~125829120 states ~185358992 transitions
pins2lts-mc-linux64( 3/ 8), 552.766: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 552.801:
pins2lts-mc-linux64( 0/ 8), 552.801: Explored 139652275 states 185510419 transitions, fanout: 1.328
pins2lts-mc-linux64( 0/ 8), 552.801: Total exploration time 552.730 sec (552.680 sec minimum, 552.710 sec on average)
pins2lts-mc-linux64( 0/ 8), 552.801: States per second: 252659, Transitions per second: 335626
pins2lts-mc-linux64( 0/ 8), 552.801:
pins2lts-mc-linux64( 0/ 8), 552.801: State space has 134217440 states, 69883377 are accepting
pins2lts-mc-linux64( 0/ 8), 552.801: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 552.801: blue states: 139652275 (104.05%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 552.801: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 552.801: all-red states: 86097697 (64.15%), bogus 3395 (0.00%)
pins2lts-mc-linux64( 0/ 8), 552.801:
pins2lts-mc-linux64( 0/ 8), 552.801: Total memory used for local state coloring: 184.0MB
pins2lts-mc-linux64( 0/ 8), 552.801:
pins2lts-mc-linux64( 0/ 8), 552.801: Queue width: 8B, total height: 12059922, memory: 92.01MB
pins2lts-mc-linux64( 0/ 8), 552.801: Tree memory: 1029.1MB, 8.0 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 552.801: Tree fill ratio (roots/leafs): 99.0%/2.0%
pins2lts-mc-linux64( 0/ 8), 552.801: Stored 120 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 552.801: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 552.801: Est. total memory use: 1121.1MB (~1116.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13037541802526538082;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13037541802526538082;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 15:34:56] [INFO ] Applying decomposition
[2022-05-19 15:34:56] [INFO ] Flatten gal took : 7 ms
[2022-05-19 15:34:56] [INFO ] Decomposing Gal with order
[2022-05-19 15:34:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:34:56] [INFO ] Removed a total of 12 redundant transitions.
[2022-05-19 15:34:56] [INFO ] Flatten gal took : 12 ms
[2022-05-19 15:34:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 2 ms.
[2022-05-19 15:34:56] [INFO ] Time to serialize gal into /tmp/LTLFireability6060690420088094614.gal : 2 ms
[2022-05-19 15:34:56] [INFO ] Time to serialize properties into /tmp/LTLFireability2744733911896641629.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6060690420088094614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2744733911896641629.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i1.i0.i0.i0.i0.i0.i0.i1.u33.p87!=1)||(i1.i0.i0.i0.i0.i0.i0.i1.u34.p89!=1))")||(G("(i0.i1.i0.i0.i0.i0.i0.i0.i1.u46.p17==1)")...160
Formula 0 simplified : !GF("((i1.i0.i0.i0.i0.i0.i0.i1.u33.p87!=1)||(i1.i0.i0.i0.i0.i0.i0.i1.u34.p89!=1))" | G"(i0.i1.i0.i0.i0.i0.i0.i0.i1.u46.p17==1)")
Reverse transition relation is NOT exact ! Due to transitions i0.u2.t84, i0.i1.u23.t10, i0.i1.u23.t11, i0.i1.u23.t12, i0.i1.u23.t58, i0.i1.u23.t61, i0.i1.i...1089
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2022-05-19 15:55:27] [INFO ] Flatten gal took : 13 ms
[2022-05-19 15:55:27] [INFO ] Input system was already deterministic with 120 transitions.
[2022-05-19 15:55:27] [INFO ] Transformed 130 places.
[2022-05-19 15:55:27] [INFO ] Transformed 120 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 15:55:27] [INFO ] Time to serialize gal into /tmp/LTLFireability15434634394401991148.gal : 1 ms
[2022-05-19 15:55:27] [INFO ] Time to serialize properties into /tmp/LTLFireability713540371992314382.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15434634394401991148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability713540371992314382.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((p87!=1)||(p89!=1))")||(G("(p17==1)"))))))
Formula 0 simplified : !GF("((p87!=1)||(p89!=1))" | G"(p17==1)")
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t16, t17, t18, t19, t20, t21, t22, t23, t24, t29, ...379
Computing Next relation with stutter on 162 deadlock states

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldPPPs-PT-002B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-002B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025100380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-002B.tgz
mv ShieldPPPs-PT-002B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;