About the Execution of ITS-Tools for ShieldIIPt-PT-003A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 318.056 | 9583.00 | 17789.00 | 183.80 | FFFFFFTFFFFFTTFF | 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-162098205000373.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-003A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205000373
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K 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.2K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 12:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 12:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 25 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 17K May 5 16:52 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-003A-00
FORMULA_NAME ShieldIIPt-PT-003A-01
FORMULA_NAME ShieldIIPt-PT-003A-02
FORMULA_NAME ShieldIIPt-PT-003A-03
FORMULA_NAME ShieldIIPt-PT-003A-04
FORMULA_NAME ShieldIIPt-PT-003A-05
FORMULA_NAME ShieldIIPt-PT-003A-06
FORMULA_NAME ShieldIIPt-PT-003A-07
FORMULA_NAME ShieldIIPt-PT-003A-08
FORMULA_NAME ShieldIIPt-PT-003A-09
FORMULA_NAME ShieldIIPt-PT-003A-10
FORMULA_NAME ShieldIIPt-PT-003A-11
FORMULA_NAME ShieldIIPt-PT-003A-12
FORMULA_NAME ShieldIIPt-PT-003A-13
FORMULA_NAME ShieldIIPt-PT-003A-14
FORMULA_NAME ShieldIIPt-PT-003A-15
=== Now, execution of the tool begins
BK_START 1621095748817
Running Version 0
[2021-05-15 16:22:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-15 16:22:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 16:22:30] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2021-05-15 16:22:30] [INFO ] Transformed 60 places.
[2021-05-15 16:22:30] [INFO ] Transformed 45 transitions.
[2021-05-15 16:22:30] [INFO ] Found NUPN structural information;
[2021-05-15 16:22:30] [INFO ] Parsed PT model containing 60 places and 45 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 16:22:30] [INFO ] Initial state test concluded for 5 properties.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-003A-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003A-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 44/44 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:30] [INFO ] Computed 28 place invariants in 8 ms
[2021-05-15 16:22:30] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:30] [INFO ] Computed 28 place invariants in 6 ms
[2021-05-15 16:22:30] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:30] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-15 16:22:30] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 44/44 transitions.
[2021-05-15 16:22:30] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-15 16:22:30] [INFO ] Flatten gal took : 29 ms
FORMULA ShieldIIPt-PT-003A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 16:22:30] [INFO ] Flatten gal took : 11 ms
[2021-05-15 16:22:30] [INFO ] Input system was already deterministic with 44 transitions.
Finished random walk after 152 steps, including 0 resets, run visited all 24 properties in 6 ms. (steps per millisecond=25 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 44/44 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 59 transition count 42
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 57 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 55 transition count 40
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 8 place count 54 transition count 40
Applied a total of 8 rules in 20 ms. Remains 54 /60 variables (removed 6) and now considering 40/44 (removed 4) transitions.
// Phase 1: matrix 40 rows 54 cols
[2021-05-15 16:22:31] [INFO ] Computed 26 place invariants in 4 ms
[2021-05-15 16:22:31] [INFO ] Implicit Places using invariants in 42 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
[2021-05-15 16:22:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 53 cols
[2021-05-15 16:22:31] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-15 16:22:31] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 53/60 places, 40/44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 39
Applied a total of 2 rules in 8 ms. Remains 52 /53 variables (removed 1) and now considering 39/40 (removed 1) transitions.
// Phase 1: matrix 39 rows 52 cols
[2021-05-15 16:22:31] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-15 16:22:31] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 39 rows 52 cols
[2021-05-15 16:22:31] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-15 16:22:31] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 52/60 places, 39/44 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-003A-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s25 1) (NEQ s27 1)), p1:(NEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 299 ms.
Stack based approach found an accepted trace after 373 steps with 0 reset with depth 374 and stack size 342 in 2 ms.
FORMULA ShieldIIPt-PT-003A-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003A-00 finished in 749 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(((p2 U p3)&&p1))&&p0) U G(p4)))], workingDir=/home/mcc/execution]
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 44/44 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 60 transition count 43
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 59 transition count 43
Applied a total of 2 rules in 4 ms. Remains 59 /60 variables (removed 1) and now considering 43/44 (removed 1) transitions.
// Phase 1: matrix 43 rows 59 cols
[2021-05-15 16:22:31] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-15 16:22:31] [INFO ] Implicit Places using invariants in 32 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
[2021-05-15 16:22:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 43 rows 58 cols
[2021-05-15 16:22:31] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-15 16:22:31] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 58/60 places, 43/44 transitions.
Applied a total of 0 rules in 6 ms. Remains 58 /58 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2021-05-15 16:22:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 43 rows 58 cols
[2021-05-15 16:22:31] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-15 16:22:31] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 58/60 places, 43/44 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p4), true, (OR (NOT p3) (NOT p1)), (NOT p4), (NOT p3)]
Running random walk in product with property : ShieldIIPt-PT-003A-01 automaton TGBA [mat=[[{ cond=(AND (NOT p4) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p4 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p4) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p4) p0 (NOT p1)) (AND (NOT p4) p0 (NOT p3) (NOT p2))), acceptance={} source=0 dest: 2}, { cond=(AND p4 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p4) p0 p1 (NOT p3) p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p4), acceptance={} source=3 dest: 1}, { cond=p4, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p4:(AND (EQ s33 1) (EQ s48 1)), p0:(AND (EQ s14 0) (OR (EQ s33 0) (EQ s48 0))), p1:(AND (EQ s33 1) (EQ s48 1)), p3:(AND (EQ s44 1) (EQ s51 1)), p2:(AND (EQ s8 1) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 319 reset in 240 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA ShieldIIPt-PT-003A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003A-01 finished in 538 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:32] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-15 16:22:32] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:32] [INFO ] Computed 28 place invariants in 3 ms
[2021-05-15 16:22:32] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:32] [INFO ] Computed 28 place invariants in 9 ms
[2021-05-15 16:22:32] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 44/44 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003A-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s46 1) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-003A-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003A-02 finished in 201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U (p1||G(p0))) U (((p0 U (p2||G(p0)))&&(p3 U ((p3&&G(p4))||G(p3))))||G(p5)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:32] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-15 16:22:32] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:32] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-15 16:22:32] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:32] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-15 16:22:32] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 44/44 transitions.
Stuttering acceptance computed with spot in 826 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p5)) (AND (NOT p3) (NOT p5))), (OR (AND (NOT p0) (NOT p2) (NOT p5)) (AND (NOT p3) (NOT p5))), true, (NOT p5), (AND (NOT p0) (NOT p1)), (NOT p3), (AND (NOT p3) (NOT p4) (NOT p5)), (AND (NOT p0) (NOT p2) (NOT p5)), (AND (NOT p3) (NOT p5)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4) p5), (AND p5 (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p5) (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) p5), (AND (NOT p3) (NOT p5)), (AND (NOT p5) (NOT p0) (NOT p1)), (NOT p4), (OR (AND (NOT p0) (NOT p2) (NOT p4) (NOT p5)) (AND (NOT p3) (NOT p4) (NOT p5))), (AND (NOT p5) (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p5) (NOT p4)), (AND (NOT p0) (NOT p2) (NOT p4) (NOT p5)), (AND p5 (NOT p2) (NOT p0) (NOT p1) (NOT p4))]
Running random walk in product with property : ShieldIIPt-PT-003A-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p5) (NOT p2) (NOT p0) p1) (AND (NOT p5) p0 (NOT p3)) (AND (NOT p5) (NOT p3) p1)), acceptance={0, 1, 2, 3} source=1 dest: 1}, { cond=(OR (AND p5 (NOT p2) (NOT p0) p1) (AND p5 p0 (NOT p3)) (AND p5 (NOT p3) p1)), acceptance={1, 2, 3} source=1 dest: 1}, { cond=(OR (AND (NOT p5) (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p5) (NOT p0) (NOT p3) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p5 (NOT p2) (NOT p0) (NOT p1)) (AND p5 (NOT p0) (NOT p3) (NOT p1))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p5) p0 (NOT p3) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p5) p2 (NOT p0) (NOT p4) p3 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p5) p2 p4 p3 p1) (AND (NOT p5) p0 p4 p3)), acceptance={0, 1} source=1 dest: 6}, { cond=(OR (AND p5 p2 p4 p3 p1) (AND p5 p0 p4 p3)), acceptance={1} source=1 dest: 6}, { cond=(AND (NOT p5) (NOT p2) p0 p3), acceptance={0, 2, 3} source=1 dest: 7}, { cond=(AND p5 (NOT p2) p0 p3), acceptance={2, 3} source=1 dest: 7}, { cond=(OR (AND (NOT p5) p2 (NOT p4) p3 p1) (AND (NOT p5) p0 (NOT p4) p3)), acceptance={0, 1, 2} source=1 dest: 8}, { cond=(OR (AND p5 p2 (NOT p4) p3 p1) (AND p5 p0 (NOT p4) p3)), acceptance={1, 2} source=1 dest: 8}, { cond=(AND (NOT p5) p0 p4 p3 (NOT p1)), acceptance={} source=1 dest: 9}, { cond=(AND (NOT p5) (NOT p2) p0 p3 (NOT p1)), acceptance={} source=1 dest: 10}, { cond=(AND p5 p2 (NOT p0) p4 p3 (NOT p1)), acceptance={} source=1 dest: 11}, { cond=(AND (NOT p5) p2 (NOT p0) p4 p3 (NOT p1)), acceptance={} source=1 dest: 12}, { cond=(AND (NOT p5) p0 (NOT p4) p3 (NOT p1)), acceptance={} source=1 dest: 13}, { cond=(AND p5 p2 (NOT p0) (NOT p4) p3 (NOT p1)), acceptance={} source=1 dest: 14}, { cond=(AND p5 p0 (NOT p3) (NOT p1)), acceptance={} source=1 dest: 15}], [{ cond=true, acceptance={0, 1, 2, 3} source=2 dest: 2}], [{ cond=(NOT p5), acceptance={} source=3 dest: 2}, { cond=p5, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={} source=5 dest: 5}, { cond=(AND p4 p3), acceptance={} source=5 dest: 12}], [{ cond=(OR (AND (NOT p5) p0 (NOT p4) (NOT p3)) (AND (NOT p5) (NOT p4) (NOT p3) p1)), acceptance={0, 1, 2, 3} source=6 dest: 1}, { cond=(OR (AND p5 p0 (NOT p4) (NOT p3)) (AND p5 (NOT p4) (NOT p3) p1)), acceptance={1, 2, 3} source=6 dest: 1}, { cond=(AND (NOT p5) (NOT p0) (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p5 (NOT p0) (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p5) p0 (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p5) (NOT p0) (NOT p4) p3 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p5) p0 p4 p3) (AND (NOT p5) p4 p3 p1)), acceptance={0, 1} source=6 dest: 6}, { cond=(OR (AND p5 p0 p4 p3) (AND p5 p4 p3 p1)), acceptance={1} source=6 dest: 6}, { cond=(OR (AND (NOT p5) p0 (NOT p4) p3) (AND (NOT p5) (NOT p4) p3 p1)), acceptance={0, 1, 2} source=6 dest: 8}, { cond=(OR (AND p5 p0 (NOT p4) p3) (AND p5 (NOT p4) p3 p1)), acceptance={1, 2} source=6 dest: 8}, { cond=(AND (NOT p5) p0 p4 p3 (NOT p1)), acceptance={} source=6 dest: 9}, { cond=(AND p5 (NOT p0) p4 p3 (NOT p1)), acceptance={} source=6 dest: 11}, { cond=(AND (NOT p5) (NOT p0) p4 p3 (NOT p1)), acceptance={} source=6 dest: 12}, { cond=(AND (NOT p5) p0 (NOT p4) p3 (NOT p1)), acceptance={} source=6 dest: 13}, { cond=(AND p5 (NOT p0) (NOT p4) p3 (NOT p1)), acceptance={} source=6 dest: 14}, { cond=(AND p5 p0 (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=6 dest: 15}, { cond=(AND (NOT p5) (NOT p0) p4 (NOT p3) (NOT p1)), acceptance={} source=6 dest: 16}, { cond=(OR (AND (NOT p5) p0 p4 (NOT p3)) (AND (NOT p5) p4 (NOT p3) p1)), acceptance={0, 1, 3} source=6 dest: 17}, { cond=(OR (AND p5 p0 p4 (NOT p3)) (AND p5 p4 (NOT p3) p1)), acceptance={1, 3} source=6 dest: 17}, { cond=(AND p5 p0 p4 (NOT p3) (NOT p1)), acceptance={} source=6 dest: 18}, { cond=(AND (NOT p5) p0 p4 (NOT p3) (NOT p1)), acceptance={} source=6 dest: 19}, { cond=(AND p5 (NOT p0) p4 (NOT p3) (NOT p1)), acceptance={} source=6 dest: 20}], [{ cond=(AND (NOT p5) (NOT p2) (NOT p0) p1), acceptance={0, 1, 2, 3} source=7 dest: 1}, { cond=(AND p5 (NOT p2) (NOT p0) p1), acceptance={1, 2, 3} source=7 dest: 1}, { cond=(AND (NOT p5) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND p5 (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p5) (NOT p2) p0), acceptance={0, 2, 3} source=7 dest: 7}, { cond=(AND p5 (NOT p2) p0), acceptance={2, 3} source=7 dest: 7}, { cond=(AND (NOT p5) (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 10}], [{ cond=(OR (AND (NOT p5) p0 (NOT p3)) (AND (NOT p5) (NOT p3) p1)), acceptance={0, 1, 2, 3} source=8 dest: 1}, { cond=(OR (AND p5 p0 (NOT p3)) (AND p5 (NOT p3) p1)), acceptance={1, 2, 3} source=8 dest: 1}, { cond=(AND (NOT p5) (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND p5 (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p5) p0 (NOT p3) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p5) (NOT p0) (NOT p4) p3 (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(OR (AND (NOT p5) p0 p4 p3) (AND (NOT p5) p4 p3 p1)), acceptance={0, 1} source=8 dest: 6}, { cond=(OR (AND p5 p0 p4 p3) (AND p5 p4 p3 p1)), acceptance={1} source=8 dest: 6}, { cond=(OR (AND (NOT p5) p0 (NOT p4) p3) (AND (NOT p5) (NOT p4) p3 p1)), acceptance={0, 1, 2} source=8 dest: 8}, { cond=(OR (AND p5 p0 (NOT p4) p3) (AND p5 (NOT p4) p3 p1)), acceptance={1, 2} source=8 dest: 8}, { cond=(AND (NOT p5) p0 p4 p3 (NOT p1)), acceptance={} source=8 dest: 9}, { cond=(AND p5 (NOT p0) p4 p3 (NOT p1)), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p5) (NOT p0) p4 p3 (NOT p1)), acceptance={} source=8 dest: 12}, { cond=(AND (NOT p5) p0 (NOT p4) p3 (NOT p1)), acceptance={} source=8 dest: 13}, { cond=(AND p5 (NOT p0) (NOT p4) p3 (NOT p1)), acceptance={} source=8 dest: 14}, { cond=(AND p5 p0 (NOT p3) (NOT p1)), acceptance={} source=8 dest: 15}], [{ cond=(AND p5 (NOT p0) (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=9 dest: 2}, { cond=(AND p5 p0 (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=9 dest: 4}, { cond=(AND p5 (NOT p0) (NOT p4) p3 (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND p5 p0 p4 p3 (NOT p1)), acceptance={} source=9 dest: 9}, { cond=(AND p5 (NOT p0) p4 p3 (NOT p1)), acceptance={} source=9 dest: 12}, { cond=(AND p5 p0 (NOT p4) p3 (NOT p1)), acceptance={} source=9 dest: 13}, { cond=(AND p5 (NOT p0) p4 (NOT p3) (NOT p1)), acceptance={} source=9 dest: 16}, { cond=(AND p5 p0 p4 (NOT p3) (NOT p1)), acceptance={} source=9 dest: 19}], [{ cond=(AND p5 (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 2}, { cond=(AND p5 (NOT p2) p0 (NOT p1)), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p5) (NOT p4) (NOT p3)), acceptance={} source=11 dest: 2}, { cond=(AND p5 (NOT p4) (NOT p3)), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p5) (NOT p4) p3), acceptance={} source=11 dest: 5}, { cond=(AND p5 p4 p3), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p5) p4 p3), acceptance={} source=11 dest: 12}, { cond=(AND p5 (NOT p4) p3), acceptance={} source=11 dest: 14}, { cond=(AND (NOT p5) p4 (NOT p3)), acceptance={} source=11 dest: 16}, { cond=(AND p5 p4 (NOT p3)), acceptance={} source=11 dest: 20}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=12 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={} source=12 dest: 5}, { cond=(AND p4 p3), acceptance={} source=12 dest: 12}, { cond=(AND p4 (NOT p3)), acceptance={} source=12 dest: 16}], [{ cond=(AND p5 (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=13 dest: 2}, { cond=(AND p5 p0 (NOT p3) (NOT p1)), acceptance={} source=13 dest: 4}, { cond=(AND p5 (NOT p0) (NOT p4) p3 (NOT p1)), acceptance={} source=13 dest: 5}, { cond=(AND p5 p0 p4 p3 (NOT p1)), acceptance={} source=13 dest: 9}, { cond=(AND p5 (NOT p0) p4 p3 (NOT p1)), acceptance={} source=13 dest: 12}, { cond=(AND p5 p0 (NOT p4) p3 (NOT p1)), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p5) (NOT p3)), acceptance={} source=14 dest: 2}, { cond=(AND p5 (NOT p3)), acceptance={} source=14 dest: 3}, { cond=(AND (NOT p5) (NOT p4) p3), acceptance={} source=14 dest: 5}, { cond=(AND p5 p4 p3), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p5) p4 p3), acceptance={} source=14 dest: 12}, { cond=(AND p5 (NOT p4) p3), acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p5) (NOT p0) (NOT p1)), acceptance={} source=15 dest: 2}, { cond=(AND p5 (NOT p0) (NOT p1)), acceptance={} source=15 dest: 3}, { cond=(AND (NOT p5) p0 (NOT p1)), acceptance={} source=15 dest: 4}, { cond=(AND p5 p0 (NOT p1)), acceptance={} source=15 dest: 15}], [{ cond=(NOT p4), acceptance={} source=16 dest: 2}, { cond=p4, acceptance={} source=16 dest: 16}], [{ cond=(OR (AND (NOT p5) (NOT p2) (NOT p0) (NOT p4) p1) (AND (NOT p5) p0 (NOT p4) (NOT p3)) (AND (NOT p5) (NOT p4) (NOT p3) p1)), acceptance={0, 1, 2, 3} source=17 dest: 1}, { cond=(OR (AND p5 (NOT p2) (NOT p0) (NOT p4) p1) (AND p5 p0 (NOT p4) (NOT p3)) (AND p5 (NOT p4) (NOT p3) p1)), acceptance={1, 2, 3} source=17 dest: 1}, { cond=(OR (AND (NOT p5) (NOT p2) (NOT p0) (NOT p4) (NOT p1)) (AND (NOT p5) (NOT p0) (NOT p4) (NOT p3) (NOT p1))), acceptance={} source=17 dest: 2}, { cond=(OR (AND p5 (NOT p2) (NOT p0) (NOT p4) (NOT p1)) (AND p5 (NOT p0) (NOT p4) (NOT p3) (NOT p1))), acceptance={} source=17 dest: 3}, { cond=(AND (NOT p5) p0 (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=17 dest: 4}, { cond=(AND (NOT p5) p2 (NOT p0) (NOT p4) p3 (NOT p1)), acceptance={} source=17 dest: 5}, { cond=(OR (AND (NOT p5) p2 p4 p3 p1) (AND (NOT p5) p0 p4 p3)), acceptance={0, 1} source=17 dest: 6}, { cond=(OR (AND p5 p2 p4 p3 p1) (AND p5 p0 p4 p3)), acceptance={1} source=17 dest: 6}, { cond=(AND (NOT p5) (NOT p2) p0 (NOT p4) p3), acceptance={0, 2, 3} source=17 dest: 7}, { cond=(AND p5 (NOT p2) p0 (NOT p4) p3), acceptance={2, 3} source=17 dest: 7}, { cond=(OR (AND (NOT p5) p2 (NOT p4) p3 p1) (AND (NOT p5) p0 (NOT p4) p3)), acceptance={0, 1, 2} source=17 dest: 8}, { cond=(OR (AND p5 p2 (NOT p4) p3 p1) (AND p5 p0 (NOT p4) p3)), acceptance={1, 2} source=17 dest: 8}, { cond=(AND (NOT p5) p0 p4 p3 (NOT p1)), acceptance={} source=17 dest: 9}, { cond=(AND (NOT p5) (NOT p2) p0 (NOT p4) p3 (NOT p1)), acceptance={} source=17 dest: 10}, { cond=(AND p5 p2 (NOT p0) p4 p3 (NOT p1)), acceptance={} source=17 dest: 11}, { cond=(AND (NOT p5) p2 (NOT p0) p4 p3 (NOT p1)), acceptance={} source=17 dest: 12}, { cond=(AND (NOT p5) p0 (NOT p4) p3 (NOT p1)), acceptance={} source=17 dest: 13}, { cond=(AND p5 p2 (NOT p0) (NOT p4) p3 (NOT p1)), acceptance={} source=17 dest: 14}, { cond=(AND p5 p0 (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=17 dest: 15}, { cond=(OR (AND (NOT p5) (NOT p2) (NOT p0) p4 (NOT p1)) (AND (NOT p5) (NOT p0) p4 (NOT p3) (NOT p1))), acceptance={} source=17 dest: 16}, { cond=(OR (AND (NOT p5) (NOT p2) (NOT p0) p4 p1) (AND (NOT p5) p0 p4 (NOT p3)) (AND (NOT p5) p4 (NOT p3) p1)), acceptance={0, 1, 3} source=17 dest: 17}, { cond=(OR (AND p5 (NOT p2) (NOT p0) p4 p1) (AND p5 p0 p4 (NOT p3)) (AND p5 p4 (NOT p3) p1)), acceptance={1, 3} source=17 dest: 17}, { cond=(AND p5 p0 p4 (NOT p3) (NOT p1)), acceptance={} source=17 dest: 18}, { cond=(AND (NOT p5) p0 p4 (NOT p3) (NOT p1)), acceptance={} source=17 dest: 19}, { cond=(OR (AND p5 (NOT p2) (NOT p0) p4 (NOT p1)) (AND p5 (NOT p0) p4 (NOT p3) (NOT p1))), acceptance={} source=17 dest: 20}, { cond=(AND (NOT p5) (NOT p2) p0 p4 p3), acceptance={0, 3} source=17 dest: 21}, { cond=(AND p5 (NOT p2) p0 p4 p3), acceptance={3} source=17 dest: 21}, { cond=(AND (NOT p5) (NOT p2) p0 p4 p3 (NOT p1)), acceptance={} source=17 dest: 22}], [{ cond=(AND (NOT p5) (NOT p0) (NOT p4) (NOT p1)), acceptance={} source=18 dest: 2}, { cond=(AND p5 (NOT p0) (NOT p4) (NOT p1)), acceptance={} source=18 dest: 3}, { cond=(AND (NOT p5) p0 (NOT p4) (NOT p1)), acceptance={} source=18 dest: 4}, { cond=(AND p5 p0 (NOT p4) (NOT p1)), acceptance={} source=18 dest: 15}, { cond=(AND (NOT p5) (NOT p0) p4 (NOT p1)), acceptance={} source=18 dest: 16}, { cond=(AND p5 p0 p4 (NOT p1)), acceptance={} source=18 dest: 18}, { cond=(AND (NOT p5) p0 p4 (NOT p1)), acceptance={} source=18 dest: 19}, { cond=(AND p5 (NOT p0) p4 (NOT p1)), acceptance={} source=18 dest: 20}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p1)), acceptance={} source=19 dest: 2}, { cond=(AND p0 (NOT p4) (NOT p1)), acceptance={} source=19 dest: 4}, { cond=(AND (NOT p0) p4 (NOT p1)), acceptance={} source=19 dest: 16}, { cond=(AND p0 p4 (NOT p1)), acceptance={} source=19 dest: 19}], [{ cond=(AND (NOT p5) (NOT p4)), acceptance={} source=20 dest: 2}, { cond=(AND p5 (NOT p4)), acceptance={} source=20 dest: 3}, { cond=(AND (NOT p5) p4), acceptance={} source=20 dest: 16}, { cond=(AND p5 p4), acceptance={} source=20 dest: 20}], [{ cond=(AND (NOT p5) (NOT p2) (NOT p0) (NOT p4) p1), acceptance={0, 1, 2, 3} source=21 dest: 1}, { cond=(AND p5 (NOT p2) (NOT p0) (NOT p4) p1), acceptance={1, 2, 3} source=21 dest: 1}, { cond=(AND (NOT p5) (NOT p2) (NOT p0) (NOT p4) (NOT p1)), acceptance={} source=21 dest: 2}, { cond=(AND p5 (NOT p2) (NOT p0) (NOT p4) (NOT p1)), acceptance={} source=21 dest: 3}, { cond=(AND (NOT p5) (NOT p2) p0 (NOT p4)), acceptance={0, 2, 3} source=21 dest: 7}, { cond=(AND p5 (NOT p2) p0 (NOT p4)), acceptance={2, 3} source=21 dest: 7}, { cond=(AND (NOT p5) (NOT p2) p0 (NOT p4) (NOT p1)), acceptance={} source=21 dest: 10}, { cond=(AND (NOT p5) (NOT p2) (NOT p0) p4 (NOT p1)), acceptance={} source=21 dest: 16}, { cond=(AND (NOT p5) (NOT p2) (NOT p0) p4 p1), acceptance={0, 1, 3} source=21 dest: 17}, { cond=(AND p5 (NOT p2) (NOT p0) p4 p1), acceptance={1, 3} source=21 dest: 17}, { cond=(AND p5 (NOT p2) (NOT p0) p4 (NOT p1)), acceptance={} source=21 dest: 20}, { cond=(AND (NOT p5) (NOT p2) p0 p4), acceptance={0, 3} source=21 dest: 21}, { cond=(AND p5 (NOT p2) p0 p4), acceptance={3} source=21 dest: 21}, { cond=(AND (NOT p5) (NOT p2) p0 p4 (NOT p1)), acceptance={} source=21 dest: 22}], [{ cond=(AND p5 (NOT p2) (NOT p0) (NOT p4) (NOT p1)), acceptance={} source=22 dest: 2}, { cond=(AND p5 (NOT p2) p0 (NOT p4) (NOT p1)), acceptance={} source=22 dest: 10}, { cond=(AND p5 (NOT p2) (NOT p0) p4 (NOT p1)), acceptance={} source=22 dest: 16}, { cond=(AND p5 (NOT p2) p0 p4 (NOT p1)), acceptance={} source=22 dest: 22}]], initial=0, aps=[p5:(OR (NEQ s56 1) (AND (NEQ s52 1) (OR (NEQ s1 1) (NEQ s18 1)) (NEQ s56 1))), p2:(AND (NEQ s52 1) (OR (NEQ s1 1) (NEQ s18 1)) (NEQ s56 1)), p0:(NEQ s56 1), p1:(AND (NEQ s52 1) (NEQ s56 1) (OR (NEQ s1 1) (NEQ s18 1))), p3:(NEQ s18 1), p4:(EQ s52 1)], nbAcceptance=4, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-003A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003A-03 finished in 1038 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(X(((p1 U p2) U G(p2))))&&p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:33] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-15 16:22:33] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:33] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-15 16:22:33] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:33] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-15 16:22:33] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 44/44 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-003A-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s20 1)), p2:(EQ s14 1), p1:(AND (EQ s3 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-003A-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003A-04 finished in 227 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(((p0 U X(G(p1))) U p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:33] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-15 16:22:33] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:33] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-15 16:22:33] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:33] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-15 16:22:33] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 44/44 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : ShieldIIPt-PT-003A-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s39 1), p0:(EQ s52 0), p1:(OR (NEQ s4 1) (NEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 131 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-003A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003A-07 finished in 293 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((p0 U G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 44/44 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:34] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-15 16:22:34] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:34] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-15 16:22:34] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:34] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-15 16:22:34] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 44/44 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-003A-08 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=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s0 1), p0:(EQ s39 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-003A-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003A-08 finished in 259 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:34] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-15 16:22:34] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:34] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-15 16:22:34] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:34] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-15 16:22:34] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 44/44 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0, p0]
Running random walk in product with property : ShieldIIPt-PT-003A-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s4 1) (NEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1611 reset in 169 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA ShieldIIPt-PT-003A-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003A-09 finished in 332 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F((p1&&(G(p1)||p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 44/44 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 60 transition count 43
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 59 transition count 43
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 4 place count 58 transition count 42
Applied a total of 4 rules in 8 ms. Remains 58 /60 variables (removed 2) and now considering 42/44 (removed 2) transitions.
// Phase 1: matrix 42 rows 58 cols
[2021-05-15 16:22:34] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-15 16:22:34] [INFO ] Implicit Places using invariants in 32 ms returned [50, 51]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
[2021-05-15 16:22:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 56 cols
[2021-05-15 16:22:34] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-15 16:22:34] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 56/60 places, 42/44 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 56 transition count 41
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 55 transition count 41
Applied a total of 2 rules in 5 ms. Remains 55 /56 variables (removed 1) and now considering 41/42 (removed 1) transitions.
// Phase 1: matrix 41 rows 55 cols
[2021-05-15 16:22:34] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-15 16:22:34] [INFO ] Implicit Places using invariants in 28 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 54/60 places, 41/44 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 53 transition count 40
Applied a total of 2 rules in 5 ms. Remains 53 /54 variables (removed 1) and now considering 40/41 (removed 1) transitions.
// Phase 1: matrix 40 rows 53 cols
[2021-05-15 16:22:34] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-15 16:22:34] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 40 rows 53 cols
[2021-05-15 16:22:34] [INFO ] Computed 25 place invariants in 7 ms
[2021-05-15 16:22:34] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 53/60 places, 40/44 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-003A-10 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}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s4 1) (NEQ s17 1)), p1:(OR (NEQ s42 1) (NEQ s48 1)), p2:(OR (NEQ s4 1) (NEQ s17 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 172 ms.
Stack based approach found an accepted trace after 99 steps with 6 reset with depth 18 and stack size 16 in 0 ms.
FORMULA ShieldIIPt-PT-003A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003A-10 finished in 465 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(!p1)||F(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 44/44 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 60 transition count 43
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 59 transition count 43
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 4 place count 58 transition count 42
Applied a total of 4 rules in 6 ms. Remains 58 /60 variables (removed 2) and now considering 42/44 (removed 2) transitions.
// Phase 1: matrix 42 rows 58 cols
[2021-05-15 16:22:35] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-15 16:22:35] [INFO ] Implicit Places using invariants in 31 ms returned [50, 51]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
[2021-05-15 16:22:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 56 cols
[2021-05-15 16:22:35] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-15 16:22:35] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 56/60 places, 42/44 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 56 transition count 41
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 55 transition count 41
Applied a total of 2 rules in 5 ms. Remains 55 /56 variables (removed 1) and now considering 41/42 (removed 1) transitions.
// Phase 1: matrix 41 rows 55 cols
[2021-05-15 16:22:35] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-15 16:22:35] [INFO ] Implicit Places using invariants in 31 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 54/60 places, 41/44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 40
Applied a total of 2 rules in 4 ms. Remains 53 /54 variables (removed 1) and now considering 40/41 (removed 1) transitions.
// Phase 1: matrix 40 rows 53 cols
[2021-05-15 16:22:35] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-15 16:22:35] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 40 rows 53 cols
[2021-05-15 16:22:35] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-15 16:22:35] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 53/60 places, 40/44 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : ShieldIIPt-PT-003A-13 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s14 1), p2:(OR (AND (EQ s6 1) (EQ s15 1)) (EQ s18 1)), p0:(AND (EQ s6 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3309 reset in 164 ms.
Product exploration explored 100000 steps with 3267 reset in 200 ms.
Knowledge obtained : [(NOT p1), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 3398 reset in 175 ms.
Product exploration explored 100000 steps with 3320 reset in 211 ms.
[2021-05-15 16:22:36] [INFO ] Flatten gal took : 12 ms
[2021-05-15 16:22:36] [INFO ] Flatten gal took : 5 ms
[2021-05-15 16:22:36] [INFO ] Time to serialize gal into /tmp/LTL4858989627562048021.gal : 1 ms
[2021-05-15 16:22:36] [INFO ] Time to serialize properties into /tmp/LTL10229319700405837748.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4858989627562048021.gal, -t, CGAL, -LTL, /tmp/LTL10229319700405837748.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4858989627562048021.gal -t CGAL -LTL /tmp/LTL10229319700405837748.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("((p6==1)&&(p15==1))")U((G("(p14==0)"))||(F("(((p6==1)&&(p15==1))||(p18==1))")))))
Formula 0 simplified : !("((p6==1)&&(p15==1))" U (G"(p14==0)" | F"(((p6==1)&&(p15==1))||(p18==1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
22 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.239482,24444,1,0,127,37468,36,62,1327,60321,330
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-003A-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-003A-13 finished in 1539 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 44/44 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:36] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-15 16:22:36] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:36] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-15 16:22:36] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 44 rows 60 cols
[2021-05-15 16:22:36] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-15 16:22:36] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 44/44 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldIIPt-PT-003A-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s52 0), p1:(AND (EQ s13 1) (EQ s19 1) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 1 reset in 0 ms.
FORMULA ShieldIIPt-PT-003A-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003A-14 finished in 234 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 44/44 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 59 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 57 transition count 42
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 55 transition count 40
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 8 place count 54 transition count 40
Applied a total of 8 rules in 6 ms. Remains 54 /60 variables (removed 6) and now considering 40/44 (removed 4) transitions.
// Phase 1: matrix 40 rows 54 cols
[2021-05-15 16:22:36] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-15 16:22:36] [INFO ] Implicit Places using invariants in 28 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
[2021-05-15 16:22:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 53 cols
[2021-05-15 16:22:36] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-15 16:22:36] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 53/60 places, 40/44 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 39
Applied a total of 2 rules in 4 ms. Remains 52 /53 variables (removed 1) and now considering 39/40 (removed 1) transitions.
// Phase 1: matrix 39 rows 52 cols
[2021-05-15 16:22:36] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-15 16:22:36] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 39 rows 52 cols
[2021-05-15 16:22:36] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-15 16:22:37] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 52/60 places, 39/44 transitions.
Stuttering acceptance computed with spot in 44 ms :[p0, p0]
Running random walk in product with property : ShieldIIPt-PT-003A-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s38 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 5315 reset in 234 ms.
Stack based approach found an accepted trace after 417 steps with 19 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ShieldIIPt-PT-003A-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003A-15 finished in 452 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621095758400
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-003A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-003A, 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-162098205000373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-003A.tgz
mv ShieldIIPt-PT-003A 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 ;