Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415800476.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Referendum-COL-0050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415800476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 25 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 4.9K 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 Referendum-COL-0050-00
FORMULA_NAME Referendum-COL-0050-01
FORMULA_NAME Referendum-COL-0050-02
FORMULA_NAME Referendum-COL-0050-03
FORMULA_NAME Referendum-COL-0050-04
FORMULA_NAME Referendum-COL-0050-05
FORMULA_NAME Referendum-COL-0050-06
FORMULA_NAME Referendum-COL-0050-07
FORMULA_NAME Referendum-COL-0050-08
FORMULA_NAME Referendum-COL-0050-09
FORMULA_NAME Referendum-COL-0050-10
FORMULA_NAME Referendum-COL-0050-11
FORMULA_NAME Referendum-COL-0050-12
FORMULA_NAME Referendum-COL-0050-13
FORMULA_NAME Referendum-COL-0050-14
FORMULA_NAME Referendum-COL-0050-15

=== Now, execution of the tool begins

BK_START 1621258962691

Running Version 0
[2021-05-17 13:42:45] [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-17 13:42:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 13:42:45] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-17 13:42:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 13:42:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 530 ms
[2021-05-17 13:42:45] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 151 PT places and 101.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA Referendum-COL-0050-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:42:45] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions in 3 ms.
[2021-05-17 13:42:45] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_18074280400731660627.dot
[2021-05-17 13:42:45] [INFO ] Initial state test concluded for 4 properties.
FORMULA Referendum-COL-0050-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0050-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0050-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0050-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100010 steps, including 1886 resets, run finished after 55 ms. (steps per millisecond=1818 ) properties (out of 18) seen :16
Running SMT prover for 2 properties.
// Phase 1: matrix 3 rows 4 cols
[2021-05-17 13:42:45] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-17 13:42:45] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2021-05-17 13:42:45] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 13:42:45] [INFO ] Flatten gal took : 17 ms
FORMULA Referendum-COL-0050-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0050-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:42:45] [INFO ] Flatten gal took : 1 ms
[2021-05-17 13:42:45] [INFO ] Unfolded HLPN to a Petri net with 151 places and 101 transitions in 1 ms.
[2021-05-17 13:42:45] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_1307012024313276376.dot
Support contains 151 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 13:42:46] [INFO ] Computed 50 place invariants in 9 ms
[2021-05-17 13:42:46] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 13:42:46] [INFO ] Computed 50 place invariants in 3 ms
[2021-05-17 13:42:46] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 13:42:46] [INFO ] Computed 50 place invariants in 13 ms
[2021-05-17 13:42:46] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 101/101 transitions.
[2021-05-17 13:42:46] [INFO ] Flatten gal took : 19 ms
[2021-05-17 13:42:46] [INFO ] Flatten gal took : 13 ms
[2021-05-17 13:42:46] [INFO ] Input system was already deterministic with 101 transitions.
Incomplete random walk after 100000 steps, including 1923 resets, run finished after 854 ms. (steps per millisecond=117 ) properties (out of 14) seen :12
Running SMT prover for 2 properties.
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 13:42:47] [INFO ] Computed 50 place invariants in 6 ms
[2021-05-17 13:42:47] [INFO ] [Real]Absence check using 50 positive place invariants in 4 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 50 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Graph (complete) has 150 edges and 151 vertex of which 101 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.2 ms
Discarding 50 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 12 ms. Remains 100 /151 variables (removed 51) and now considering 100/101 (removed 1) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-05-17 13:42:47] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:47] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-05-17 13:42:47] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:47] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2021-05-17 13:42:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-05-17 13:42:47] [INFO ] Computed 0 place invariants in 7 ms
[2021-05-17 13:42:47] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/151 places, 100/101 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0050-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49))], 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 50 steps with 0 reset in 2 ms.
FORMULA Referendum-COL-0050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-00 finished in 374 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 51 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 51 transition count 51
Applied a total of 150 rules in 2 ms. Remains 51 /151 variables (removed 100) and now considering 51/101 (removed 50) transitions.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:47] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:47] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:47] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:47] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:47] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:47] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/151 places, 51/101 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0050-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0050-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-02 finished in 236 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(!p0) U (G((p1&&F(p2)))&&X(F(!p0))))))], workingDir=/home/mcc/execution]
Support contains 101 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 13:42:48] [INFO ] Computed 50 place invariants in 3 ms
[2021-05-17 13:42:48] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 13:42:48] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-17 13:42:48] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 13:42:48] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-17 13:42:48] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2), (OR (NOT p2) (NOT p1)), p0, (OR (NOT p2) (NOT p1) p0), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : Referendum-COL-0050-04 automaton TGBA [mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p1 p0), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p1 p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50) s0), p0:(GT 1 (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100)), p2:(LEQ s0 (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 2 reset in 3 ms.
FORMULA Referendum-COL-0050-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-04 finished in 759 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 101 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 13:42:48] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-17 13:42:48] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 13:42:48] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-17 13:42:48] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 151 cols
[2021-05-17 13:42:48] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-17 13:42:48] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 792 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Referendum-COL-0050-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50) (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100)), p1:(GT s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 3 ms.
FORMULA Referendum-COL-0050-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-06 finished in 1006 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 100 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 101 transition count 101
Applied a total of 50 rules in 29 ms. Remains 101 /151 variables (removed 50) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 101 cols
[2021-05-17 13:42:49] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:49] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2021-05-17 13:42:49] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:50] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 101 cols
[2021-05-17 13:42:50] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:51] [INFO ] Dead Transitions using invariants and state equation in 1091 ms returned []
Finished structural reductions, in 1 iterations. Remains : 101/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0050-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2810 reset in 889 ms.
Product exploration explored 100000 steps with 2816 reset in 954 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 101 transition count 101
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 : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Referendum-COL-0050-09 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-COL-0050-09 finished in 3440 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((G(p0) U p1)))))], workingDir=/home/mcc/execution]
Support contains 100 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 101 transition count 101
Applied a total of 50 rules in 1 ms. Remains 101 /151 variables (removed 50) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 101 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:53] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:53] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 101 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:53] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 101/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-COL-0050-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50)), p0:(LEQ 2 (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0050-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-10 finished in 364 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Graph (complete) has 150 edges and 151 vertex of which 51 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.1 ms
Discarding 100 places :
Also discarding 0 output transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 51 transition count 51
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 100 place count 2 transition count 2
Iterating global reduction 1 with 49 rules applied. Total rules applied 149 place count 2 transition count 2
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 150 place count 2 transition count 1
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 1 transition count 1
Applied a total of 151 rules in 5 ms. Remains 1 /151 variables (removed 150) and now considering 1/101 (removed 100) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:53] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:53] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-17 13:42:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:53] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/151 places, 1/101 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0050-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s0)], 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 1 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0050-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-11 finished in 112 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 51 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Graph (complete) has 150 edges and 151 vertex of which 51 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.1 ms
Discarding 100 places :
Also discarding 0 output transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 51 transition count 51
Applied a total of 51 rules in 2 ms. Remains 51 /151 variables (removed 100) and now considering 51/101 (removed 50) transitions.
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:53] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:42:53] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2021-05-17 13:42:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 51 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:53] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/151 places, 51/101 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0050-13 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:(GT s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50))], 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 51 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0050-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-13 finished in 156 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 51 out of 151 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 151/151 places, 101/101 transitions.
Graph (complete) has 150 edges and 151 vertex of which 101 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 101
Applied a total of 2 rules in 8 ms. Remains 101 /151 variables (removed 50) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 101 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:53] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:53] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2021-05-17 13:42:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2021-05-17 13:42:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:53] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 101/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0050-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50) s0)], 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 1942 reset in 726 ms.
Product exploration explored 100000 steps with 1942 reset in 636 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 101 transition count 101
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 : [(F (OR (G p0) (G (NOT p0)))), (NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1941 reset in 460 ms.
Product exploration explored 100000 steps with 1941 reset in 455 ms.
[2021-05-17 13:42:56] [INFO ] Flatten gal took : 8 ms
[2021-05-17 13:42:56] [INFO ] Flatten gal took : 9 ms
[2021-05-17 13:42:56] [INFO ] Time to serialize gal into /tmp/LTL13736270324902642787.gal : 1 ms
[2021-05-17 13:42:56] [INFO ] Time to serialize properties into /tmp/LTL13070495293411726542.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/LTL13736270324902642787.gal, -t, CGAL, -LTL, /tmp/LTL13070495293411726542.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/LTL13736270324902642787.gal -t CGAL -LTL /tmp/LTL13070495293411726542.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((((((((((((((((((((((((((((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)+voted_yes_21)+voted_yes_22)+voted_yes_23)+voted_yes_24)+voted_yes_25)+voted_yes_26)+voted_yes_27)+voted_yes_28)+voted_yes_29)+voted_yes_30)+voted_yes_31)+voted_yes_32)+voted_yes_33)+voted_yes_34)+voted_yes_35)+voted_yes_36)+voted_yes_37)+voted_yes_38)+voted_yes_39)+voted_yes_40)+voted_yes_41)+voted_yes_42)+voted_yes_43)+voted_yes_44)+voted_yes_45)+voted_yes_46)+voted_yes_47)+voted_yes_48)+voted_yes_49)>ready_0)"))))
Formula 0 simplified : !FG"((((((((((((((((((((((((((((((((((((((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)+voted_yes_21)+voted_yes_22)+voted_yes_23)+voted_yes_24)+voted_yes_25)+voted_yes_26)+voted_yes_27)+voted_yes_28)+voted_yes_29)+voted_yes_30)+voted_yes_31)+voted_yes_32)+voted_yes_33)+voted_yes_34)+voted_yes_35)+voted_yes_36)+voted_yes_37)+voted_yes_38)+voted_yes_39)+voted_yes_40)+voted_yes_41)+voted_yes_42)+voted_yes_43)+voted_yes_44)+voted_yes_45)+voted_yes_46)+voted_yes_47)+voted_yes_48)+voted_yes_49)>ready_0)"
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t0.t1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/51/50/101
Computing Next relation with stutter on 1.1259e+15 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
177 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,1.81444,54192,1,0,761,158221,232,560,4964,277003,1286
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-COL-0050-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-COL-0050-14 finished in 5042 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621258979456

--------------------
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="Referendum-COL-0050"
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 Referendum-COL-0050, 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 r178-tajo-162089415800476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0050.tgz
mv Referendum-COL-0050 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 ;