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.r325-tall-167889197200412.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 itstools
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 r325-tall-167889197200412
=====================================================================

--------------------
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 1679011088631

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-COL-0015
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-16 23:58:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 23:58:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 23:58:10] [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-16 23:58:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 23:58:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 383 ms
[2023-03-16 23:58:10] [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-16 23:58:10] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 4 ms.
[2023-03-16 23:58:10] [INFO ] Skeletonized 16 HLPN properties in 2 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-16 23:58:10] [INFO ] Flatten gal took : 11 ms
[2023-03-16 23:58:10] [INFO ] Flatten gal took : 1 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-16 23:58:10] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 9 ms.
[2023-03-16 23:58:10] [INFO ] Unfolded 9 HLPN properties in 1 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 10 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 23:58:11] [INFO ] Computed 0 place invariants in 8 ms
[2023-03-16 23:58:11] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-16 23:58:11] [INFO ] Invariant cache hit.
[2023-03-16 23:58:11] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-16 23:58:11] [INFO ] Invariant cache hit.
[2023-03-16 23:58:11] [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 187 ms. Remains : 2/4 places, 2/3 transitions.
Support contains 2 out of 2 places after structural reductions.
[2023-03-16 23:58:11] [INFO ] Flatten gal took : 2 ms
[2023-03-16 23:58:11] [INFO ] Flatten gal took : 2 ms
[2023-03-16 23:58:11] [INFO ] Input system was already deterministic with 2 transitions.
Incomplete random walk after 10007 steps, including 555 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 23:58:11] [INFO ] Invariant cache hit.
[2023-03-16 23:58:11] [INFO ] After 41ms 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 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-16 23:58:11] [INFO ] Invariant cache hit.
[2023-03-16 23:58:11] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-16 23:58:11] [INFO ] Invariant cache hit.
[2023-03-16 23:58:11] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-16 23:58:11] [INFO ] Invariant cache hit.
[2023-03-16 23:58:11] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 2089 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 3 ms.
FORMULA Referendum-COL-0015-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-LTLFireability-00 finished in 2226 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 2 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-16 23:58:13] [INFO ] Invariant cache hit.
[2023-03-16 23:58:13] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-16 23:58:13] [INFO ] Invariant cache hit.
[2023-03-16 23:58:13] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-16 23:58:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 23:58:13] [INFO ] Invariant cache hit.
[2023-03-16 23:58:13] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 88 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 193 ms.
Product exploration explored 100000 steps with 5882 reset in 86 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 172 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 689 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-16 23:58:14] [INFO ] Invariant cache hit.
[2023-03-16 23:58:14] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-16 23:58:14] [INFO ] Invariant cache hit.
[2023-03-16 23:58:14] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-16 23:58:14] [INFO ] Invariant cache hit.
[2023-03-16 23:58:14] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 220 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 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 : [(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 509 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 131 ms :[true, p0, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10007 steps, including 555 resets, run finished after 11 ms. (steps per millisecond=909 ) 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-16 23:58:15] [INFO ] Invariant cache hit.
[2023-03-16 23:58:15] [INFO ] After 31ms 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 549 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 68 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 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-16 23:58:16] [INFO ] Invariant cache hit.
[2023-03-16 23:58:16] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-16 23:58:16] [INFO ] Invariant cache hit.
[2023-03-16 23:58:16] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-16 23:58:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 23:58:16] [INFO ] Invariant cache hit.
[2023-03-16 23:58:16] [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 64 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 199 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 83 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 329 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 79 ms :[true, false, p0]
Stuttering acceptance computed with spot in 73 ms :[true, false, p0]
Stuttering acceptance computed with spot in 75 ms :[true, false, p0]
Product exploration explored 100000 steps with 5882 reset in 45 ms.
Product exploration explored 100000 steps with 5882 reset in 56 ms.
Built C files in :
/tmp/ltsmin10485498113393680981
[2023-03-16 23:58:17] [INFO ] Computing symmetric may disable matrix : 2 transitions.
[2023-03-16 23:58:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 23:58:17] [INFO ] Computing symmetric may enable matrix : 2 transitions.
[2023-03-16 23:58:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 23:58:17] [INFO ] Computing Do-Not-Accords matrix : 2 transitions.
[2023-03-16 23:58:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 23:58:17] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10485498113393680981
Running compilation step : cd /tmp/ltsmin10485498113393680981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 141 ms.
Running link step : cd /tmp/ltsmin10485498113393680981;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10485498113393680981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9256642444697520720.hoa' '--buchi-type=spotba'
LTSmin run took 84 ms.
FORMULA Referendum-COL-0015-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Referendum-COL-0015-LTLFireability-03 finished in 3317 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 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-16 23:58:17] [INFO ] Invariant cache hit.
[2023-03-16 23:58:17] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-16 23:58:17] [INFO ] Invariant cache hit.
[2023-03-16 23:58:17] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-16 23:58:17] [INFO ] Invariant cache hit.
[2023-03-16 23:58:17] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 140 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 9856 reset in 68 ms.
Product exploration explored 100000 steps with 9744 reset in 79 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 366 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 108 ms :[true, p0, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
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 382 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 132 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 104 ms :[true, p0, p0, p0]
[2023-03-16 23:58:19] [INFO ] Invariant cache hit.
[2023-03-16 23:58:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 23:58:19] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-16 23:58:19] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-16 23:58:19] [INFO ] Added : 0 causal constraints over 0 iterations in 3 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-16 23:58:19] [INFO ] Invariant cache hit.
[2023-03-16 23:58:19] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-16 23:58:19] [INFO ] Invariant cache hit.
[2023-03-16 23:58:19] [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.
[2023-03-16 23:58:19] [INFO ] Invariant cache hit.
[2023-03-16 23:58:19] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 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 114 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 197 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 159 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 112 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 118 ms :[true, p0, p0, p0]
[2023-03-16 23:58:20] [INFO ] Invariant cache hit.
[2023-03-16 23:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 23:58:20] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-16 23:58:20] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-16 23:58:20] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 118 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 5882 reset in 39 ms.
Product exploration explored 100000 steps with 5882 reset in 48 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 103 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.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 4 ms. Remains 1 /2 variables (removed 1) and now considering 1/2 (removed 1) transitions.
[2023-03-16 23:58:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2023-03-16 23:58:20] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-16 23:58:20] [INFO ] Dead Transitions using invariants and state equation in 24 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 38 ms. Remains : 1/2 places, 1/2 transitions.
Built C files in :
/tmp/ltsmin15316863484528795209
[2023-03-16 23:58:20] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15316863484528795209
Running compilation step : cd /tmp/ltsmin15316863484528795209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 79 ms.
Running link step : cd /tmp/ltsmin15316863484528795209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin15316863484528795209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17761952412815733656.hoa' '--buchi-type=spotba'
LTSmin run took 283 ms.
FORMULA Referendum-COL-0015-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Referendum-COL-0015-LTLFireability-04 finished in 3225 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.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 23:58:21] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-16 23:58:21] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-16 23:58:21] [INFO ] Invariant cache hit.
[2023-03-16 23:58:21] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-16 23:58:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 23:58:21] [INFO ] Invariant cache hit.
[2023-03-16 23:58:21] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 42 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 45 ms.
Product exploration explored 100000 steps with 50000 reset in 45 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 71 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 310 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 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-16 23:58:21] [INFO ] Invariant cache hit.
[2023-03-16 23:58:21] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-16 23:58:21] [INFO ] Invariant cache hit.
[2023-03-16 23:58:21] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-16 23:58:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 23:58:21] [INFO ] Invariant cache hit.
[2023-03-16 23:58:21] [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 57 ms. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 33 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 38 ms.
Product exploration explored 100000 steps with 50000 reset in 42 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 76 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 282 ms.
All properties solved by simple procedures.
Total runtime 11324 ms.

BK_STOP 1679011102903

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="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-5348"
echo " Executing tool itstools"
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 r325-tall-167889197200412"
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 ;