Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838855300051.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Echo-PT-d02r09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855300051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 7.6K Feb 25 14:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 14:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 25 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 303K Mar 5 18:22 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 Echo-PT-d02r09-LTLCardinality-00
FORMULA_NAME Echo-PT-d02r09-LTLCardinality-01
FORMULA_NAME Echo-PT-d02r09-LTLCardinality-02
FORMULA_NAME Echo-PT-d02r09-LTLCardinality-03
FORMULA_NAME Echo-PT-d02r09-LTLCardinality-04
FORMULA_NAME Echo-PT-d02r09-LTLCardinality-05
FORMULA_NAME Echo-PT-d02r09-LTLCardinality-06
FORMULA_NAME Echo-PT-d02r09-LTLCardinality-07
FORMULA_NAME Echo-PT-d02r09-LTLCardinality-08
FORMULA_NAME Echo-PT-d02r09-LTLCardinality-09
FORMULA_NAME Echo-PT-d02r09-LTLCardinality-10
FORMULA_NAME Echo-PT-d02r09-LTLCardinality-11
FORMULA_NAME Echo-PT-d02r09-LTLCardinality-12
FORMULA_NAME Echo-PT-d02r09-LTLCardinality-13
FORMULA_NAME Echo-PT-d02r09-LTLCardinality-14
FORMULA_NAME Echo-PT-d02r09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678465367977

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 16:22:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 16:22:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:22:49] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2023-03-10 16:22:49] [INFO ] Transformed 735 places.
[2023-03-10 16:22:49] [INFO ] Transformed 570 transitions.
[2023-03-10 16:22:49] [INFO ] Found NUPN structural information;
[2023-03-10 16:22:49] [INFO ] Parsed PT model containing 735 places and 570 transitions and 3220 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Echo-PT-d02r09-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA Echo-PT-d02r09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 735 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 735/735 places, 570/570 transitions.
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 660 transition count 570
Applied a total of 75 rules in 142 ms. Remains 660 /735 variables (removed 75) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 660 cols
[2023-03-10 16:22:50] [INFO ] Computed 294 place invariants in 202 ms
[2023-03-10 16:22:51] [INFO ] Implicit Places using invariants in 1921 ms returned []
[2023-03-10 16:22:51] [INFO ] Invariant cache hit.
[2023-03-10 16:22:55] [INFO ] Implicit Places using invariants and state equation in 3436 ms returned []
Implicit Place search using SMT with State Equation took 5389 ms to find 0 implicit places.
[2023-03-10 16:22:55] [INFO ] Invariant cache hit.
[2023-03-10 16:22:56] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 660/735 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6431 ms. Remains : 660/735 places, 570/570 transitions.
Support contains 17 out of 660 places after structural reductions.
[2023-03-10 16:22:56] [INFO ] Flatten gal took : 90 ms
[2023-03-10 16:22:56] [INFO ] Flatten gal took : 52 ms
[2023-03-10 16:22:56] [INFO ] Input system was already deterministic with 570 transitions.
Finished random walk after 688 steps, including 4 resets, run visited all 10 properties in 113 ms. (steps per millisecond=6 )
FORMULA Echo-PT-d02r09-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 660 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 660 transition count 570
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X((G(!X(X(p0))) U p1))))))'
Support contains 2 out of 660 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 570/570 transitions.
Graph (complete) has 1937 edges and 660 vertex of which 650 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.6 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 129 ms. Remains 649 /660 variables (removed 11) and now considering 568/570 (removed 2) transitions.
// Phase 1: matrix 568 rows 649 cols
[2023-03-10 16:22:57] [INFO ] Computed 285 place invariants in 133 ms
[2023-03-10 16:22:59] [INFO ] Implicit Places using invariants in 2062 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2074 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 645/660 places, 568/570 transitions.
Applied a total of 0 rules in 83 ms. Remains 645 /645 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2286 ms. Remains : 645/660 places, 568/570 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s122 0) (EQ s547 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 663 reset in 694 ms.
Product exploration explored 100000 steps with 664 reset in 670 ms.
Computed a total of 645 stabilizing places and 568 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 645 transition count 568
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Finished random walk after 205 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=41 )
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 645 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 568/568 transitions.
Applied a total of 0 rules in 31 ms. Remains 645 /645 variables (removed 0) and now considering 568/568 (removed 0) transitions.
// Phase 1: matrix 568 rows 645 cols
[2023-03-10 16:23:01] [INFO ] Computed 281 place invariants in 96 ms
[2023-03-10 16:23:03] [INFO ] Implicit Places using invariants in 1712 ms returned []
[2023-03-10 16:23:03] [INFO ] Invariant cache hit.
[2023-03-10 16:23:07] [INFO ] Implicit Places using invariants and state equation in 4134 ms returned []
Implicit Place search using SMT with State Equation took 5853 ms to find 0 implicit places.
[2023-03-10 16:23:07] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-10 16:23:07] [INFO ] Invariant cache hit.
[2023-03-10 16:23:08] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6932 ms. Remains : 645/645 places, 568/568 transitions.
Computed a total of 645 stabilizing places and 568 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 645 transition count 568
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Finished random walk after 141 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=28 )
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 658 reset in 582 ms.
Product exploration explored 100000 steps with 658 reset in 644 ms.
Support contains 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 568/568 transitions.
Graph (complete) has 1860 edges and 645 vertex of which 644 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 644 /645 variables (removed 1) and now considering 568/568 (removed 0) transitions.
// Phase 1: matrix 568 rows 644 cols
[2023-03-10 16:23:10] [INFO ] Computed 280 place invariants in 129 ms
[2023-03-10 16:23:12] [INFO ] Implicit Places using invariants in 1853 ms returned []
[2023-03-10 16:23:12] [INFO ] Invariant cache hit.
[2023-03-10 16:23:15] [INFO ] Implicit Places using invariants and state equation in 2489 ms returned []
Implicit Place search using SMT with State Equation took 4348 ms to find 0 implicit places.
[2023-03-10 16:23:15] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-10 16:23:15] [INFO ] Invariant cache hit.
[2023-03-10 16:23:16] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 644/645 places, 568/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5268 ms. Remains : 644/645 places, 568/568 transitions.
Treatment of property Echo-PT-d02r09-LTLCardinality-00 finished in 19106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 570/570 transitions.
Graph (complete) has 1937 edges and 660 vertex of which 650 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 33 ms. Remains 649 /660 variables (removed 11) and now considering 568/570 (removed 2) transitions.
// Phase 1: matrix 568 rows 649 cols
[2023-03-10 16:23:16] [INFO ] Computed 285 place invariants in 104 ms
[2023-03-10 16:23:17] [INFO ] Implicit Places using invariants in 1792 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1795 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 645/660 places, 568/570 transitions.
Applied a total of 0 rules in 22 ms. Remains 645 /645 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1852 ms. Remains : 645/660 places, 568/570 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s472 0) (NEQ s207 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 621 reset in 569 ms.
Product exploration explored 100000 steps with 621 reset in 603 ms.
Computed a total of 645 stabilizing places and 568 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 645 transition count 568
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 113 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
// Phase 1: matrix 568 rows 645 cols
[2023-03-10 16:23:20] [INFO ] Computed 281 place invariants in 115 ms
[2023-03-10 16:23:20] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2023-03-10 16:23:35] [INFO ] [Real]Absence check using 4 positive and 277 generalized place invariants in 14631 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 568/568 transitions.
Applied a total of 0 rules in 33 ms. Remains 645 /645 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-10 16:23:35] [INFO ] Invariant cache hit.
[2023-03-10 16:23:36] [INFO ] Implicit Places using invariants in 1629 ms returned []
[2023-03-10 16:23:36] [INFO ] Invariant cache hit.
[2023-03-10 16:23:39] [INFO ] Implicit Places using invariants and state equation in 2955 ms returned []
Implicit Place search using SMT with State Equation took 4599 ms to find 0 implicit places.
[2023-03-10 16:23:39] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 16:23:39] [INFO ] Invariant cache hit.
[2023-03-10 16:23:40] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5446 ms. Remains : 645/645 places, 568/568 transitions.
Computed a total of 645 stabilizing places and 568 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 645 transition count 568
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 149 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=37 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-10 16:23:41] [INFO ] Invariant cache hit.
[2023-03-10 16:23:41] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-10 16:23:56] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 16:23:56] [INFO ] [Real]Absence check using 4 positive and 277 generalized place invariants in 14630 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 621 reset in 565 ms.
Product exploration explored 100000 steps with 621 reset in 608 ms.
Support contains 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 568/568 transitions.
Applied a total of 0 rules in 18 ms. Remains 645 /645 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-10 16:23:57] [INFO ] Invariant cache hit.
[2023-03-10 16:23:59] [INFO ] Implicit Places using invariants in 1686 ms returned []
[2023-03-10 16:23:59] [INFO ] Invariant cache hit.
[2023-03-10 16:24:02] [INFO ] Implicit Places using invariants and state equation in 3157 ms returned []
Implicit Place search using SMT with State Equation took 4847 ms to find 0 implicit places.
[2023-03-10 16:24:02] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-10 16:24:02] [INFO ] Invariant cache hit.
[2023-03-10 16:24:03] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5678 ms. Remains : 645/645 places, 568/568 transitions.
Treatment of property Echo-PT-d02r09-LTLCardinality-01 finished in 47066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p0)))'
Support contains 1 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 570/570 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 654 transition count 570
Applied a total of 6 rules in 8 ms. Remains 654 /660 variables (removed 6) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2023-03-10 16:24:03] [INFO ] Computed 288 place invariants in 85 ms
[2023-03-10 16:24:05] [INFO ] Implicit Places using invariants in 2207 ms returned []
[2023-03-10 16:24:05] [INFO ] Invariant cache hit.
[2023-03-10 16:24:09] [INFO ] Implicit Places using invariants and state equation in 3671 ms returned []
Implicit Place search using SMT with State Equation took 5880 ms to find 0 implicit places.
[2023-03-10 16:24:09] [INFO ] Invariant cache hit.
[2023-03-10 16:24:10] [INFO ] Dead Transitions using invariants and state equation in 1016 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 654/660 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6905 ms. Remains : 654/660 places, 570/570 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-03 automaton TGBA Formula[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:(EQ s568 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d02r09-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLCardinality-03 finished in 7035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 655 transition count 570
Applied a total of 5 rules in 14 ms. Remains 655 /660 variables (removed 5) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 655 cols
[2023-03-10 16:24:10] [INFO ] Computed 289 place invariants in 103 ms
[2023-03-10 16:24:12] [INFO ] Implicit Places using invariants in 2132 ms returned []
[2023-03-10 16:24:12] [INFO ] Invariant cache hit.
[2023-03-10 16:24:16] [INFO ] Implicit Places using invariants and state equation in 3640 ms returned []
Implicit Place search using SMT with State Equation took 5777 ms to find 0 implicit places.
[2023-03-10 16:24:16] [INFO ] Invariant cache hit.
[2023-03-10 16:24:17] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 655/660 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6804 ms. Remains : 655/660 places, 570/570 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r09-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:(NEQ s201 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 50000 reset in 353 ms.
Product exploration explored 100000 steps with 50000 reset in 390 ms.
Computed a total of 655 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 655 transition count 570
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r09-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r09-LTLCardinality-12 finished in 7922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X((!p0||F(p1)))&&F(!p0))) U ((!p2&&X((X((!p0||F(p1)))&&F(!p0))))||X(G((X((!p0||F(p1)))&&F(!p0)))))))'
Support contains 5 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 570/570 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 654 transition count 570
Applied a total of 6 rules in 8 ms. Remains 654 /660 variables (removed 6) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2023-03-10 16:24:18] [INFO ] Computed 288 place invariants in 89 ms
[2023-03-10 16:24:20] [INFO ] Implicit Places using invariants in 2076 ms returned []
[2023-03-10 16:24:20] [INFO ] Invariant cache hit.
[2023-03-10 16:24:23] [INFO ] Implicit Places using invariants and state equation in 3351 ms returned []
Implicit Place search using SMT with State Equation took 5433 ms to find 0 implicit places.
[2023-03-10 16:24:23] [INFO ] Invariant cache hit.
[2023-03-10 16:24:24] [INFO ] Dead Transitions using invariants and state equation in 1054 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 654/660 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6497 ms. Remains : 654/660 places, 570/570 transitions.
Stuttering acceptance computed with spot in 369 ms :[p0, p0, (AND (NOT p1) p0), p0, (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), false]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 6}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(OR (EQ s282 0) (EQ s200 1)), p2:(AND (EQ s371 1) (OR (EQ s150 0) (EQ s615 1))), p1:(NEQ s371 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 165 steps with 1 reset in 3 ms.
FORMULA Echo-PT-d02r09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLCardinality-13 finished in 6899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 655 transition count 570
Applied a total of 5 rules in 11 ms. Remains 655 /660 variables (removed 5) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 655 cols
[2023-03-10 16:24:25] [INFO ] Computed 289 place invariants in 95 ms
[2023-03-10 16:24:27] [INFO ] Implicit Places using invariants in 2121 ms returned []
[2023-03-10 16:24:27] [INFO ] Invariant cache hit.
[2023-03-10 16:24:31] [INFO ] Implicit Places using invariants and state equation in 3792 ms returned []
Implicit Place search using SMT with State Equation took 5916 ms to find 0 implicit places.
[2023-03-10 16:24:31] [INFO ] Invariant cache hit.
[2023-03-10 16:24:32] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 655/660 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6959 ms. Remains : 655/660 places, 570/570 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s570 1) (EQ s105 0) (EQ s330 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 338 ms.
Product exploration explored 100000 steps with 33333 reset in 363 ms.
Computed a total of 655 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 655 transition count 570
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r09-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r09-LTLCardinality-15 finished in 8043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X((G(!X(X(p0))) U p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-10 16:24:33] [INFO ] Flatten gal took : 43 ms
[2023-03-10 16:24:33] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 16:24:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 660 places, 570 transitions and 2957 arcs took 6 ms.
Total runtime 103948 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/920/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/920/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Echo-PT-d02r09-LTLCardinality-00
Could not compute solution for formula : Echo-PT-d02r09-LTLCardinality-01

BK_STOP 1678465475683

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name Echo-PT-d02r09-LTLCardinality-00
ltl formula formula --ltl=/tmp/920/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 660 places, 570 transitions and 2957 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.020 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/920/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/920/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/920/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/920/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x562a9f09e3f4]
1: pnml2lts-mc(+0xa2496) [0x562a9f09e496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fa5542ea140]
3: pnml2lts-mc(+0x405be5) [0x562a9f401be5]
4: pnml2lts-mc(+0x16b3f9) [0x562a9f1673f9]
5: pnml2lts-mc(+0x164ac4) [0x562a9f160ac4]
6: pnml2lts-mc(+0x272e0a) [0x562a9f26ee0a]
7: pnml2lts-mc(+0xb61f0) [0x562a9f0b21f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fa55413d4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fa55413d67a]
10: pnml2lts-mc(+0xa1581) [0x562a9f09d581]
11: pnml2lts-mc(+0xa1910) [0x562a9f09d910]
12: pnml2lts-mc(+0xa32a2) [0x562a9f09f2a2]
13: pnml2lts-mc(+0xa50f4) [0x562a9f0a10f4]
14: pnml2lts-mc(+0xa516b) [0x562a9f0a116b]
15: pnml2lts-mc(+0x3f34b3) [0x562a9f3ef4b3]
16: pnml2lts-mc(+0x7c63d) [0x562a9f07863d]
17: pnml2lts-mc(+0x67d86) [0x562a9f063d86]
18: pnml2lts-mc(+0x60a8a) [0x562a9f05ca8a]
19: pnml2lts-mc(+0x5eb15) [0x562a9f05ab15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fa554125d0a]
21: pnml2lts-mc(+0x6075e) [0x562a9f05c75e]
ltl formula name Echo-PT-d02r09-LTLCardinality-01
ltl formula formula --ltl=/tmp/920/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 660 places, 570 transitions and 2957 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/920/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/920/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/920/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.010 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/920/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="Echo-PT-d02r09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Echo-PT-d02r09, 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 r169-tall-167838855300051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d02r09.tgz
mv Echo-PT-d02r09 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 ;