fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r222-tall-165286025400588
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ShieldPPPt-PT-004B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
284.388 12451.00 21109.00 734.20 FFFFFFFFFFFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 7.2K Apr 29 13:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 13:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 13:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 13:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:54 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 74K 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 ShieldPPPt-PT-004B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653018019479

Running Version 202205111006
[2022-05-20 03:40:20] [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-20 03:40:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 03:40:21] [INFO ] Load time of PNML (sax parser for PT used): 1133 ms
[2022-05-20 03:40:21] [INFO ] Transformed 315 places.
[2022-05-20 03:40:21] [INFO ] Transformed 287 transitions.
[2022-05-20 03:40:21] [INFO ] Found NUPN structural information;
[2022-05-20 03:40:21] [INFO ] Parsed PT model containing 315 places and 287 transitions in 1234 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-004B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-004B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-004B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 287/287 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 278 transition count 250
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 278 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 277 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 277 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 276 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 276 transition count 248
Applied a total of 78 rules in 63 ms. Remains 276 /315 variables (removed 39) and now considering 248/287 (removed 39) transitions.
// Phase 1: matrix 248 rows 276 cols
[2022-05-20 03:40:22] [INFO ] Computed 45 place invariants in 19 ms
[2022-05-20 03:40:22] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 248 rows 276 cols
[2022-05-20 03:40:22] [INFO ] Computed 45 place invariants in 5 ms
[2022-05-20 03:40:22] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
// Phase 1: matrix 248 rows 276 cols
[2022-05-20 03:40:22] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-20 03:40:22] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 276/315 places, 248/287 transitions.
Finished structural reductions, in 1 iterations. Remains : 276/315 places, 248/287 transitions.
Support contains 40 out of 276 places after structural reductions.
[2022-05-20 03:40:22] [INFO ] Flatten gal took : 41 ms
[2022-05-20 03:40:22] [INFO ] Flatten gal took : 17 ms
[2022-05-20 03:40:22] [INFO ] Input system was already deterministic with 248 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 32) seen :31
Finished Best-First random walk after 9248 steps, including 2 resets, run visited all 1 properties in 14 ms. (steps per millisecond=660 )
Computed a total of 64 stabilizing places and 64 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)||p1))||G(p2)))'
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 276/276 places, 248/248 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 275 transition count 190
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 218 transition count 190
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 114 place count 218 transition count 164
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 166 place count 192 transition count 164
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 172 place count 186 transition count 158
Iterating global reduction 2 with 6 rules applied. Total rules applied 178 place count 186 transition count 158
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 178 place count 186 transition count 152
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 190 place count 180 transition count 152
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 310 place count 120 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 311 place count 120 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 313 place count 119 transition count 90
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 335 place count 108 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 337 place count 106 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 338 place count 105 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 338 place count 105 transition count 86
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 342 place count 103 transition count 86
Applied a total of 342 rules in 65 ms. Remains 103 /276 variables (removed 173) and now considering 86/248 (removed 162) transitions.
// Phase 1: matrix 86 rows 103 cols
[2022-05-20 03:40:23] [INFO ] Computed 44 place invariants in 0 ms
[2022-05-20 03:40:23] [INFO ] Implicit Places using invariants in 65 ms returned [85, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/276 places, 86/248 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 84
Applied a total of 4 rules in 6 ms. Remains 99 /101 variables (removed 2) and now considering 84/86 (removed 2) transitions.
// Phase 1: matrix 84 rows 99 cols
[2022-05-20 03:40:23] [INFO ] Computed 42 place invariants in 0 ms
[2022-05-20 03:40:23] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 84 rows 99 cols
[2022-05-20 03:40:23] [INFO ] Computed 42 place invariants in 2 ms
[2022-05-20 03:40:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 03:40:23] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/276 places, 84/248 transitions.
Finished structural reductions, in 2 iterations. Remains : 99/276 places, 84/248 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s50 1), p1:(EQ s28 1), p2:(OR (EQ s81 0) (EQ s97 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 18567 reset in 374 ms.
Stack based approach found an accepted trace after 440 steps with 71 reset with depth 10 and stack size 10 in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-00 finished in 882 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X((G(X(G(p0)))&&(p1 U p2))))))'
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 248/248 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 269 transition count 241
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 269 transition count 241
Applied a total of 14 rules in 20 ms. Remains 269 /276 variables (removed 7) and now considering 241/248 (removed 7) transitions.
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:40:24] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-20 03:40:24] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:40:24] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-20 03:40:24] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:40:24] [INFO ] Computed 45 place invariants in 7 ms
[2022-05-20 03:40:24] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/276 places, 241/248 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/276 places, 241/248 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR p2 p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s168 1) (EQ s170 1)), p1:(AND (EQ s228 1) (EQ s268 1)), p0:(OR (EQ s228 0) (EQ s268 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 17 reset in 260 ms.
Stack based approach found an accepted trace after 9321 steps with 2 reset with depth 3928 and stack size 3928 in 33 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-01 finished in 884 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(X(X(p0)))&&X(p1)))||p2)))'
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 248/248 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 270 transition count 242
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 270 transition count 242
Applied a total of 12 rules in 15 ms. Remains 270 /276 variables (removed 6) and now considering 242/248 (removed 6) transitions.
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:40:25] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:25] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:40:25] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:25] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:40:25] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-20 03:40:25] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/276 places, 242/248 transitions.
Finished structural reductions, in 1 iterations. Remains : 270/276 places, 242/248 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 3}]], initial=1, aps=[p2:(AND (EQ s226 1) (EQ s181 1)), p1:(EQ s203 0), p0:(EQ s174 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 127 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-02 finished in 517 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||X(G((G(p1)&&X(p2))))||p3)))'
Support contains 7 out of 276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 248/248 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 270 transition count 242
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 270 transition count 242
Applied a total of 12 rules in 10 ms. Remains 270 /276 variables (removed 6) and now considering 242/248 (removed 6) transitions.
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:40:25] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:25] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:40:25] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:25] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:40:25] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-20 03:40:25] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/276 places, 242/248 transitions.
Finished structural reductions, in 1 iterations. Remains : 270/276 places, 242/248 transitions.
Stuttering acceptance computed with spot in 627 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p3 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p3:(AND (EQ s18 1) (EQ s50 1)), p0:(OR (AND (EQ s18 1) (EQ s50 1)) (AND (EQ s23 1) (EQ s63 1))), p1:(EQ s269 1), p2:(AND (EQ s42 1) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-03 finished in 974 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!X(((X(p0)&&p1) U G(p1)))) U p1)))'
Support contains 1 out of 276 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 248/248 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 270 transition count 242
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 270 transition count 242
Applied a total of 12 rules in 7 ms. Remains 270 /276 variables (removed 6) and now considering 242/248 (removed 6) transitions.
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:40:26] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-20 03:40:26] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:40:26] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:26] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:40:26] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:26] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/276 places, 242/248 transitions.
Finished structural reductions, in 1 iterations. Remains : 270/276 places, 242/248 transitions.
Stuttering acceptance computed with spot in 136 ms :[p1, (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p1, acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s42 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][false, false, false, false]]
Product exploration explored 100000 steps with 128 reset in 179 ms.
Stack based approach found an accepted trace after 3430 steps with 5 reset with depth 145 and stack size 145 in 8 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-06 finished in 674 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 3 out of 276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 276/276 places, 248/248 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 275 transition count 191
Reduce places removed 56 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 58 rules applied. Total rules applied 114 place count 219 transition count 189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 116 place count 217 transition count 189
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 116 place count 217 transition count 163
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 168 place count 191 transition count 163
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 174 place count 185 transition count 157
Iterating global reduction 3 with 6 rules applied. Total rules applied 180 place count 185 transition count 157
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 180 place count 185 transition count 151
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 192 place count 179 transition count 151
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 320 place count 115 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 321 place count 115 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 323 place count 114 transition count 85
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 343 place count 104 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 345 place count 102 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 346 place count 101 transition count 83
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 346 place count 101 transition count 81
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 350 place count 99 transition count 81
Applied a total of 350 rules in 29 ms. Remains 99 /276 variables (removed 177) and now considering 81/248 (removed 167) transitions.
// Phase 1: matrix 81 rows 99 cols
[2022-05-20 03:40:27] [INFO ] Computed 44 place invariants in 0 ms
[2022-05-20 03:40:27] [INFO ] Implicit Places using invariants in 52 ms returned [82, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/276 places, 81/248 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 95 transition count 79
Applied a total of 4 rules in 3 ms. Remains 95 /97 variables (removed 2) and now considering 79/81 (removed 2) transitions.
// Phase 1: matrix 79 rows 95 cols
[2022-05-20 03:40:27] [INFO ] Computed 42 place invariants in 0 ms
[2022-05-20 03:40:27] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 79 rows 95 cols
[2022-05-20 03:40:27] [INFO ] Computed 42 place invariants in 0 ms
[2022-05-20 03:40:27] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/276 places, 79/248 transitions.
Finished structural reductions, in 2 iterations. Remains : 95/276 places, 79/248 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s68 1) (EQ s70 1)), p0:(EQ s51 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, null, null][true, true, true]]
Product exploration explored 100000 steps with 2583 reset in 164 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-07 finished in 503 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (G(F(p1)) U G((X(p2)||p2))))))'
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 248/248 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 269 transition count 241
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 269 transition count 241
Applied a total of 14 rules in 11 ms. Remains 269 /276 variables (removed 7) and now considering 241/248 (removed 7) transitions.
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:40:27] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:27] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:40:27] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:28] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:40:28] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:28] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/276 places, 241/248 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/276 places, 241/248 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s80 1), p0:(EQ s251 1), p1:(AND (EQ s29 1) (EQ s31 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]]
Product exploration explored 100000 steps with 2742 reset in 148 ms.
Stack based approach found an accepted trace after 3010 steps with 91 reset with depth 230 and stack size 230 in 8 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-08 finished in 776 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!G(X(p0)) U F((X(p1)||F(!p0))))))'
Support contains 2 out of 276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 276/276 places, 248/248 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 275 transition count 190
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 115 place count 218 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 217 transition count 189
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 116 place count 217 transition count 164
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 166 place count 192 transition count 164
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 172 place count 186 transition count 158
Iterating global reduction 3 with 6 rules applied. Total rules applied 178 place count 186 transition count 158
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 178 place count 186 transition count 152
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 190 place count 180 transition count 152
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 316 place count 117 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 117 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 319 place count 116 transition count 87
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 341 place count 105 transition count 87
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 343 place count 103 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 344 place count 102 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 344 place count 102 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 348 place count 100 transition count 83
Applied a total of 348 rules in 34 ms. Remains 100 /276 variables (removed 176) and now considering 83/248 (removed 165) transitions.
// Phase 1: matrix 83 rows 100 cols
[2022-05-20 03:40:28] [INFO ] Computed 44 place invariants in 0 ms
[2022-05-20 03:40:28] [INFO ] Implicit Places using invariants in 58 ms returned [83, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/276 places, 83/248 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 96 transition count 81
Applied a total of 4 rules in 3 ms. Remains 96 /98 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 96 cols
[2022-05-20 03:40:28] [INFO ] Computed 42 place invariants in 0 ms
[2022-05-20 03:40:28] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 81 rows 96 cols
[2022-05-20 03:40:28] [INFO ] Computed 42 place invariants in 0 ms
[2022-05-20 03:40:28] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/276 places, 81/248 transitions.
Finished structural reductions, in 2 iterations. Remains : 96/276 places, 81/248 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s23 1), p1:(EQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 944 reset in 181 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-09 finished in 478 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(X(G(p1)))||F(p2)))'
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 248/248 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 271 transition count 243
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 271 transition count 243
Applied a total of 10 rules in 11 ms. Remains 271 /276 variables (removed 5) and now considering 243/248 (removed 5) transitions.
// Phase 1: matrix 243 rows 271 cols
[2022-05-20 03:40:29] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-20 03:40:29] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 243 rows 271 cols
[2022-05-20 03:40:29] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-20 03:40:29] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
// Phase 1: matrix 243 rows 271 cols
[2022-05-20 03:40:29] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:29] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/276 places, 243/248 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/276 places, 243/248 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(EQ s125 1), p0:(OR (EQ s125 1) (AND (EQ s98 1) (EQ s192 1))), p1:(AND (EQ s125 1) (EQ s199 0))], 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]]
Product exploration explored 100000 steps with 293 reset in 164 ms.
Stack based approach found an accepted trace after 1914 steps with 7 reset with depth 255 and stack size 255 in 3 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-10 finished in 688 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(p0))) U G((p1 U G(p2)))))'
Support contains 3 out of 276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 276/276 places, 248/248 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 275 transition count 193
Reduce places removed 54 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 56 rules applied. Total rules applied 110 place count 221 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 219 transition count 191
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 112 place count 219 transition count 166
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 162 place count 194 transition count 166
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 168 place count 188 transition count 160
Iterating global reduction 3 with 6 rules applied. Total rules applied 174 place count 188 transition count 160
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 174 place count 188 transition count 154
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 186 place count 182 transition count 154
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 316 place count 117 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 117 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 319 place count 116 transition count 87
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 335 place count 108 transition count 87
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 337 place count 106 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 338 place count 105 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 338 place count 105 transition count 83
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 342 place count 103 transition count 83
Applied a total of 342 rules in 35 ms. Remains 103 /276 variables (removed 173) and now considering 83/248 (removed 165) transitions.
// Phase 1: matrix 83 rows 103 cols
[2022-05-20 03:40:29] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-20 03:40:29] [INFO ] Implicit Places using invariants in 57 ms returned [84, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/276 places, 83/248 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 81
Applied a total of 4 rules in 4 ms. Remains 99 /101 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 99 cols
[2022-05-20 03:40:29] [INFO ] Computed 42 place invariants in 0 ms
[2022-05-20 03:40:29] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 81 rows 99 cols
[2022-05-20 03:40:29] [INFO ] Computed 42 place invariants in 2 ms
[2022-05-20 03:40:29] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/276 places, 81/248 transitions.
Finished structural reductions, in 2 iterations. Remains : 99/276 places, 81/248 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s53 1), p1:(EQ s78 1), p0:(OR (EQ s78 1) (EQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 193 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-12 finished in 538 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0))||p1))))'
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 248/248 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 269 transition count 241
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 269 transition count 241
Applied a total of 14 rules in 12 ms. Remains 269 /276 variables (removed 7) and now considering 241/248 (removed 7) transitions.
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:40:30] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-20 03:40:30] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:40:30] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:30] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:40:30] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:30] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/276 places, 241/248 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/276 places, 241/248 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s151 1), p0:(EQ s151 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 184 ms.
Stack based approach found an accepted trace after 5451 steps with 0 reset with depth 5452 and stack size 5450 in 12 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-13 finished in 670 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1) U X((!F(p1)||p0))))'
Support contains 2 out of 276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 248/248 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 270 transition count 242
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 270 transition count 242
Applied a total of 12 rules in 7 ms. Remains 270 /276 variables (removed 6) and now considering 242/248 (removed 6) transitions.
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:40:30] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:31] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:40:31] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:31] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:40:31] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:31] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/276 places, 242/248 transitions.
Finished structural reductions, in 1 iterations. Remains : 270/276 places, 242/248 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s42 1), p0:(EQ s70 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 460 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-14 finished in 580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(G(p0))&&p1))))'
Support contains 2 out of 276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 276/276 places, 248/248 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 275 transition count 191
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 219 transition count 191
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 112 place count 219 transition count 164
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 166 place count 192 transition count 164
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 171 place count 187 transition count 159
Iterating global reduction 2 with 5 rules applied. Total rules applied 176 place count 187 transition count 159
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 176 place count 187 transition count 154
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 186 place count 182 transition count 154
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 316 place count 117 transition count 89
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 338 place count 106 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 104 transition count 87
Applied a total of 340 rules in 23 ms. Remains 104 /276 variables (removed 172) and now considering 87/248 (removed 161) transitions.
// Phase 1: matrix 87 rows 104 cols
[2022-05-20 03:40:31] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:40:31] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 87 rows 104 cols
[2022-05-20 03:40:31] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-20 03:40:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 03:40:31] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2022-05-20 03:40:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 87 rows 104 cols
[2022-05-20 03:40:31] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-20 03:40:31] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/276 places, 87/248 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/276 places, 87/248 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT 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={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s101 1), p1:(EQ s94 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6895 steps with 0 reset in 19 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-15 finished in 339 ms.
All properties solved by simple procedures.
Total runtime 11291 ms.

BK_STOP 1653018031930

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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