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.r327-tall-167889199600412.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 lolaxred
Input is Referendum-COL-0015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199600412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.4K Feb 26 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 17:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 17:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 17:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 17:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7K Mar 5 18:23 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-0015-LTLFireability-00
FORMULA_NAME Referendum-COL-0015-LTLFireability-01
FORMULA_NAME Referendum-COL-0015-LTLFireability-02
FORMULA_NAME Referendum-COL-0015-LTLFireability-03
FORMULA_NAME Referendum-COL-0015-LTLFireability-04
FORMULA_NAME Referendum-COL-0015-LTLFireability-05
FORMULA_NAME Referendum-COL-0015-LTLFireability-06
FORMULA_NAME Referendum-COL-0015-LTLFireability-07
FORMULA_NAME Referendum-COL-0015-LTLFireability-08
FORMULA_NAME Referendum-COL-0015-LTLFireability-09
FORMULA_NAME Referendum-COL-0015-LTLFireability-10
FORMULA_NAME Referendum-COL-0015-LTLFireability-11
FORMULA_NAME Referendum-COL-0015-LTLFireability-12
FORMULA_NAME Referendum-COL-0015-LTLFireability-13
FORMULA_NAME Referendum-COL-0015-LTLFireability-14
FORMULA_NAME Referendum-COL-0015-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679048929851

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-COL-0015
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 10:28:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 10:28:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 10:28:51] [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.
[2023-03-17 10:28:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 10:28:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 366 ms
[2023-03-17 10:28:51] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 46 PT places and 31.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-17 10:28:51] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 4 ms.
[2023-03-17 10:28:51] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Referendum-COL-0015-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-LTLFireability-15 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 3 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).
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=0 )
[2023-03-17 10:28:51] [INFO ] Flatten gal took : 11 ms
[2023-03-17 10:28:51] [INFO ] Flatten gal took : 7 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [0:1*[0]] contains constants of sort Voters
Arc [0:1*[1]] contains constants of sort Voters
Arc [0:1*[2]] contains constants of sort Voters
Arc [0:1*[3]] contains constants of sort Voters
Arc [0:1*[4]] contains constants of sort Voters
Arc [0:1*[5]] contains constants of sort Voters
Arc [0:1*[6]] contains constants of sort Voters
Arc [0:1*[7]] contains constants of sort Voters
Arc [0:1*[8]] contains constants of sort Voters
Arc [0:1*[9]] contains constants of sort Voters
Arc [0:1*[10]] contains constants of sort Voters
Arc [0:1*[11]] contains constants of sort Voters
Arc [0:1*[12]] contains constants of sort Voters
Arc [0:1*[13]] contains constants of sort Voters
Arc [0:1*[14]] contains constants of sort Voters
Transition start : constants on arcs in [[0:1*[0]], [0:1*[1]], [0:1*[2]], [0:1*[3]], [0:1*[4]], [0:1*[5]], [0:1*[6]], [0:1*[7]], [0:1*[8]], [0:1*[9]], [0:1*[10]], [0:1*[11]], [0:1*[12]], [0:1*[13]], [0:1*[14]]] introduces in Voters(15) 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 15
[2023-03-17 10:28:51] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 5 ms.
[2023-03-17 10:28:51] [INFO ] Unfolded 9 HLPN properties in 0 ms.
FORMULA Referendum-COL-0015-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 7 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-17 10:28:51] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-17 10:28:52] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-17 10:28:52] [INFO ] Invariant cache hit.
[2023-03-17 10:28:52] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-17 10:28:52] [INFO ] Invariant cache hit.
[2023-03-17 10:28:52] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 2/4 places, 2/3 transitions.
Support contains 2 out of 2 places after structural reductions.
[2023-03-17 10:28:52] [INFO ] Flatten gal took : 1 ms
[2023-03-17 10:28:52] [INFO ] Flatten gal took : 2 ms
[2023-03-17 10:28:52] [INFO ] Input system was already deterministic with 2 transitions.
Incomplete random walk after 10007 steps, including 555 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 23 ms. (steps per millisecond=435 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 10:28:52] [INFO ] Invariant cache hit.
[2023-03-17 10:28:53] [INFO ] After 965ms 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 8 simplifications.
FORMULA Referendum-COL-0015-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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).
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)&&X(F(p1)))))'
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-17 10:28:53] [INFO ] Invariant cache hit.
[2023-03-17 10:28:53] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 10:28:53] [INFO ] Invariant cache hit.
[2023-03-17 10:28:53] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-17 10:28:53] [INFO ] Invariant cache hit.
[2023-03-17 10:28:53] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-COL-0015-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s1 1) (GEQ s0 1)), p1:(GEQ s1 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 2 ms.
FORMULA Referendum-COL-0015-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-LTLFireability-00 finished in 387 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((G(!p0)||F(p1)))||F(G(!p0))))'
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 4 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-17 10:28:53] [INFO ] Invariant cache hit.
[2023-03-17 10:28:53] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 10:28:53] [INFO ] Invariant cache hit.
[2023-03-17 10:28:53] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-17 10:28:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:28:53] [INFO ] Invariant cache hit.
[2023-03-17 10:28:53] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Referendum-COL-0015-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1), p1:(LT s0 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 5882 reset in 151 ms.
Product exploration explored 100000 steps with 5882 reset in 78 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 : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 7 factoid took 141 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0015-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0015-LTLFireability-02 finished in 560 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((X(!p0)||(p0&&F(p1))))||G(p0)))'
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-17 10:28:54] [INFO ] Invariant cache hit.
[2023-03-17 10:28:54] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-17 10:28:54] [INFO ] Invariant cache hit.
[2023-03-17 10:28:54] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-17 10:28:54] [INFO ] Invariant cache hit.
[2023-03-17 10:28:54] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1)), false, false]
Running random walk in product with property : Referendum-COL-0015-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}]], initial=4, aps=[p0:(GEQ s1 1), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5882 reset in 142 ms.
Product exploration explored 100000 steps with 5882 reset in 85 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 : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 463 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, p0, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10007 steps, including 555 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 7 ms. (steps per millisecond=1429 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 10:28:55] [INFO ] Invariant cache hit.
[2023-03-17 10:28:55] [INFO ] After 22ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 13 factoid took 551 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[true, false, p0]
Stuttering acceptance computed with spot in 81 ms :[true, false, p0]
Support contains 1 out of 2 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 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-17 10:28:56] [INFO ] Invariant cache hit.
[2023-03-17 10:28:56] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-17 10:28:56] [INFO ] Invariant cache hit.
[2023-03-17 10:28:56] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-17 10:28:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:28:56] [INFO ] Invariant cache hit.
[2023-03-17 10:28:56] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56 ms. Remains : 2/2 places, 2/2 transitions.
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)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[true, false, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[true, false, p0]
Stuttering acceptance computed with spot in 74 ms :[true, false, p0]
Stuttering acceptance computed with spot in 85 ms :[true, false, p0]
Product exploration explored 100000 steps with 5882 reset in 75 ms.
Product exploration explored 100000 steps with 5882 reset in 77 ms.
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Graph (complete) has 1 edges and 2 vertex of which 1 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 2 ms. Remains 1 /2 variables (removed 1) and now considering 1/2 (removed 1) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-17 10:28:57] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:28:57] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 10:28:57] [INFO ] Invariant cache hit.
[2023-03-17 10:28:57] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-17 10:28:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:28:57] [INFO ] Invariant cache hit.
[2023-03-17 10:28:57] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/2 places, 1/2 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 1/2 places, 1/2 transitions.
Treatment of property Referendum-COL-0015-LTLFireability-03 finished in 2907 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(G((p0||(G(!p0)&&F(p1))))))'
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-17 10:28:57] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:28:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 10:28:57] [INFO ] Invariant cache hit.
[2023-03-17 10:28:57] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-17 10:28:57] [INFO ] Invariant cache hit.
[2023-03-17 10:28:57] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 1264 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0, (NOT p1), true]
Running random walk in product with property : Referendum-COL-0015-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s1 1), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9764 reset in 126 ms.
Product exploration explored 100000 steps with 9657 reset in 83 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 : [(AND p0 p1), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 283 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, p0, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 346 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 100 ms :[true, p0, p0, p0]
[2023-03-17 10:28:59] [INFO ] Invariant cache hit.
[2023-03-17 10:28:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:28:59] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-17 10:28:59] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 10:28:59] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 2 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-17 10:28:59] [INFO ] Invariant cache hit.
[2023-03-17 10:28:59] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 10:28:59] [INFO ] Invariant cache hit.
[2023-03-17 10:28:59] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-17 10:28:59] [INFO ] Invariant cache hit.
[2023-03-17 10:28:59] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 2/2 places, 2/2 transitions.
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, p0, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 121 ms :[true, p0, p0, p0]
[2023-03-17 10:29:00] [INFO ] Invariant cache hit.
[2023-03-17 10:29:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:29:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-17 10:29:00] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-17 10:29:00] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 107 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 5882 reset in 43 ms.
Product exploration explored 100000 steps with 5882 reset in 36 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 113 ms :[true, p0, p0, p0]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Graph (complete) has 1 edges and 2 vertex of which 1 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /2 variables (removed 1) and now considering 1/2 (removed 1) transitions.
[2023-03-17 10:29:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2023-03-17 10:29:01] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:29:01] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/2 places, 1/2 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33 ms. Remains : 1/2 places, 1/2 transitions.
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-17 10:29:01] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:29:01] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 10:29:01] [INFO ] Invariant cache hit.
[2023-03-17 10:29:01] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-17 10:29:01] [INFO ] Invariant cache hit.
[2023-03-17 10:29:01] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 2/2 places, 2/2 transitions.
Treatment of property Referendum-COL-0015-LTLFireability-04 finished in 3939 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(!p0))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-17 10:29:01] [INFO ] Invariant cache hit.
[2023-03-17 10:29:01] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-17 10:29:01] [INFO ] Invariant cache hit.
[2023-03-17 10:29:01] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-17 10:29:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:29:01] [INFO ] Invariant cache hit.
[2023-03-17 10:29:01] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 46 ms :[p0]
Running random walk in product with property : Referendum-COL-0015-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 34 ms.
Product exploration explored 100000 steps with 50000 reset in 87 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 :(X (NOT p0))
Knowledge based reduction with 4 factoid took 64 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0015-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0015-LTLFireability-07 finished in 338 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((!p0||G((!p0 U X(!p0))))))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-17 10:29:01] [INFO ] Invariant cache hit.
[2023-03-17 10:29:01] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-17 10:29:01] [INFO ] Invariant cache hit.
[2023-03-17 10:29:01] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2023-03-17 10:29:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:29:01] [INFO ] Invariant cache hit.
[2023-03-17 10:29:01] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 59 ms :[p0]
Running random walk in product with property : Referendum-COL-0015-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 59 ms.
Product exploration explored 100000 steps with 50000 reset in 51 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 :(X (NOT p0))
Knowledge based reduction with 4 factoid took 62 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0015-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0015-LTLFireability-12 finished in 326 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((X(!p0)||(p0&&F(p1))))||G(p0)))'
Found a Lengthening insensitive property : Referendum-COL-0015-LTLFireability-03
Stuttering acceptance computed with spot in 164 ms :[true, (OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1)), false, false]
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-17 10:29:02] [INFO ] Invariant cache hit.
[2023-03-17 10:29:02] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 10:29:02] [INFO ] Invariant cache hit.
[2023-03-17 10:29:02] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-17 10:29:02] [INFO ] Invariant cache hit.
[2023-03-17 10:29:02] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 69 ms. Remains : 2/2 places, 2/2 transitions.
Running random walk in product with property : Referendum-COL-0015-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}]], initial=4, aps=[p0:(GEQ s1 1), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5882 reset in 50 ms.
Product exploration explored 100000 steps with 5882 reset in 46 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 : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 867 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, p0, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10007 steps, including 555 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 10:29:03] [INFO ] Invariant cache hit.
[2023-03-17 10:29:03] [INFO ] After 25ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 13 factoid took 401 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[true, false, p0]
Stuttering acceptance computed with spot in 67 ms :[true, false, p0]
Support contains 1 out of 2 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 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-17 10:29:03] [INFO ] Invariant cache hit.
[2023-03-17 10:29:03] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-17 10:29:03] [INFO ] Invariant cache hit.
[2023-03-17 10:29:03] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-17 10:29:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:29:03] [INFO ] Invariant cache hit.
[2023-03-17 10:29:03] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 2/2 places, 2/2 transitions.
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)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 269 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[true, false, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[true, false, p0]
Stuttering acceptance computed with spot in 85 ms :[true, false, p0]
Stuttering acceptance computed with spot in 82 ms :[true, false, p0]
Product exploration explored 100000 steps with 5882 reset in 36 ms.
Product exploration explored 100000 steps with 5882 reset in 35 ms.
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Graph (complete) has 1 edges and 2 vertex of which 1 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /2 variables (removed 1) and now considering 1/2 (removed 1) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-17 10:29:04] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-17 10:29:04] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 10:29:04] [INFO ] Invariant cache hit.
[2023-03-17 10:29:04] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-17 10:29:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:29:04] [INFO ] Invariant cache hit.
[2023-03-17 10:29:05] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/2 places, 1/2 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 1/2 places, 1/2 transitions.
Treatment of property Referendum-COL-0015-LTLFireability-03 finished in 3157 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(G((p0||(G(!p0)&&F(p1))))))'
Found a Lengthening insensitive property : Referendum-COL-0015-LTLFireability-04
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0, (NOT p1), true]
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-17 10:29:05] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 10:29:05] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 10:29:05] [INFO ] Invariant cache hit.
[2023-03-17 10:29:05] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-17 10:29:05] [INFO ] Invariant cache hit.
[2023-03-17 10:29:05] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 59 ms. Remains : 2/2 places, 2/2 transitions.
Running random walk in product with property : Referendum-COL-0015-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s1 1), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9851 reset in 46 ms.
Product exploration explored 100000 steps with 9739 reset in 38 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 : [(AND p0 p1), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 319 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, p0, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 321 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 121 ms :[true, p0, p0, p0]
[2023-03-17 10:29:06] [INFO ] Invariant cache hit.
[2023-03-17 10:29:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:29:06] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-17 10:29:06] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 10:29:06] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 2 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-17 10:29:06] [INFO ] Invariant cache hit.
[2023-03-17 10:29:06] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 10:29:06] [INFO ] Invariant cache hit.
[2023-03-17 10:29:06] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-17 10:29:06] [INFO ] Invariant cache hit.
[2023-03-17 10:29:06] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 2/2 places, 2/2 transitions.
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, p0, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 115 ms :[true, p0, p0, p0]
[2023-03-17 10:29:07] [INFO ] Invariant cache hit.
[2023-03-17 10:29:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:29:07] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-17 10:29:07] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-17 10:29:07] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 224 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 5882 reset in 41 ms.
Product exploration explored 100000 steps with 5882 reset in 44 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 127 ms :[true, p0, p0, p0]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Graph (complete) has 1 edges and 2 vertex of which 1 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /2 variables (removed 1) and now considering 1/2 (removed 1) transitions.
[2023-03-17 10:29:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2023-03-17 10:29:07] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 10:29:07] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/2 places, 1/2 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30 ms. Remains : 1/2 places, 1/2 transitions.
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-17 10:29:07] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:29:07] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 10:29:07] [INFO ] Invariant cache hit.
[2023-03-17 10:29:07] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-17 10:29:07] [INFO ] Invariant cache hit.
[2023-03-17 10:29:07] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 2/2 places, 2/2 transitions.
Treatment of property Referendum-COL-0015-LTLFireability-04 finished in 2875 ms.
[2023-03-17 10:29:07] [INFO ] Flatten gal took : 1 ms
[2023-03-17 10:29:07] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-17 10:29:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2 places, 2 transitions and 3 arcs took 0 ms.
Total runtime 16611 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Referendum-COL-0015
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA Referendum-COL-0015-LTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0015-LTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679048949258

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 Referendum-COL-0015-LTLFireability-03
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Referendum-COL-0015-LTLFireability-03
lola: result : true
lola: markings : 92
lola: fired transitions : 139
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 Referendum-COL-0015-LTLFireability-04
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for Referendum-COL-0015-LTLFireability-04
lola: result : true
lola: markings : 47
lola: fired transitions : 77
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Referendum-COL-0015-LTLFireability-03: LTL true LTL model checker
Referendum-COL-0015-LTLFireability-04: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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-0015"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Referendum-COL-0015, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r327-tall-167889199600412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0015.tgz
mv Referendum-COL-0015 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;