About the Execution of ITS-Tools for ShieldIIPt-PT-005A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 474.743 | 15490.00 | 27350.00 | 278.00 | FFTFFFFFTFFFTFFF | 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-162098205000405.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-005A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205000405
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.1K 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 1.9K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 12:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:53 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 27K 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-005A-00
FORMULA_NAME ShieldIIPt-PT-005A-01
FORMULA_NAME ShieldIIPt-PT-005A-02
FORMULA_NAME ShieldIIPt-PT-005A-03
FORMULA_NAME ShieldIIPt-PT-005A-04
FORMULA_NAME ShieldIIPt-PT-005A-05
FORMULA_NAME ShieldIIPt-PT-005A-06
FORMULA_NAME ShieldIIPt-PT-005A-07
FORMULA_NAME ShieldIIPt-PT-005A-08
FORMULA_NAME ShieldIIPt-PT-005A-09
FORMULA_NAME ShieldIIPt-PT-005A-10
FORMULA_NAME ShieldIIPt-PT-005A-11
FORMULA_NAME ShieldIIPt-PT-005A-12
FORMULA_NAME ShieldIIPt-PT-005A-13
FORMULA_NAME ShieldIIPt-PT-005A-14
FORMULA_NAME ShieldIIPt-PT-005A-15
=== Now, execution of the tool begins
BK_START 1621098432050
Running Version 0
[2021-05-15 17:07:14] [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 17:07:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 17:07:14] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-15 17:07:14] [INFO ] Transformed 98 places.
[2021-05-15 17:07:14] [INFO ] Transformed 73 transitions.
[2021-05-15 17:07:14] [INFO ] Found NUPN structural information;
[2021-05-15 17:07:14] [INFO ] Parsed PT model containing 98 places and 73 transitions in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 17:07:14] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-005A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 11 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:14] [INFO ] Computed 46 place invariants in 8 ms
[2021-05-15 17:07:14] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:14] [INFO ] Computed 46 place invariants in 6 ms
[2021-05-15 17:07:14] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:14] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-15 17:07:14] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 72/72 transitions.
[2021-05-15 17:07:14] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-15 17:07:14] [INFO ] Flatten gal took : 34 ms
FORMULA ShieldIIPt-PT-005A-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 17:07:14] [INFO ] Flatten gal took : 13 ms
[2021-05-15 17:07:14] [INFO ] Input system was already deterministic with 72 transitions.
Finished random walk after 1300 steps, including 0 resets, run visited all 32 properties in 15 ms. (steps per millisecond=86 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||(X(X(X(p1))) U G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:14] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-15 17:07:15] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:15] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-15 17:07:15] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:15] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-15 17:07:15] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-005A-00 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s38 1)), p2:(AND (EQ s51 1) (EQ s57 1) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null][false]]
Product exploration explored 100000 steps with 412 reset in 337 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 1 ms.
FORMULA ShieldIIPt-PT-005A-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005A-00 finished in 742 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1&&X(X(X(G((F(p1)&&p2))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:15] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 17:07:15] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:15] [INFO ] Computed 46 place invariants in 6 ms
[2021-05-15 17:07:15] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:15] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 17:07:15] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 530 ms :[(OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-005A-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 p0), acceptance={0} source=7 dest: 10}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 11}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=8 dest: 14}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 15}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 16}], [{ cond=true, acceptance={} source=9 dest: 13}], [{ cond=(AND (NOT p1) p2), acceptance={} source=10 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=10 dest: 10}, { cond=(AND p1 p0 p2), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=10 dest: 11}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=10 dest: 11}, { cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=11 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=11 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=11 dest: 14}, { cond=(AND p1 p0 p2), acceptance={} source=11 dest: 14}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=11 dest: 15}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=11 dest: 15}, { cond=(AND p1 (NOT p0)), acceptance={} source=11 dest: 16}], [{ cond=(AND (NOT p1) p2), acceptance={} source=12 dest: 6}, { cond=true, acceptance={} source=12 dest: 13}], [{ cond=true, acceptance={} source=13 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=14 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=14 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=14 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=14 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=14 dest: 9}, { cond=(AND p1 p0 p2), acceptance={} source=14 dest: 10}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=14 dest: 11}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=14 dest: 12}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=14 dest: 13}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=15 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=15 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=15 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=15 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=15 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=15 dest: 6}, { cond=(AND p1 p0 p2), acceptance={} source=15 dest: 14}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=15 dest: 15}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=15 dest: 16}], [{ cond=(NOT p2), acceptance={} source=16 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=16 dest: 6}, { cond=p2, acceptance={} source=16 dest: 13}]], initial=0, aps=[p1:(EQ s0 1), p0:(OR (EQ s54 1) (EQ s0 1)), p2:(AND (EQ s84 1) (EQ s95 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, null, null, null, null, null][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 3 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-005A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005A-01 finished in 758 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((F(p0)&&F(G(p1)))) U p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:16] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 17:07:16] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:16] [INFO ] Computed 46 place invariants in 5 ms
[2021-05-15 17:07:16] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:16] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 17:07:16] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-005A-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s92 1), p0:(OR (EQ s27 0) (EQ s38 0)), p1:(OR (EQ s14 1) (AND (EQ s43 1) (EQ s54 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 282 ms.
Stack based approach found an accepted trace after 366 steps with 0 reset with depth 367 and stack size 367 in 1 ms.
FORMULA ShieldIIPt-PT-005A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005A-03 finished in 623 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))&&(p0||X((G(p1) U (G(p1)&&p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:17] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-15 17:07:17] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:17] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 17:07:17] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:17] [INFO ] Computed 46 place invariants in 8 ms
[2021-05-15 17:07:17] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p2) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-005A-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}, { cond=(AND p2 p1), acceptance={0} 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=[p0:(AND (EQ s52 1) (EQ s67 1)), p2:(AND (EQ s52 1) (EQ s67 1)), p1:(AND (EQ s79 1) (EQ s96 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-005A-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005A-04 finished in 350 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p1))&&G(p2)&&p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:17] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 17:07:17] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:17] [INFO ] Computed 46 place invariants in 5 ms
[2021-05-15 17:07:17] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:17] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 17:07:17] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Running random walk in product with property : ShieldIIPt-PT-005A-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s20 1) (EQ s42 1) (EQ s55 1)), p2:(AND (OR (EQ s26 0) (EQ s28 0)) (EQ s42 1) (EQ s55 1)), p1:(EQ s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-005A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005A-05 finished in 289 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p1 U X(p2))&&p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 16 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:17] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 17:07:17] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:17] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-15 17:07:17] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:17] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 17:07:17] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-005A-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s14 0) (NEQ s29 0)), p1:(AND (EQ s60 1) (EQ s77 1)), p2:(NEQ s56 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 123 reset in 239 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 1 ms.
FORMULA ShieldIIPt-PT-005A-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005A-06 finished in 533 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 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 98 transition count 71
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 97 transition count 71
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 96 transition count 70
Applied a total of 4 rules in 65 ms. Remains 96 /98 variables (removed 2) and now considering 70/72 (removed 2) transitions.
// Phase 1: matrix 70 rows 96 cols
[2021-05-15 17:07:18] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 17:07:18] [INFO ] Implicit Places using invariants in 47 ms returned [88, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
[2021-05-15 17:07:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 70 rows 94 cols
[2021-05-15 17:07:18] [INFO ] Computed 44 place invariants in 0 ms
[2021-05-15 17:07:18] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Starting structural reductions, iteration 1 : 94/98 places, 70/72 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 94 transition count 69
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 93 transition count 69
Applied a total of 2 rules in 13 ms. Remains 93 /94 variables (removed 1) and now considering 69/70 (removed 1) transitions.
// Phase 1: matrix 69 rows 93 cols
[2021-05-15 17:07:18] [INFO ] Computed 44 place invariants in 0 ms
[2021-05-15 17:07:18] [INFO ] Implicit Places using invariants in 56 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 92/98 places, 69/72 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 91 transition count 68
Applied a total of 2 rules in 7 ms. Remains 91 /92 variables (removed 1) and now considering 68/69 (removed 1) transitions.
// Phase 1: matrix 68 rows 91 cols
[2021-05-15 17:07:18] [INFO ] Computed 43 place invariants in 1 ms
[2021-05-15 17:07:18] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 68 rows 91 cols
[2021-05-15 17:07:18] [INFO ] Computed 43 place invariants in 1 ms
[2021-05-15 17:07:18] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 91/98 places, 68/72 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005A-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s79 1) (NEQ s89 1) (AND (EQ s32 1) (EQ s38 1) (EQ s40 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 11924 reset in 225 ms.
Product exploration explored 100000 steps with 11851 reset in 226 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11917 reset in 184 ms.
Product exploration explored 100000 steps with 11743 reset in 211 ms.
[2021-05-15 17:07:19] [INFO ] Flatten gal took : 8 ms
[2021-05-15 17:07:19] [INFO ] Flatten gal took : 6 ms
[2021-05-15 17:07:19] [INFO ] Time to serialize gal into /tmp/LTL12940737956529638135.gal : 3 ms
[2021-05-15 17:07:19] [INFO ] Time to serialize properties into /tmp/LTL17591438475777927085.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12940737956529638135.gal, -t, CGAL, -LTL, /tmp/LTL17591438475777927085.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/LTL12940737956529638135.gal -t CGAL -LTL /tmp/LTL17591438475777927085.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p79==0)||(p96==0))||(((p32==1)&&(p38==1))&&(p40==1)))"))))
Formula 0 simplified : !GF"(((p79==0)||(p96==0))||(((p32==1)&&(p38==1))&&(p40==1)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
21 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.232348,22384,1,0,22,27868,24,1,2314,34925,65
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-005A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-005A-07 finished in 1821 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F((G(p2)||p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 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 98 transition count 71
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 97 transition count 71
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 96 transition count 70
Applied a total of 4 rules in 7 ms. Remains 96 /98 variables (removed 2) and now considering 70/72 (removed 2) transitions.
// Phase 1: matrix 70 rows 96 cols
[2021-05-15 17:07:20] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 17:07:20] [INFO ] Implicit Places using invariants in 65 ms returned [88, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
[2021-05-15 17:07:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 70 rows 94 cols
[2021-05-15 17:07:20] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-15 17:07:20] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Starting structural reductions, iteration 1 : 94/98 places, 70/72 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 94 transition count 69
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 93 transition count 69
Applied a total of 2 rules in 5 ms. Remains 93 /94 variables (removed 1) and now considering 69/70 (removed 1) transitions.
// Phase 1: matrix 69 rows 93 cols
[2021-05-15 17:07:20] [INFO ] Computed 44 place invariants in 0 ms
[2021-05-15 17:07:20] [INFO ] Implicit Places using invariants in 54 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 92/98 places, 69/72 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 91 transition count 68
Applied a total of 2 rules in 6 ms. Remains 91 /92 variables (removed 1) and now considering 68/69 (removed 1) transitions.
// Phase 1: matrix 68 rows 91 cols
[2021-05-15 17:07:20] [INFO ] Computed 43 place invariants in 1 ms
[2021-05-15 17:07:20] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 68 rows 91 cols
[2021-05-15 17:07:20] [INFO ] Computed 43 place invariants in 7 ms
[2021-05-15 17:07:20] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 91/98 places, 68/72 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-005A-08 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s71 1), p1:(OR (AND (EQ s69 1) (EQ s87 1)) (EQ s56 1)), p2:(EQ s56 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 33333 reset in 214 ms.
Product exploration explored 100000 steps with 33333 reset in 227 ms.
Knowledge obtained : [(NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33333 reset in 211 ms.
Product exploration explored 100000 steps with 33333 reset in 227 ms.
[2021-05-15 17:07:21] [INFO ] Flatten gal took : 6 ms
[2021-05-15 17:07:21] [INFO ] Flatten gal took : 6 ms
[2021-05-15 17:07:21] [INFO ] Time to serialize gal into /tmp/LTL13183268347890311830.gal : 2 ms
[2021-05-15 17:07:21] [INFO ] Time to serialize properties into /tmp/LTL949734696092445983.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/LTL13183268347890311830.gal, -t, CGAL, -LTL, /tmp/LTL949734696092445983.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/LTL13183268347890311830.gal -t CGAL -LTL /tmp/LTL949734696092445983.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(p71==1)"))||(F(("(((p69==1)&&(p94==1))||(p56==1))")||(G("(p56==1)"))))))
Formula 0 simplified : !(G"(p71==1)" | F("(((p69==1)&&(p94==1))||(p56==1))" | G"(p56==1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
13 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.139435,21032,1,0,8,18289,39,2,2262,28674,30
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-005A-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-005A-08 finished in 1588 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 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:21] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 17:07:21] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:21] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 17:07:21] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:21] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 17:07:21] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005A-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s37 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 1387 reset in 199 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA ShieldIIPt-PT-005A-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005A-09 finished in 429 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 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 97 transition count 70
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 95 transition count 70
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 93 transition count 69
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 93 transition count 68
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 92 transition count 68
Applied a total of 8 rules in 9 ms. Remains 92 /98 variables (removed 6) and now considering 68/72 (removed 4) transitions.
// Phase 1: matrix 68 rows 92 cols
[2021-05-15 17:07:22] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-15 17:07:22] [INFO ] Implicit Places using invariants in 115 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
[2021-05-15 17:07:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 68 rows 91 cols
[2021-05-15 17:07:22] [INFO ] Computed 43 place invariants in 0 ms
[2021-05-15 17:07:22] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 91/98 places, 68/72 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 90 transition count 67
Applied a total of 2 rules in 10 ms. Remains 90 /91 variables (removed 1) and now considering 67/68 (removed 1) transitions.
// Phase 1: matrix 67 rows 90 cols
[2021-05-15 17:07:22] [INFO ] Computed 43 place invariants in 0 ms
[2021-05-15 17:07:22] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 67 rows 90 cols
[2021-05-15 17:07:22] [INFO ] Computed 43 place invariants in 1 ms
[2021-05-15 17:07:22] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 90/98 places, 67/72 transitions.
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-005A-10 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s34 1), p1:(EQ s88 0)], nbAcceptance=2, 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 253 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ShieldIIPt-PT-005A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005A-10 finished in 614 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:22] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 17:07:22] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:22] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 17:07:22] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:22] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 17:07:22] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005A-11 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 s87 1) (EQ s91 1) (EQ s97 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-005A-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005A-11 finished in 264 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 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 0 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:22] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 17:07:22] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:22] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 17:07:23] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:23] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 17:07:23] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005A-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s44 1) (NEQ s53 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 50000 reset in 237 ms.
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Product exploration explored 100000 steps with 50000 reset in 247 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 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 98 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 72
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 9 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2021-05-15 17:07:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:24] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 17:07:24] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 72/72 transitions.
Product exploration explored 100000 steps with 50000 reset in 545 ms.
Product exploration explored 100000 steps with 50000 reset in 519 ms.
[2021-05-15 17:07:25] [INFO ] Flatten gal took : 6 ms
[2021-05-15 17:07:25] [INFO ] Flatten gal took : 6 ms
[2021-05-15 17:07:25] [INFO ] Time to serialize gal into /tmp/LTL2848246339329932103.gal : 1 ms
[2021-05-15 17:07:25] [INFO ] Time to serialize properties into /tmp/LTL14890927977280285664.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2848246339329932103.gal, -t, CGAL, -LTL, /tmp/LTL14890927977280285664.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/LTL2848246339329932103.gal -t CGAL -LTL /tmp/LTL14890927977280285664.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p44==0)||(p53==0))"))))
Formula 0 simplified : !XF"((p44==0)||(p53==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
14 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.154896,20968,1,0,6,20669,20,0,2366,32461,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-005A-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-005A-12 finished in 2802 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((X(p0)&&G(p1)) U (X(p0)&&G(p1)&&p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:25] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 17:07:25] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:25] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 17:07:25] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:25] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 17:07:25] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-005A-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s84 1) (EQ s95 1)), p1:(AND (EQ s7 1) (EQ s9 1)), p0:(AND (EQ s84 1) (EQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-005A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005A-13 finished in 310 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:26] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 17:07:26] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:26] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 17:07:26] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 98 cols
[2021-05-15 17:07:26] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 17:07:26] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005A-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s71 1) (EQ s86 1)), p0:(OR (EQ s94 1) (EQ s88 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]]
Product exploration explored 100000 steps with 1300 reset in 213 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldIIPt-PT-005A-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005A-15 finished in 539 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621098447540
--------------------
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-005A"
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-005A, 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-162098205000405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-005A.tgz
mv ShieldIIPt-PT-005A 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 ;