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.r263-smll-167863538300476.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 PermAdmissibility-COL-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538300476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.1K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 01:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 01:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 01:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 54K 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 PermAdmissibility-COL-05-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678796795294

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=PermAdmissibility-COL-05
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 12:26:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 12:26:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:26:38] [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-14 12:26:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 12:26:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 917 ms
[2023-03-14 12:26:39] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 12:26:39] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 7 ms.
[2023-03-14 12:26:39] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PermAdmissibility-COL-05-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
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 85 steps, including 0 resets, run visited all 17 properties in 27 ms. (steps per millisecond=3 )
[2023-03-14 12:26:39] [INFO ] Flatten gal took : 31 ms
[2023-03-14 12:26:39] [INFO ] Flatten gal took : 10 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2023-03-14 12:26:39] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 15 ms.
[2023-03-14 12:26:39] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Support contains 30 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 13 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2023-03-14 12:26:40] [INFO ] Computed 16 place invariants in 12 ms
[2023-03-14 12:26:40] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-14 12:26:40] [INFO ] Invariant cache hit.
[2023-03-14 12:26:40] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-03-14 12:26:40] [INFO ] Invariant cache hit.
[2023-03-14 12:26:40] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/40 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 570 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 30 out of 32 places after structural reductions.
[2023-03-14 12:26:40] [INFO ] Flatten gal took : 9 ms
[2023-03-14 12:26:40] [INFO ] Flatten gal took : 8 ms
[2023-03-14 12:26:40] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 85 steps, including 0 resets, run visited all 17 properties in 21 ms. (steps per millisecond=4 )
FORMULA PermAdmissibility-COL-05-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 32 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 16
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(X(((!p0||G(!p1)) U X(!p2)))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 2 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2023-03-14 12:26:41] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-14 12:26:41] [INFO ] Implicit Places using invariants in 97 ms returned [4, 6, 12, 13, 14, 15, 16, 18]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 101 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 22/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 576 ms :[p2, p2, p2, p2, p2, (AND p1 p2), true, p1]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(AND p0 p1 p2), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 6}, { cond=(NOT p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s4 1) (GEQ s5 1)), p1:(AND (GEQ s14 1) (GEQ s18 1) (GEQ s21 1)), p2:(AND (GEQ s15 1) (GEQ s16 1) (GEQ s17 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, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 420 ms.
Product exploration explored 100000 steps with 25000 reset in 181 ms.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 512 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2, (AND p1 p2), true, p1]
Incomplete random walk after 10003 steps, including 103 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :7
Finished Best-First random walk after 237 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=79 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p1))), (F (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (F (AND p2 (NOT p1))), (F (AND p2 p1)), (F p0), (F (AND p0 p2 p1)), (F p2), (F p1)]
Knowledge based reduction with 7 factoid took 655 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2, (AND p1 p2), true, p1]
Stuttering acceptance computed with spot in 355 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2, (AND p1 p2), true, p1]
Support contains 9 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2023-03-14 12:26:45] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-14 12:26:45] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 12:26:45] [INFO ] Invariant cache hit.
[2023-03-14 12:26:45] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-14 12:26:45] [INFO ] Invariant cache hit.
[2023-03-14 12:26:45] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 22/22 places, 16/16 transitions.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 307 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[p2, p2, p2, p2, p2, (AND p1 p2), true, p1]
Incomplete random walk after 10003 steps, including 103 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :6
Finished Best-First random walk after 239 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=79 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND p2 p1)), (F (AND p2 (NOT p1) p0)), (F p1), (F (AND p2 (NOT p1))), (F p2), (F (OR (AND p2 (NOT p1)) (AND p2 (NOT p0)))), (F (AND p2 p1 p0))]
Knowledge based reduction with 5 factoid took 710 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 394 ms :[p2, p2, p2, p2, p2, (AND p1 p2), true, p1]
Stuttering acceptance computed with spot in 414 ms :[p2, p2, p2, p2, p2, (AND p1 p2), true, p1]
Stuttering acceptance computed with spot in 321 ms :[p2, p2, p2, p2, p2, (AND p1 p2), true, p1]
Product exploration explored 100000 steps with 25000 reset in 133 ms.
Product exploration explored 100000 steps with 25000 reset in 217 ms.
Applying partial POR strategy [false, false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 357 ms :[p2, p2, p2, p2, p2, (AND p1 p2), true, p1]
Support contains 9 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 2 place count 22 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 22 transition count 16
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 18 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 18 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 14 rules in 12 ms. Remains 18 /22 variables (removed 4) and now considering 12/16 (removed 4) transitions.
[2023-03-14 12:26:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2023-03-14 12:26:48] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-14 12:26:48] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/22 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52 ms. Remains : 18/22 places, 12/16 transitions.
Support contains 9 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2023-03-14 12:26:48] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-14 12:26:48] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-14 12:26:48] [INFO ] Invariant cache hit.
[2023-03-14 12:26:48] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-14 12:26:48] [INFO ] Invariant cache hit.
[2023-03-14 12:26:49] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 22/22 places, 16/16 transitions.
Treatment of property PermAdmissibility-COL-05-LTLFireability-00 finished in 7810 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((p0||X(p1))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2023-03-14 12:26:49] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-14 12:26:49] [INFO ] Implicit Places using invariants in 79 ms returned [5, 7, 12, 13, 14, 15, 16, 18, 22, 26]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 80 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s14 1) (GEQ s15 1) (GEQ s16 1)), p1:(OR (LT s2 1) (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-01 finished in 217 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)))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
[2023-03-14 12:26:49] [INFO ] Invariant cache hit.
[2023-03-14 12:26:49] [INFO ] Implicit Places using invariants in 89 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 91 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s13 1) (GEQ s15 1) (GEQ s18 1) (OR (LT s12 1) (LT s16 1) (LT s17 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-02 finished in 224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
[2023-03-14 12:26:49] [INFO ] Invariant cache hit.
[2023-03-14 12:26:49] [INFO ] Implicit Places using invariants in 118 ms returned [4, 6, 12, 13, 14, 15, 16, 18, 23, 25]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 124 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s4 1) (GEQ s5 1)), p0:(AND (GEQ s14 1) (GEQ s16 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-03 finished in 308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (G(p2)&&p1)))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 6 ms. Remains 26 /32 variables (removed 6) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 26 cols
[2023-03-14 12:26:49] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-14 12:26:49] [INFO ] Implicit Places using invariants in 74 ms returned [12, 13, 14, 15, 16, 18]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 86 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 17 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 17 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 16 transition count 10
Applied a total of 6 rules in 8 ms. Remains 16 /20 variables (removed 4) and now considering 10/14 (removed 4) transitions.
// Phase 1: matrix 10 rows 16 cols
[2023-03-14 12:26:49] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-14 12:26:49] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-14 12:26:49] [INFO ] Invariant cache hit.
[2023-03-14 12:26:50] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 16/32 places, 10/16 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p2) p0), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=0 dest: 2}, { cond=(AND p1 p2 p0), acceptance={1} source=0 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=1 dest: 2}, { cond=(AND p1 p2 p0), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p2 p0), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s4 1) (GEQ s6 1)), p2:(AND (GEQ s1 1) (GEQ s5 1) (GEQ s7 1)), p0:(AND (GEQ s12 1) (GEQ s13 1) (GEQ s14 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-04 finished in 485 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 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 4 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2023-03-14 12:26:50] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-14 12:26:50] [INFO ] Implicit Places using invariants in 106 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 23, 25]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 108 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 17 transition count 7
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 9 transition count 7
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 9 transition count 4
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 6 transition count 4
Applied a total of 22 rules in 6 ms. Remains 6 /18 variables (removed 12) and now considering 4/16 (removed 12) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-14 12:26:50] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-14 12:26:50] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-14 12:26:50] [INFO ] Invariant cache hit.
[2023-03-14 12:26:50] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/32 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 6/32 places, 4/16 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s4 1) (GEQ s5 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 15741 reset in 249 ms.
Product exploration explored 100000 steps with 15735 reset in 286 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-14 12:26:51] [INFO ] Invariant cache hit.
[2023-03-14 12:26:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-14 12:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:26:51] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 12:26:51] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 12:26:51] [INFO ] Added : 3 causal constraints over 1 iterations in 19 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-14 12:26:51] [INFO ] Invariant cache hit.
[2023-03-14 12:26:51] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-14 12:26:51] [INFO ] Invariant cache hit.
[2023-03-14 12:26:51] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-14 12:26:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 12:26:51] [INFO ] Invariant cache hit.
[2023-03-14 12:26:51] [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 88 ms. Remains : 6/6 places, 4/4 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-14 12:26:52] [INFO ] Invariant cache hit.
[2023-03-14 12:26:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-14 12:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:26:52] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 12:26:52] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 12:26:52] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15728 reset in 137 ms.
Product exploration explored 100000 steps with 15698 reset in 339 ms.
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 3 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-14 12:26:53] [INFO ] Invariant cache hit.
[2023-03-14 12:26:53] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-14 12:26:53] [INFO ] Invariant cache hit.
[2023-03-14 12:26:53] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-14 12:26:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 12:26:53] [INFO ] Invariant cache hit.
[2023-03-14 12:26:53] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 6/6 places, 4/4 transitions.
Treatment of property PermAdmissibility-COL-05-LTLFireability-05 finished in 2868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(((p1 U p2)&&(p1||F(!p2))))))))'
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2023-03-14 12:26:53] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-14 12:26:53] [INFO ] Implicit Places using invariants in 97 ms returned [4, 6, 12, 13, 14, 15, 16, 18, 22, 26]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 98 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p2), (AND (NOT p1) p2)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=7 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s14 1) (GEQ s15 1) (GEQ s16 1)), p2:(AND (GEQ s14 1) (GEQ s16 1) (GEQ s18 1)), p1:(AND (GEQ s1 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2253 reset in 295 ms.
Product exploration explored 100000 steps with 2248 reset in 253 ms.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 2085 ms. Reduced automaton from 8 states, 36 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 349 steps, including 3 resets, run visited all 8 properties in 3 ms. (steps per millisecond=116 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) p0)), (F p0), (F (AND (NOT p2) p1 (NOT p0))), (F (AND (NOT p2) p1 p0)), (F (OR p2 p1 p0)), (F (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 25 factoid took 1468 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter insensitive) to 3 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 16 rows 20 cols
[2023-03-14 12:26:58] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-14 12:26:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-14 12:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:26:58] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-14 12:26:58] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 12:26:58] [INFO ] Added : 15 causal constraints over 3 iterations in 46 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Graph (complete) has 29 edges and 20 vertex of which 18 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 17 transition count 10
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 14 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 14 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 12 transition count 8
Applied a total of 11 rules in 7 ms. Remains 12 /20 variables (removed 8) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-14 12:26:58] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-14 12:26:58] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-14 12:26:58] [INFO ] Invariant cache hit.
[2023-03-14 12:26:58] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-14 12:26:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 12:26:58] [INFO ] Invariant cache hit.
[2023-03-14 12:26:58] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/20 places, 8/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 12/20 places, 8/16 transitions.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (OR p2 p1 p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR p2 p1 p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1180 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter insensitive) to 3 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 316 steps, including 6 resets, run visited all 8 properties in 3 ms. (steps per millisecond=105 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (OR p2 p1 p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR p2 p1 p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F p0), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) p0 p1)), (F (OR p2 p0 p1)), (F (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 20 factoid took 1369 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter insensitive) to 3 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p2), (NOT p2)]
[2023-03-14 12:27:01] [INFO ] Invariant cache hit.
[2023-03-14 12:27:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-14 12:27:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:27:01] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-14 12:27:01] [INFO ] Computed and/alt/rep : 7/15/7 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-14 12:27:01] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering criterion allowed to conclude after 84193 steps with 4263 reset in 175 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-06 finished in 9053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 4 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2023-03-14 12:27:02] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-14 12:27:02] [INFO ] Implicit Places using invariants in 99 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 23, 25]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 100 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 17 transition count 8
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 10 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 14 place count 10 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 7 transition count 5
Applied a total of 20 rules in 4 ms. Remains 7 /18 variables (removed 11) and now considering 5/16 (removed 11) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-14 12:27:02] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 12:27:02] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-14 12:27:02] [INFO ] Invariant cache hit.
[2023-03-14 12:27:02] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/32 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 164 ms. Remains : 7/32 places, 5/16 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s4 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-09 finished in 242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&(G(p2)||p1))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 16 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 3 ms. Remains 15 /32 variables (removed 17) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 15 cols
[2023-03-14 12:27:02] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-14 12:27:02] [INFO ] Implicit Places using invariants in 98 ms returned [4, 9, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 101 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/32 places, 8/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 6
Applied a total of 2 rules in 4 ms. Remains 10 /12 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 10 cols
[2023-03-14 12:27:02] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-14 12:27:02] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-14 12:27:02] [INFO ] Invariant cache hit.
[2023-03-14 12:27:02] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/32 places, 6/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 157 ms. Remains : 10/32 places, 6/16 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s5 1) (LT s6 1) (LT s9 1)), p2:(OR (LT s1 1) (LT s3 1) (LT s4 1)), p0:(OR (LT s5 1) (LT s6 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-10 finished in 320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(F(p1))&&F(p2)))&&p0)))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2023-03-14 12:27:02] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-14 12:27:02] [INFO ] Implicit Places using invariants in 62 ms returned [4, 6, 14, 15, 16, 23, 24, 26, 27]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 63 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 22/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s4 1) (GEQ s5 1)), p2:(AND (GEQ s1 1) (GEQ s4 1) (GEQ s5 1)), p1:(OR (AND (GEQ s6 1) (GEQ s7 1) (GEQ s11 1)) (AND (GEQ s12 1) (GEQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-11 finished in 332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 16 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 3 ms. Remains 14 /32 variables (removed 18) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 14 cols
[2023-03-14 12:27:03] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-14 12:27:03] [INFO ] Implicit Places using invariants in 50 ms returned [4, 5, 8, 10]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 52 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/32 places, 8/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 3 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-14 12:27:03] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-14 12:27:03] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-14 12:27:03] [INFO ] Invariant cache hit.
[2023-03-14 12:27:03] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/32 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 101 ms. Remains : 7/32 places, 5/16 transitions.
Stuttering acceptance computed with spot in 263 ms :[p0, p0]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s3 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5210 steps with 778 reset in 4 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-12 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U G((!p0 U X(X((p1||F(G(!p0)))))))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2023-03-14 12:27:03] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-14 12:27:03] [INFO ] Implicit Places using invariants in 101 ms returned [4, 5, 6, 7, 12, 15, 16, 17, 19, 23, 24, 26, 27]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 108 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 701 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p1) p0), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 11}, { cond=p0, acceptance={} source=0 dest: 13}], [{ cond=p0, acceptance={} source=1 dest: 6}, { cond=p0, acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={1} source=5 dest: 10}], [{ cond=true, acceptance={} source=6 dest: 8}], [{ cond=p0, acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=9 dest: 9}, { cond=p0, acceptance={0, 1} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=10 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={1} source=10 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=10 dest: 13}], [{ cond=(NOT p0), acceptance={} source=11 dest: 3}, { cond=(NOT p0), acceptance={0} source=11 dest: 4}, { cond=p0, acceptance={0, 1} source=11 dest: 5}], [{ cond=true, acceptance={} source=12 dest: 1}, { cond=(NOT p0), acceptance={0} source=12 dest: 11}, { cond=(NOT p0), acceptance={} source=12 dest: 12}, { cond=p0, acceptance={1} source=12 dest: 12}, { cond=p0, acceptance={0, 1} source=12 dest: 13}], [{ cond=(NOT p0), acceptance={0} source=13 dest: 4}, { cond=p0, acceptance={0, 1} source=13 dest: 5}, { cond=p0, acceptance={} source=13 dest: 8}, { cond=(NOT p0), acceptance={} source=13 dest: 10}, { cond=p0, acceptance={1} source=13 dest: 10}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s8 1) (LT s9 1)), p1:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s9 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-13 finished in 859 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))&&F(p1)&&(p2 U !p0)))'
Support contains 6 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 0 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
[2023-03-14 12:27:04] [INFO ] Invariant cache hit.
[2023-03-14 12:27:04] [INFO ] Implicit Places using invariants in 43 ms returned [12, 15, 16, 17, 19, 23, 24, 26, 27]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 44 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 22/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s6 1)), p1:(AND (GEQ s11 1) (GEQ s12 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-14 finished in 213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((!p0||G(!p1)) U X(!p2)))))'
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))'
[2023-03-14 12:27:04] [INFO ] Flatten gal took : 3 ms
[2023-03-14 12:27:04] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-14 12:27:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 16 transitions and 75 arcs took 1 ms.
Total runtime 26454 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PermAdmissibility-COL-05
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA PermAdmissibility-COL-05-LTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-COL-05-LTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678796826328

--------------------
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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 PermAdmissibility-COL-05-LTLFireability-00
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for PermAdmissibility-COL-05-LTLFireability-00
lola: result : true
lola: markings : 7
lola: fired transitions : 7
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 6 (type EXCL) for 3 PermAdmissibility-COL-05-LTLFireability-05
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for PermAdmissibility-COL-05-LTLFireability-05
lola: result : false
lola: markings : 477
lola: fired transitions : 795
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PermAdmissibility-COL-05-LTLFireability-00: LTL true LTL model checker
PermAdmissibility-COL-05-LTLFireability-05: F true state space / EG


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="PermAdmissibility-COL-05"
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 PermAdmissibility-COL-05, 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 r263-smll-167863538300476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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