Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 8.6K Apr 29 14:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 29 14:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 14:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 14:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.8K May 10 09:34 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-0020-LTLCardinality-00
FORMULA_NAME Referendum-COL-0020-LTLCardinality-01
FORMULA_NAME Referendum-COL-0020-LTLCardinality-02
FORMULA_NAME Referendum-COL-0020-LTLCardinality-03
FORMULA_NAME Referendum-COL-0020-LTLCardinality-04
FORMULA_NAME Referendum-COL-0020-LTLCardinality-05
FORMULA_NAME Referendum-COL-0020-LTLCardinality-06
FORMULA_NAME Referendum-COL-0020-LTLCardinality-07
FORMULA_NAME Referendum-COL-0020-LTLCardinality-08
FORMULA_NAME Referendum-COL-0020-LTLCardinality-09
FORMULA_NAME Referendum-COL-0020-LTLCardinality-10
FORMULA_NAME Referendum-COL-0020-LTLCardinality-11
FORMULA_NAME Referendum-COL-0020-LTLCardinality-12
FORMULA_NAME Referendum-COL-0020-LTLCardinality-13
FORMULA_NAME Referendum-COL-0020-LTLCardinality-14
FORMULA_NAME Referendum-COL-0020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653082997243

Running Version 202205111006
[2022-05-20 21:43:18] [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-20 21:43:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:43:18] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-20 21:43:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 21:43:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 576 ms
[2022-05-20 21:43:19] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 61 PT places and 41.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 21:43:19] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 10 ms.
[2022-05-20 21:43:19] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Referendum-COL-0020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0020-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0020-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0020-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0020-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10004 steps, including 434 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:19] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-20 21:43:19] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-05-20 21:43:19] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA Referendum-COL-0020-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 21:43:19] [INFO ] Flatten gal took : 19 ms
[2022-05-20 21:43:19] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [3:1*[0]] contains constants of sort Voters
Arc [3:1*[1]] contains constants of sort Voters
Arc [3:1*[2]] contains constants of sort Voters
Arc [3:1*[3]] contains constants of sort Voters
Arc [3:1*[4]] contains constants of sort Voters
Arc [3:1*[5]] contains constants of sort Voters
Arc [3:1*[6]] contains constants of sort Voters
Arc [3:1*[7]] contains constants of sort Voters
Arc [3:1*[8]] contains constants of sort Voters
Arc [3:1*[9]] contains constants of sort Voters
Arc [3:1*[10]] contains constants of sort Voters
Arc [3:1*[11]] contains constants of sort Voters
Arc [3:1*[12]] contains constants of sort Voters
Arc [3:1*[13]] contains constants of sort Voters
Arc [3:1*[14]] contains constants of sort Voters
Arc [3:1*[15]] contains constants of sort Voters
Arc [3:1*[16]] contains constants of sort Voters
Arc [3:1*[17]] contains constants of sort Voters
Arc [3:1*[18]] contains constants of sort Voters
Arc [3:1*[19]] contains constants of sort Voters
Transition start : constants on arcs in [[3:1*[0]], [3:1*[1]], [3:1*[2]], [3:1*[3]], [3:1*[4]], [3:1*[5]], [3:1*[6]], [3:1*[7]], [3:1*[8]], [3:1*[9]], [3:1*[10]], [3:1*[11]], [3:1*[12]], [3:1*[13]], [3:1*[14]], [3:1*[15]], [3:1*[16]], [3:1*[17]], [3:1*[18]], [3:1*[19]]] introduces in Voters(20) partition with 1 elements that refines current partition to 1 subsets.
Symmetric sort wr.t. initial detected :Voters
Symmetric sort wr.t. initial and guards detected :Voters
Applying symmetric unfolding of full symmetric sort :Voters domain size was 20
[2022-05-20 21:43:20] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 7 ms.
[2022-05-20 21:43:20] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 5 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:43:20] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:43:20] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:20] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-20 21:43:20] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Support contains 4 out of 4 places after structural reductions.
[2022-05-20 21:43:20] [INFO ] Flatten gal took : 2 ms
[2022-05-20 21:43:20] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:43:20] [INFO ] Input system was already deterministic with 3 transitions.
Incomplete random walk after 10004 steps, including 434 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:43:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-20 21:43:20] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Referendum-COL-0020-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 4 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:43:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:43:20] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:43:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:43:20] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-20 21:43:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:43:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:43:20] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-01 automaton TGBA Formula[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 1 s0)], 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 20 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0020-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-LTLCardinality-01 finished in 329 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||!(!p1 U !p0))&&(!(F(p2) U p2)||F(p3))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:43:20] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:20] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-20 21:43:20] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-20 21:43:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:43:20] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND p2 (NOT p3))), (NOT p0), (NOT p3), (AND (NOT p3) p2)]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s3 s1), p2:(LEQ s1 s0), p3:(GT 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
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 : [(AND (NOT p0) p2 p3), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p0)), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3)))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 10 factoid took 211 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0020-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0020-LTLCardinality-03 finished in 852 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:43:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:43:21] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:43:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:43:21] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-20 21:43:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:43:21] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:43:21] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-04 automaton TGBA Formula[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 3 s0)], 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 20 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0020-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-LTLCardinality-04 finished in 125 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(p0)))&&X(p1)))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:43:21] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:43:21] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:43:21] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ s3 s2), p1:(GT 3 s1)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 6431 reset in 134 ms.
Product exploration explored 100000 steps with 6431 reset in 205 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
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 : [(AND p0 p1), (X p1), true, (X (X (NOT p0))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 6 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0020-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0020-LTLCardinality-08 finished in 669 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(X(G(p0)))))))'
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 2 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:43:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:43:22] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:43:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:43:22] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2022-05-20 21:43:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:43:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:43:22] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s1)], 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 4545 reset in 48 ms.
Product exploration explored 100000 steps with 4545 reset in 52 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
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 (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0020-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0020-LTLCardinality-09 finished in 279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0)&&G(p1)&&p2))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:43:22] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:43:22] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-20 21:43:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:43:22] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 40 ms :[(OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s1), p1:(LEQ 3 s2), p2:(LEQ s2 s3)], 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 21 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0020-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-LTLCardinality-11 finished in 108 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:43:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:43:22] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:43:22] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:43:22] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:43:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:43:22] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0020-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:(GT 3 s1)], 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 49 ms.
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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 75 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0020-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0020-LTLCardinality-12 finished in 323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(p0)||F(G(F(p1)))||p2))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:43:23] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:43:23] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:43:23] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p2:(LEQ 1 s2), p0:(OR (LEQ s2 s0) (LEQ s1 s0)), p1:(GT 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25001 reset in 54 ms.
Product exploration explored 100000 steps with 24974 reset in 67 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
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 : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10004 steps, including 434 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:43:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:43:23] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:43:23] [INFO ] After 37ms 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 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F p2), (F (AND (NOT p2) (NOT p1) p0))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))
Knowledge based reduction with 8 factoid took 291 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0020-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0020-LTLCardinality-14 finished in 1112 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!G(F(!p0))) U !(G(F(p0))&&X(!p0)))))'
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 0 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:43:24] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:43:24] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:43:24] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:43:24] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:43:24] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:43:24] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 119 ms :[false, false, false, false]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 8064 reset in 105 ms.
Product exploration explored 100000 steps with 8069 reset in 77 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0020-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0020-LTLCardinality-15 finished in 536 ms.
All properties solved by simple procedures.
Total runtime 6175 ms.

BK_STOP 1653083005158

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="Referendum-COL-0020"
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-0020, 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 r186-tajo-165281572100347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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