About the Execution of ITS-Tools for ShieldPPPt-PT-002A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 292.552 | 32949.00 | 17098.00 | 12746.70 | FFFFFFFFFTFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205500709.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-002A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205500709
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 12:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 18:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 18:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 14K May 5 16:52 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-002A-00
FORMULA_NAME ShieldPPPt-PT-002A-01
FORMULA_NAME ShieldPPPt-PT-002A-02
FORMULA_NAME ShieldPPPt-PT-002A-03
FORMULA_NAME ShieldPPPt-PT-002A-04
FORMULA_NAME ShieldPPPt-PT-002A-05
FORMULA_NAME ShieldPPPt-PT-002A-06
FORMULA_NAME ShieldPPPt-PT-002A-07
FORMULA_NAME ShieldPPPt-PT-002A-08
FORMULA_NAME ShieldPPPt-PT-002A-09
FORMULA_NAME ShieldPPPt-PT-002A-10
FORMULA_NAME ShieldPPPt-PT-002A-11
FORMULA_NAME ShieldPPPt-PT-002A-12
FORMULA_NAME ShieldPPPt-PT-002A-13
FORMULA_NAME ShieldPPPt-PT-002A-14
FORMULA_NAME ShieldPPPt-PT-002A-15
=== Now, execution of the tool begins
BK_START 1621167352087
Running Version 0
[2021-05-16 12:16:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 12:16:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 12:16:08] [INFO ] Load time of PNML (sax parser for PT used): 2298 ms
[2021-05-16 12:16:08] [INFO ] Transformed 53 places.
[2021-05-16 12:16:08] [INFO ] Transformed 39 transitions.
[2021-05-16 12:16:08] [INFO ] Found NUPN structural information;
[2021-05-16 12:16:08] [INFO ] Parsed PT model containing 53 places and 39 transitions in 2353 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 12:16:08] [INFO ] Initial state test concluded for 1 properties.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Support contains 39 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 16 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:09] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-16 12:16:09] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:09] [INFO ] Computed 23 place invariants in 6 ms
[2021-05-16 12:16:09] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:09] [INFO ] Computed 23 place invariants in 10 ms
[2021-05-16 12:16:09] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 38/38 transitions.
[2021-05-16 12:16:09] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-16 12:16:09] [INFO ] Flatten gal took : 23 ms
FORMULA ShieldPPPt-PT-002A-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002A-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 12:16:09] [INFO ] Flatten gal took : 7 ms
[2021-05-16 12:16:09] [INFO ] Input system was already deterministic with 38 transitions.
Finished random walk after 227 steps, including 0 resets, run visited all 29 properties in 11 ms. (steps per millisecond=20 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(G((p0||(X(p1) U G(p0)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:09] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-16 12:16:09] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:09] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-16 12:16:09] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:09] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-16 12:16:09] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 376 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldPPPt-PT-002A-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}, { cond=p0, acceptance={} source=6 dest: 6}, { cond=p0, acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 7}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(AND (EQ s42 1) (EQ s44 1)), p1:(AND (EQ s38 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-002A-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-00 finished in 578 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 38/38 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 36
Applied a total of 2 rules in 19 ms. Remains 51 /53 variables (removed 2) and now considering 36/38 (removed 2) transitions.
// Phase 1: matrix 36 rows 51 cols
[2021-05-16 12:16:10] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-16 12:16:10] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 36 rows 51 cols
[2021-05-16 12:16:10] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-16 12:16:10] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2021-05-16 12:16:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 36 rows 51 cols
[2021-05-16 12:16:10] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-16 12:16:10] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/53 places, 36/38 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002A-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 281 ms.
Stack based approach found an accepted trace after 139 steps with 0 reset with depth 140 and stack size 140 in 1 ms.
FORMULA ShieldPPPt-PT-002A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-01 finished in 493 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&(X(p1)||F(p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:10] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-16 12:16:10] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:10] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-16 12:16:10] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:10] [INFO ] Computed 23 place invariants in 7 ms
[2021-05-16 12:16:10] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : ShieldPPPt-PT-002A-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(OR (NEQ s18 1) (NEQ s25 1)), p2:(NEQ s49 1), p1:(OR (NEQ s36 1) (NEQ s46 1) (NEQ s15 1) (NEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 7 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-002A-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-02 finished in 281 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 38/38 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 51 transition count 36
Applied a total of 4 rules in 5 ms. Remains 51 /53 variables (removed 2) and now considering 36/38 (removed 2) transitions.
// Phase 1: matrix 36 rows 51 cols
[2021-05-16 12:16:10] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-16 12:16:10] [INFO ] Implicit Places using invariants in 32 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
[2021-05-16 12:16:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 36 rows 50 cols
[2021-05-16 12:16:10] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-16 12:16:11] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 50/53 places, 36/38 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 50 transition count 34
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 48 transition count 34
Applied a total of 4 rules in 14 ms. Remains 48 /50 variables (removed 2) and now considering 34/36 (removed 2) transitions.
// Phase 1: matrix 34 rows 48 cols
[2021-05-16 12:16:11] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-16 12:16:11] [INFO ] Implicit Places using invariants in 39 ms returned [31, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 46/53 places, 34/38 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 33
Applied a total of 2 rules in 7 ms. Remains 45 /46 variables (removed 1) and now considering 33/34 (removed 1) transitions.
// Phase 1: matrix 33 rows 45 cols
[2021-05-16 12:16:11] [INFO ] Computed 20 place invariants in 16 ms
[2021-05-16 12:16:11] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 33 rows 45 cols
[2021-05-16 12:16:11] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-16 12:16:11] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 45/53 places, 33/38 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002A-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s20 1) (NEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 259 ms.
Stack based approach found an accepted trace after 60 steps with 0 reset with depth 61 and stack size 61 in 1 ms.
FORMULA ShieldPPPt-PT-002A-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-04 finished in 531 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0) U X(!p1))&&X(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:11] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-16 12:16:11] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:11] [INFO ] Computed 23 place invariants in 7 ms
[2021-05-16 12:16:11] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:11] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-16 12:16:11] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) p1), (NOT p0), p1, (AND (NOT p0) p1), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002A-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s42 1) (EQ s44 1)), p1:(OR (NEQ s18 1) (NEQ s25 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-05 finished in 267 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((X(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:11] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-16 12:16:11] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:11] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-16 12:16:11] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:11] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-16 12:16:11] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-002A-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}]], initial=0, aps=[p0:(AND (EQ s42 1) (EQ s44 1) (EQ s16 1) (EQ s27 1)), p1:(AND (EQ s4 1) (EQ s23 1)), p2:(AND (EQ s16 1) (EQ s27 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 1 reset in 0 ms.
FORMULA ShieldPPPt-PT-002A-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-06 finished in 235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0)) U G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:11] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-16 12:16:12] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:12] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-16 12:16:12] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:12] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-16 12:16:12] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 9254 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldPPPt-PT-002A-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s29 1) (EQ s48 1)), p0:(AND (EQ s28 1) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 21411 reset in 254 ms.
Stack based approach found an accepted trace after 16516 steps with 3512 reset with depth 7 and stack size 7 in 31 ms.
FORMULA ShieldPPPt-PT-002A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-07 finished in 9697 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0&&F(p1))) U p2))], workingDir=/home/mcc/execution]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 38/38 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 36
Applied a total of 4 rules in 5 ms. Remains 51 /53 variables (removed 2) and now considering 36/38 (removed 2) transitions.
// Phase 1: matrix 36 rows 51 cols
[2021-05-16 12:16:21] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-16 12:16:21] [INFO ] Implicit Places using invariants in 49 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
[2021-05-16 12:16:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 36 rows 50 cols
[2021-05-16 12:16:21] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-16 12:16:21] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 50/53 places, 36/38 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 50 transition count 34
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 48 transition count 34
Applied a total of 4 rules in 3 ms. Remains 48 /50 variables (removed 2) and now considering 34/36 (removed 2) transitions.
// Phase 1: matrix 34 rows 48 cols
[2021-05-16 12:16:21] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-16 12:16:21] [INFO ] Implicit Places using invariants in 30 ms returned [31, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 46/53 places, 34/38 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 44 transition count 32
Applied a total of 4 rules in 3 ms. Remains 44 /46 variables (removed 2) and now considering 32/34 (removed 2) transitions.
// Phase 1: matrix 32 rows 44 cols
[2021-05-16 12:16:21] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-16 12:16:21] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 32 rows 44 cols
[2021-05-16 12:16:21] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-16 12:16:21] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 44/53 places, 32/38 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p2), true, (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-002A-08 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s8 1) (EQ s25 1)), p0:(OR (EQ s15 0) (EQ s40 0)), p1:(OR (NEQ s15 1) (NEQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002A-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-08 finished in 324 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((((p0 U p1) U p2)&&X((X(p1)&&G(p3))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:21] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-16 12:16:22] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:22] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-16 12:16:22] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:22] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-16 12:16:22] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), true, (NOT p1), (NOT p2), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2) (AND p1 (NOT p3)) (AND (NOT p1) p3)), (AND (NOT p1) p3), (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-002A-10 automaton TGBA [mat=[[{ cond=(OR p2 p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=0 dest: 3}, { cond=(OR p2 p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 5}, { cond=p3, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 1}], [{ cond=(NOT p3), acceptance={} source=6 dest: 1}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s16 0) (EQ s27 0)), p1:(AND (EQ s32 1) (EQ s34 1)), p0:(OR (EQ s13 0) (EQ s27 0)), p3:(EQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-002A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-10 finished in 311 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 38/38 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 51 transition count 36
Applied a total of 4 rules in 3 ms. Remains 51 /53 variables (removed 2) and now considering 36/38 (removed 2) transitions.
// Phase 1: matrix 36 rows 51 cols
[2021-05-16 12:16:22] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-16 12:16:22] [INFO ] Implicit Places using invariants in 44 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
[2021-05-16 12:16:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 36 rows 50 cols
[2021-05-16 12:16:22] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-16 12:16:22] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 50/53 places, 36/38 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 50 transition count 34
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 48 transition count 34
Applied a total of 4 rules in 3 ms. Remains 48 /50 variables (removed 2) and now considering 34/36 (removed 2) transitions.
// Phase 1: matrix 34 rows 48 cols
[2021-05-16 12:16:22] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-16 12:16:22] [INFO ] Implicit Places using invariants in 33 ms returned [31, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 46/53 places, 34/38 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 44 transition count 32
Applied a total of 4 rules in 3 ms. Remains 44 /46 variables (removed 2) and now considering 32/34 (removed 2) transitions.
// Phase 1: matrix 32 rows 44 cols
[2021-05-16 12:16:22] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-16 12:16:22] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 32 rows 44 cols
[2021-05-16 12:16:22] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-16 12:16:22] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 44/53 places, 32/38 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002A-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s13 0) (EQ s27 0) (EQ s6 0) (EQ s21 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1167 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-002A-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-11 finished in 235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&(p1 U (p2||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 38/38 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 37
Applied a total of 2 rules in 3 ms. Remains 52 /53 variables (removed 1) and now considering 37/38 (removed 1) transitions.
// Phase 1: matrix 37 rows 52 cols
[2021-05-16 12:16:22] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-16 12:16:22] [INFO ] Implicit Places using invariants in 34 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
[2021-05-16 12:16:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 37 rows 51 cols
[2021-05-16 12:16:22] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-16 12:16:22] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 51/53 places, 37/38 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 51 transition count 35
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 49 transition count 35
Applied a total of 4 rules in 3 ms. Remains 49 /51 variables (removed 2) and now considering 35/37 (removed 2) transitions.
// Phase 1: matrix 35 rows 49 cols
[2021-05-16 12:16:22] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-16 12:16:22] [INFO ] Implicit Places using invariants in 31 ms returned [31, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 47/53 places, 35/38 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 45 transition count 33
Applied a total of 4 rules in 3 ms. Remains 45 /47 variables (removed 2) and now considering 33/35 (removed 2) transitions.
// Phase 1: matrix 33 rows 45 cols
[2021-05-16 12:16:22] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-16 12:16:22] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 33 rows 45 cols
[2021-05-16 12:16:22] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-16 12:16:22] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 45/53 places, 33/38 transitions.
Stuttering acceptance computed with spot in 34 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-002A-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s34 0), p2:(AND (OR (NEQ s11 1) (NEQ s21 1)) (OR (NEQ s5 1) (NEQ s22 1))), p1:(OR (NEQ s11 1) (NEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002A-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-12 finished in 218 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((p0||G(p1)))||X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:22] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-16 12:16:22] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:22] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-16 12:16:22] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:22] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-16 12:16:22] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-002A-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s26 1), p1:(AND (EQ s38 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5744 reset in 124 ms.
Stack based approach found an accepted trace after 69 steps with 6 reset with depth 10 and stack size 10 in 1 ms.
FORMULA ShieldPPPt-PT-002A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-13 finished in 337 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1) U (G(F(p2))||(X(p0)&&p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:23] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-16 12:16:23] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:23] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-16 12:16:23] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 38 rows 53 cols
[2021-05-16 12:16:23] [INFO ] Computed 23 place invariants in 10 ms
[2021-05-16 12:16:23] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 361 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p1) (NOT p0)), (AND (NOT p2) p3 (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-002A-14 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p2) p3 p1) (AND (NOT p2) p3 p0)), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)), acceptance={} source=0 dest: 5}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 8}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 9}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 10}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p3 p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p3 p1 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 11}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(OR (AND (NOT p2) p3 p1) (AND (NOT p2) p3 p0)), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}], [{ cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=10 dest: 1}, { cond=(NOT p0), acceptance={} source=10 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=11 dest: 1}]], initial=0, aps=[p3:(AND (EQ s1 1) (EQ s24 1) (EQ s17 1) (EQ s19 1)), p1:(AND (EQ s1 1) (EQ s24 1)), p0:(EQ s26 1), p2:(AND (EQ s17 1) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5106 reset in 138 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA ShieldPPPt-PT-002A-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-14 finished in 649 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 38/38 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 37
Applied a total of 2 rules in 3 ms. Remains 52 /53 variables (removed 1) and now considering 37/38 (removed 1) transitions.
// Phase 1: matrix 37 rows 52 cols
[2021-05-16 12:16:23] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-16 12:16:23] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 37 rows 52 cols
[2021-05-16 12:16:23] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-16 12:16:23] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2021-05-16 12:16:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 37 rows 52 cols
[2021-05-16 12:16:23] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-16 12:16:23] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/53 places, 37/38 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-002A-15 automaton TGBA [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=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s26 1)), p1:(OR (NEQ s36 1) (NEQ s45 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 165 ms.
Stack based approach found an accepted trace after 76 steps with 0 reset with depth 77 and stack size 77 in 0 ms.
FORMULA ShieldPPPt-PT-002A-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-15 finished in 363 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621167385036
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-002A"
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-002A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r216-tall-162098205500709"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-002A.tgz
mv ShieldPPPt-PT-002A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;