Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260109700003.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DiscoveryGPU-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109700003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 6.4K Apr 30 07:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 30 07:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 07:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 07:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 9 07:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 22K May 10 09:33 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-06a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652628806883

Running Version 202205111006
[2022-05-15 15:33:29] [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]
[2022-05-15 15:33:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:33:30] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2022-05-15 15:33:30] [INFO ] Transformed 63 places.
[2022-05-15 15:33:30] [INFO ] Transformed 85 transitions.
[2022-05-15 15:33:30] [INFO ] Found NUPN structural information;
[2022-05-15 15:33:30] [INFO ] Parsed PT model containing 63 places and 85 transitions in 332 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 85/85 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 58 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 58 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 57 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 57 transition count 78
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 17 place count 57 transition count 73
Applied a total of 17 rules in 36 ms. Remains 57 /63 variables (removed 6) and now considering 73/85 (removed 12) transitions.
// Phase 1: matrix 73 rows 57 cols
[2022-05-15 15:33:30] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 15:33:31] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 73 rows 57 cols
[2022-05-15 15:33:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:31] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-05-15 15:33:31] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 593 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/63 places, 73/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 56/63 places, 73/85 transitions.
Support contains 29 out of 56 places after structural reductions.
[2022-05-15 15:33:31] [INFO ] Flatten gal took : 27 ms
[2022-05-15 15:33:31] [INFO ] Flatten gal took : 10 ms
[2022-05-15 15:33:31] [INFO ] Input system was already deterministic with 73 transitions.
Support contains 28 out of 56 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 152 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 19) seen :18
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 73 rows 56 cols
[2022-05-15 15:33:31] [INFO ] Computed 1 place invariants in 9 ms
[2022-05-15 15:33:31] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 15:33:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-05-15 15:33:31] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 8 stabilizing places and 7 stable transitions
Graph (complete) has 139 edges and 56 vertex of which 54 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1 U !X(G(p2))))))'
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 52 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 52 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 48 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 48 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 47 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 47 transition count 64
Applied a total of 18 rules in 5 ms. Remains 47 /56 variables (removed 9) and now considering 64/73 (removed 9) transitions.
// Phase 1: matrix 64 rows 47 cols
[2022-05-15 15:33:32] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:33:32] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 64 rows 47 cols
[2022-05-15 15:33:32] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:33:32] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-15 15:33:32] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 47 cols
[2022-05-15 15:33:32] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 15:33:32] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/56 places, 64/73 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/56 places, 64/73 transitions.
Stuttering acceptance computed with spot in 502 ms :[p2, p2, (AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(OR (EQ s37 0) (EQ s14 1)), p0:(AND (OR (EQ s20 0) (EQ s7 1)) (OR (EQ s11 0) (EQ s36 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 127 steps with 12 reset in 5 ms.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-00 finished in 829 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X((G(X(F(p1)))&&p1)))))'
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 52 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 52 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 48 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 48 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 47 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 47 transition count 64
Applied a total of 18 rules in 4 ms. Remains 47 /56 variables (removed 9) and now considering 64/73 (removed 9) transitions.
// Phase 1: matrix 64 rows 47 cols
[2022-05-15 15:33:32] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:33:32] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 64 rows 47 cols
[2022-05-15 15:33:32] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-15 15:33:32] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-15 15:33:32] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 47 cols
[2022-05-15 15:33:32] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:33:33] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/56 places, 64/73 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/56 places, 64/73 transitions.
Stuttering acceptance computed with spot in 399 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s40 1)), p1:(OR (EQ s4 0) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1797 reset in 226 ms.
Stack based approach found an accepted trace after 1770 steps with 33 reset with depth 44 and stack size 39 in 8 ms.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-01 finished in 848 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p1)))'
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 53 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 53 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 50 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 50 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 49 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 49 transition count 66
Applied a total of 14 rules in 7 ms. Remains 49 /56 variables (removed 7) and now considering 66/73 (removed 7) transitions.
// Phase 1: matrix 66 rows 49 cols
[2022-05-15 15:33:33] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:33:33] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 66 rows 49 cols
[2022-05-15 15:33:33] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:33:33] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 15:33:33] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 49 cols
[2022-05-15 15:33:33] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:33:33] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/56 places, 66/73 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/56 places, 66/73 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s33 0) (EQ s45 1)), p0:(OR (EQ s39 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33431 reset in 167 ms.
Product exploration explored 100000 steps with 33428 reset in 180 ms.
Computed a total of 8 stabilizing places and 7 stable transitions
Graph (complete) has 129 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 493 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Finished random walk after 2463 steps, including 36 resets, run visited all 5 properties in 17 ms. (steps per millisecond=144 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 12 factoid took 274 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-02 finished in 1601 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1)))'
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 52 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 52 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 49 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 49 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 48 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 48 transition count 65
Applied a total of 16 rules in 10 ms. Remains 48 /56 variables (removed 8) and now considering 65/73 (removed 8) transitions.
// Phase 1: matrix 65 rows 48 cols
[2022-05-15 15:33:35] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:33:35] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 65 rows 48 cols
[2022-05-15 15:33:35] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:33:35] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-15 15:33:35] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
// Phase 1: matrix 65 rows 48 cols
[2022-05-15 15:33:35] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:33:35] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/56 places, 65/73 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/56 places, 65/73 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (EQ s25 0) (EQ s38 1)), p1:(OR (EQ s26 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-05 finished in 829 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G(p0)))))'
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 73/73 transitions.
Graph (complete) has 139 edges and 56 vertex of which 54 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 59 edges and 52 vertex of which 42 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Graph (trivial) has 45 edges and 42 vertex of which 22 / 42 are part of one of the 11 SCC in 2 ms
Free SCC test removed 11 places
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 9 rules applied. Total rules applied 10 place count 31 transition count 54
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 27 place count 25 transition count 43
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 32 place count 20 transition count 33
Iterating global reduction 2 with 5 rules applied. Total rules applied 37 place count 20 transition count 33
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 41 place count 16 transition count 25
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 16 transition count 25
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 12 transition count 17
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 12 transition count 17
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 8 transition count 13
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 8 transition count 13
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 2 with 2 rules applied. Total rules applied 63 place count 7 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 5 transition count 9
Applied a total of 66 rules in 29 ms. Remains 5 /56 variables (removed 51) and now considering 9/73 (removed 64) transitions.
[2022-05-15 15:33:36] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2022-05-15 15:33:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:33:36] [INFO ] Implicit Places using invariants in 12 ms returned []
[2022-05-15 15:33:36] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2022-05-15 15:33:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:33:36] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-15 15:33:36] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 15:33:36] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2022-05-15 15:33:36] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:33:36] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/56 places, 9/73 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/56 places, 9/73 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 0)], 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-06a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-11 finished in 175 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 52 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 52 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 48 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 48 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 47 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 47 transition count 64
Applied a total of 18 rules in 8 ms. Remains 47 /56 variables (removed 9) and now considering 64/73 (removed 9) transitions.
// Phase 1: matrix 64 rows 47 cols
[2022-05-15 15:33:36] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:33:36] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 64 rows 47 cols
[2022-05-15 15:33:36] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:33:36] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-15 15:33:36] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 47 cols
[2022-05-15 15:33:36] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:33:36] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/56 places, 64/73 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/56 places, 64/73 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s0 0) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 11791 reset in 362 ms.
Stack based approach found an accepted trace after 21 steps with 2 reset with depth 5 and stack size 5 in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-12 finished in 564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((F(X(p1))||p0)))))'
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 73/73 transitions.
Graph (complete) has 139 edges and 56 vertex of which 54 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 59 edges and 52 vertex of which 45 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Graph (trivial) has 45 edges and 45 vertex of which 24 / 45 are part of one of the 12 SCC in 1 ms
Free SCC test removed 12 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 33 transition count 59
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 24 place count 29 transition count 47
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 26 transition count 41
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 26 transition count 41
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 24 transition count 37
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 24 transition count 37
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 22 transition count 33
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 22 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 20 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 20 transition count 31
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 2 with 4 rules applied. Total rules applied 46 place count 18 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 18 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 14 transition count 23
Applied a total of 52 rules in 7 ms. Remains 14 /56 variables (removed 42) and now considering 23/73 (removed 50) transitions.
[2022-05-15 15:33:36] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 15:33:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:33:36] [INFO ] Implicit Places using invariants in 15 ms returned []
[2022-05-15 15:33:36] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 15:33:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:33:36] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-15 15:33:36] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:33:36] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 15:33:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:33:36] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/56 places, 23/73 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/56 places, 23/73 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s8 1)), p1:(AND (EQ s2 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-13 finished in 182 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U X(F(p1))))&&G(X((F(p1)||p2)))))'
Support contains 3 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 52 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 52 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 48 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 48 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 47 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 47 transition count 64
Applied a total of 18 rules in 10 ms. Remains 47 /56 variables (removed 9) and now considering 64/73 (removed 9) transitions.
// Phase 1: matrix 64 rows 47 cols
[2022-05-15 15:33:37] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 15:33:37] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 64 rows 47 cols
[2022-05-15 15:33:37] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:33:37] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-15 15:33:37] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 47 cols
[2022-05-15 15:33:37] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:33:37] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/56 places, 64/73 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/56 places, 64/73 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s30 1), p2:(OR (EQ s13 0) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 252 steps with 8 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-15 finished in 359 ms.
All properties solved by simple procedures.
Total runtime 7739 ms.

BK_STOP 1652628817520

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-06a"
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-06a, 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 r078-tall-165260109700003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06a.tgz
mv DiscoveryGPU-PT-06a 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;