About the Execution of ITS-Tools for DiscoveryGPU-PT-08a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
307.279 | 6668.00 | 13415.00 | 125.60 | FFFFFFTFTFFTTFFF | 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.r083-tall-162048875200268.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 DiscoveryGPU-PT-08a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875200268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 156K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 5 16:58 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:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 17:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 28K May 5 16:51 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 DiscoveryGPU-PT-08a-00
FORMULA_NAME DiscoveryGPU-PT-08a-01
FORMULA_NAME DiscoveryGPU-PT-08a-02
FORMULA_NAME DiscoveryGPU-PT-08a-03
FORMULA_NAME DiscoveryGPU-PT-08a-04
FORMULA_NAME DiscoveryGPU-PT-08a-05
FORMULA_NAME DiscoveryGPU-PT-08a-06
FORMULA_NAME DiscoveryGPU-PT-08a-07
FORMULA_NAME DiscoveryGPU-PT-08a-08
FORMULA_NAME DiscoveryGPU-PT-08a-09
FORMULA_NAME DiscoveryGPU-PT-08a-10
FORMULA_NAME DiscoveryGPU-PT-08a-11
FORMULA_NAME DiscoveryGPU-PT-08a-12
FORMULA_NAME DiscoveryGPU-PT-08a-13
FORMULA_NAME DiscoveryGPU-PT-08a-14
FORMULA_NAME DiscoveryGPU-PT-08a-15
=== Now, execution of the tool begins
BK_START 1620573661092
Running Version 0
[2021-05-09 15:21:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-09 15:21:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:21:02] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-09 15:21:02] [INFO ] Transformed 83 places.
[2021-05-09 15:21:02] [INFO ] Transformed 113 transitions.
[2021-05-09 15:21:02] [INFO ] Found NUPN structural information;
[2021-05-09 15:21:02] [INFO ] Parsed PT model containing 83 places and 113 transitions in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 15:21:02] [INFO ] Initial state test concluded for 2 properties.
FORMULA DiscoveryGPU-PT-08a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 79 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 79 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 78 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 78 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 77 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 77 transition count 106
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 19 place count 77 transition count 99
Applied a total of 19 rules in 22 ms. Remains 77 /83 variables (removed 6) and now considering 99/113 (removed 14) transitions.
// Phase 1: matrix 99 rows 77 cols
[2021-05-09 15:21:02] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 15:21:02] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 99 rows 77 cols
[2021-05-09 15:21:02] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 15:21:03] [INFO ] State equation strengthened by 63 read => feed constraints.
[2021-05-09 15:21:03] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 231 ms to find 1 implicit places.
// Phase 1: matrix 99 rows 76 cols
[2021-05-09 15:21:03] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:21:03] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Starting structural reductions, iteration 1 : 76/83 places, 99/113 transitions.
Applied a total of 0 rules in 9 ms. Remains 76 /76 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 76 cols
[2021-05-09 15:21:03] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 15:21:03] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 2 iterations. Remains : 76/83 places, 99/113 transitions.
[2021-05-09 15:21:03] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 15:21:03] [INFO ] Flatten gal took : 29 ms
FORMULA DiscoveryGPU-PT-08a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:21:03] [INFO ] Flatten gal took : 11 ms
[2021-05-09 15:21:03] [INFO ] Input system was already deterministic with 99 transitions.
Finished random walk after 11086 steps, including 129 resets, run visited all 18 properties in 52 ms. (steps per millisecond=213 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 84 edges and 74 vertex of which 32 / 74 are part of one of the 16 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 58 transition count 76
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 63 place count 36 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 35 transition count 59
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 68 place count 31 transition count 51
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 31 transition count 51
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 31 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 74 place count 30 transition count 50
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 79 place count 25 transition count 40
Iterating global reduction 5 with 5 rules applied. Total rules applied 84 place count 25 transition count 40
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 85 place count 25 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 86 place count 24 transition count 39
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 92 place count 18 transition count 27
Iterating global reduction 7 with 6 rules applied. Total rules applied 98 place count 18 transition count 27
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 104 place count 12 transition count 19
Iterating global reduction 7 with 6 rules applied. Total rules applied 110 place count 12 transition count 19
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 112 place count 10 transition count 16
Iterating global reduction 7 with 2 rules applied. Total rules applied 114 place count 10 transition count 16
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 115 place count 9 transition count 15
Iterating global reduction 7 with 1 rules applied. Total rules applied 116 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 120 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 121 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 122 place count 6 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 123 place count 5 transition count 10
Applied a total of 123 rules in 26 ms. Remains 5 /76 variables (removed 71) and now considering 10/99 (removed 89) transitions.
[2021-05-09 15:21:03] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 15:21:03] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 15:21:03] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-09 15:21:03] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 15:21:03] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:21:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:21:03] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-09 15:21:03] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:21:03] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 15:21:03] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 15:21:03] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/76 places, 10/99 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 31 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-08a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-00 finished in 231 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X((G(F(p1)) U G(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 99/99 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 72 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 72 transition count 95
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 68 transition count 91
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 68 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 66 transition count 89
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 66 transition count 89
Applied a total of 20 rules in 7 ms. Remains 66 /76 variables (removed 10) and now considering 89/99 (removed 10) transitions.
// Phase 1: matrix 89 rows 66 cols
[2021-05-09 15:21:03] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:21:03] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 89 rows 66 cols
[2021-05-09 15:21:03] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:21:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-09 15:21:03] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 89 rows 66 cols
[2021-05-09 15:21:03] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 15:21:03] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/76 places, 89/99 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : DiscoveryGPU-PT-08a-01 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(OR (EQ s62 0) (EQ s4 1)), p1:(OR (EQ s20 0) (EQ s29 1)), p0:(OR (EQ s39 0) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1180 reset in 282 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA DiscoveryGPU-PT-08a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-01 finished in 614 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(X(p0))&&F(p1))||X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 99/99 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 71 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 71 transition count 94
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 67 transition count 90
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 67 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 64 transition count 87
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 64 transition count 87
Applied a total of 24 rules in 6 ms. Remains 64 /76 variables (removed 12) and now considering 87/99 (removed 12) transitions.
// Phase 1: matrix 87 rows 64 cols
[2021-05-09 15:21:04] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:04] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 87 rows 64 cols
[2021-05-09 15:21:04] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:21:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 15:21:04] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 64 cols
[2021-05-09 15:21:04] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 15:21:04] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 64/76 places, 87/99 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (NEQ s9 0) (NEQ s25 1)), p0:(AND (NEQ s48 0) (NEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-02 finished in 323 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 99/99 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 76 transition count 93
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 70 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 70 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 69 transition count 92
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 63 transition count 86
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 63 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 60 transition count 83
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 60 transition count 83
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 44 transition count 67
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 37 transition count 53
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 37 transition count 53
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 85 place count 30 transition count 39
Iterating global reduction 2 with 7 rules applied. Total rules applied 92 place count 30 transition count 39
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 98 place count 24 transition count 33
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 24 transition count 33
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 110 place count 18 transition count 21
Iterating global reduction 2 with 6 rules applied. Total rules applied 116 place count 18 transition count 21
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 121 place count 13 transition count 16
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 13 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 13 transition count 16
Applied a total of 127 rules in 18 ms. Remains 13 /76 variables (removed 63) and now considering 16/99 (removed 83) transitions.
[2021-05-09 15:21:04] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 13 cols
[2021-05-09 15:21:04] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:04] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-09 15:21:04] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 13 cols
[2021-05-09 15:21:04] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:04] [INFO ] State equation strengthened by 11 read => feed constraints.
[2021-05-09 15:21:04] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-09 15:21:04] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:21:04] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 13 cols
[2021-05-09 15:21:04] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:21:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/76 places, 16/99 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-03 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s6 0), p1:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-03 finished in 168 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 79 edges and 74 vertex of which 30 / 74 are part of one of the 15 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 59 transition count 76
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 61 place count 37 transition count 61
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 33 transition count 53
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 33 transition count 53
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 31 transition count 49
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 31 transition count 49
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 29 transition count 45
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 29 transition count 45
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 27 transition count 43
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 27 transition count 43
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 93 place count 21 transition count 37
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 19 transition count 33
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 19 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 17 transition count 27
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 17 transition count 27
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 15 transition count 25
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 15 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 15 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 14 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 13 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 12 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 11 transition count 20
Applied a total of 110 rules in 11 ms. Remains 11 /76 variables (removed 65) and now considering 20/99 (removed 79) transitions.
[2021-05-09 15:21:04] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
// Phase 1: matrix 16 rows 11 cols
[2021-05-09 15:21:04] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 15:21:04] [INFO ] Implicit Places using invariants in 7 ms returned []
[2021-05-09 15:21:04] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
// Phase 1: matrix 16 rows 11 cols
[2021-05-09 15:21:04] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:21:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:21:04] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-09 15:21:04] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:21:04] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
// Phase 1: matrix 16 rows 11 cols
[2021-05-09 15:21:04] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:21:04] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/76 places, 20/99 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s2 1), p0:(OR (EQ s8 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-04 finished in 144 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 99/99 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 73 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 73 transition count 96
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 70 transition count 93
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 70 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 69 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 69 transition count 92
Applied a total of 14 rules in 7 ms. Remains 69 /76 variables (removed 7) and now considering 92/99 (removed 7) transitions.
// Phase 1: matrix 92 rows 69 cols
[2021-05-09 15:21:05] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:21:05] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 92 rows 69 cols
[2021-05-09 15:21:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:05] [INFO ] State equation strengthened by 44 read => feed constraints.
[2021-05-09 15:21:05] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
// Phase 1: matrix 92 rows 69 cols
[2021-05-09 15:21:05] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-09 15:21:05] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 69/76 places, 92/99 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s35 1) (NEQ s45 0) (NEQ s1 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 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-05 finished in 226 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F(p1)&&X(p2)&&p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 99/99 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 70 transition count 93
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 70 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 64 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 64 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 61 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 61 transition count 84
Applied a total of 30 rules in 5 ms. Remains 61 /76 variables (removed 15) and now considering 84/99 (removed 15) transitions.
// Phase 1: matrix 84 rows 61 cols
[2021-05-09 15:21:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:05] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 84 rows 61 cols
[2021-05-09 15:21:05] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:21:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-09 15:21:05] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 61 cols
[2021-05-09 15:21:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:05] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/76 places, 84/99 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s25 0) (NEQ s20 1)), p1:(AND (NEQ s25 0) (NEQ s20 1)), p2:(AND (NEQ s19 0) (NEQ s33 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-09 finished in 252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 99/99 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 71 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 71 transition count 94
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 66 transition count 89
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 66 transition count 89
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 64 transition count 87
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 64 transition count 87
Applied a total of 24 rules in 4 ms. Remains 64 /76 variables (removed 12) and now considering 87/99 (removed 12) transitions.
// Phase 1: matrix 87 rows 64 cols
[2021-05-09 15:21:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:05] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 87 rows 64 cols
[2021-05-09 15:21:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 15:21:05] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 64 cols
[2021-05-09 15:21:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:05] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 64/76 places, 87/99 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-10 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:(OR (EQ s46 0) (EQ s19 1) (EQ s32 0) (EQ s13 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 4063 steps with 46 reset in 7 ms.
FORMULA DiscoveryGPU-PT-08a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-10 finished in 203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 99/99 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 76 transition count 93
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 70 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 70 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 69 transition count 92
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 63 transition count 86
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 63 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 60 transition count 83
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 60 transition count 83
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 66 place count 43 transition count 66
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 73 place count 36 transition count 52
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 36 transition count 52
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 87 place count 29 transition count 38
Iterating global reduction 2 with 7 rules applied. Total rules applied 94 place count 29 transition count 38
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 101 place count 22 transition count 31
Iterating global reduction 2 with 7 rules applied. Total rules applied 108 place count 22 transition count 31
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 115 place count 15 transition count 17
Iterating global reduction 2 with 7 rules applied. Total rules applied 122 place count 15 transition count 17
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 128 place count 9 transition count 11
Iterating global reduction 2 with 6 rules applied. Total rules applied 134 place count 9 transition count 11
Applied a total of 134 rules in 14 ms. Remains 9 /76 variables (removed 67) and now considering 11/99 (removed 88) transitions.
[2021-05-09 15:21:05] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 9 cols
[2021-05-09 15:21:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:05] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-09 15:21:05] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 9 cols
[2021-05-09 15:21:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 15:21:05] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-09 15:21:05] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:21:05] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 9 cols
[2021-05-09 15:21:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:05] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/76 places, 11/99 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
[2021-05-09 15:21:06] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:21:06] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:21:06] [INFO ] Time to serialize gal into /tmp/LTL3221502665226438033.gal : 1 ms
[2021-05-09 15:21:06] [INFO ] Time to serialize properties into /tmp/LTL9738651167038970497.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/LTL3221502665226438033.gal, -t, CGAL, -LTL, /tmp/LTL9738651167038970497.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/LTL3221502665226438033.gal -t CGAL -LTL /tmp/LTL9738651167038970497.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(p20==1)")))
Formula 0 simplified : !F"(p20==1)"
Reverse transition relation is NOT exact ! Due to transitions t93, t81.t94, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/9/2/11
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1 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.024132,16460,1,0,28,1358,46,16,295,1722,37
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-08a-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-08a-12 finished in 769 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 99/99 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 70 transition count 93
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 70 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 64 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 64 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 61 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 61 transition count 84
Applied a total of 30 rules in 3 ms. Remains 61 /76 variables (removed 15) and now considering 84/99 (removed 15) transitions.
// Phase 1: matrix 84 rows 61 cols
[2021-05-09 15:21:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:06] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 84 rows 61 cols
[2021-05-09 15:21:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-09 15:21:06] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 61 cols
[2021-05-09 15:21:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:06] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/76 places, 84/99 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s14 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 31 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-13 finished in 308 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 99/99 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 76 transition count 94
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 71 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 70 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 70 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 69 transition count 92
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 20 place count 63 transition count 86
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 63 transition count 86
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 29 place count 60 transition count 83
Iterating global reduction 3 with 3 rules applied. Total rules applied 32 place count 60 transition count 83
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 64 place count 44 transition count 67
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 70 place count 38 transition count 55
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 38 transition count 55
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 32 transition count 43
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 32 transition count 43
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 94 place count 26 transition count 37
Iterating global reduction 3 with 6 rules applied. Total rules applied 100 place count 26 transition count 37
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 106 place count 20 transition count 25
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 20 transition count 25
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 117 place count 15 transition count 20
Iterating global reduction 3 with 5 rules applied. Total rules applied 122 place count 15 transition count 20
Applied a total of 122 rules in 18 ms. Remains 15 /76 variables (removed 61) and now considering 20/99 (removed 79) transitions.
[2021-05-09 15:21:06] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 15 cols
[2021-05-09 15:21:06] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:21:06] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-09 15:21:06] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 15 cols
[2021-05-09 15:21:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-09 15:21:06] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-09 15:21:06] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:21:06] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 15 cols
[2021-05-09 15:21:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:06] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/76 places, 20/99 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s8 0) (NEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-14 finished in 93 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 80 edges and 74 vertex of which 30 / 74 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 59 transition count 78
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 57 place count 39 transition count 63
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 36 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 36 transition count 57
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 36 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 35 transition count 56
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 69 place count 31 transition count 48
Iterating global reduction 4 with 4 rules applied. Total rules applied 73 place count 31 transition count 48
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 77 place count 27 transition count 40
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 27 transition count 40
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 85 place count 23 transition count 35
Iterating global reduction 4 with 4 rules applied. Total rules applied 89 place count 23 transition count 35
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 90 place count 22 transition count 34
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 22 transition count 34
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 101 place count 17 transition count 29
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 102 place count 16 transition count 27
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 16 transition count 27
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 15 transition count 24
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 15 transition count 24
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 14 transition count 23
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 14 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 14 transition count 22
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 14 transition count 22
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 13 transition count 21
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 13 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 12 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 11 transition count 19
Applied a total of 114 rules in 11 ms. Remains 11 /76 variables (removed 65) and now considering 19/99 (removed 80) transitions.
[2021-05-09 15:21:06] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 11 cols
[2021-05-09 15:21:06] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:21:06] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-09 15:21:06] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 11 cols
[2021-05-09 15:21:06] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:21:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:21:06] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-09 15:21:06] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:21:06] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 11 cols
[2021-05-09 15:21:06] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:21:06] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/76 places, 19/99 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-15 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 s6 1) (AND (NEQ s2 0) (NEQ s7 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]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-15 finished in 109 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620573667760
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="DiscoveryGPU-PT-08a"
export BK_EXAMINATION="LTLCardinality"
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 DiscoveryGPU-PT-08a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875200268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-08a.tgz
mv DiscoveryGPU-PT-08a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;