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.r007-oct2-167813595200235.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AirplaneLD-COL-4000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595200235
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.2K Feb 26 15:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 19:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 19:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 620K Mar 5 18:22 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 AirplaneLD-COL-4000-LTLCardinality-00
FORMULA_NAME AirplaneLD-COL-4000-LTLCardinality-01
FORMULA_NAME AirplaneLD-COL-4000-LTLCardinality-02
FORMULA_NAME AirplaneLD-COL-4000-LTLCardinality-03
FORMULA_NAME AirplaneLD-COL-4000-LTLCardinality-04
FORMULA_NAME AirplaneLD-COL-4000-LTLCardinality-05
FORMULA_NAME AirplaneLD-COL-4000-LTLCardinality-06
FORMULA_NAME AirplaneLD-COL-4000-LTLCardinality-07
FORMULA_NAME AirplaneLD-COL-4000-LTLCardinality-08
FORMULA_NAME AirplaneLD-COL-4000-LTLCardinality-09
FORMULA_NAME AirplaneLD-COL-4000-LTLCardinality-10
FORMULA_NAME AirplaneLD-COL-4000-LTLCardinality-11
FORMULA_NAME AirplaneLD-COL-4000-LTLCardinality-12
FORMULA_NAME AirplaneLD-COL-4000-LTLCardinality-13
FORMULA_NAME AirplaneLD-COL-4000-LTLCardinality-14
FORMULA_NAME AirplaneLD-COL-4000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678344756727

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-COL-4000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 06:52:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 06:52:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 06:52:39] [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-09 06:52:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-09 06:52:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 826 ms
[2023-03-09 06:52:40] [INFO ] Detected 3 constant HL places corresponding to 12002 PT places.
[2023-03-09 06:52:40] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 28019 PT places and 48012.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
[2023-03-09 06:52:40] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 12 ms.
[2023-03-09 06:52:40] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 2 formulas.
FORMULA AirplaneLD-COL-4000-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 15
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.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 17 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 1264 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 24) seen :13
Incomplete Best-First random walk after 10001 steps, including 335 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 342 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 289 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 390 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 351 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 285 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 328 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 355 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 349 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 351 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 14 rows 17 cols
[2023-03-09 06:52:42] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-09 06:52:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 06:52:42] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 06:52:42] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :11 sat :0
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 11 atomic propositions for a total of 14 simplifications.
FORMULA AirplaneLD-COL-4000-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 06:52:42] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-09 06:52:42] [INFO ] Flatten gal took : 37 ms
[2023-03-09 06:52:42] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA AirplaneLD-COL-4000-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 06:52:42] [INFO ] Flatten gal took : 6 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Altitude
Symmetric sort wr.t. initial detected :Altitude
Transition t3_2 : guard parameter $A(Altitude:8000) in guard (OR (GEQ $A 3999) (EQ $A 7999))introduces in Altitude(8000) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:8000) in guard (AND (LT $A 3999) (NEQ $A 7999))introduces in Altitude(8000) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 8000 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 3999) (EQ $A 7999)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 3999) (NEQ $A 7999)) -> (EQ $A 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Speed
Symmetric sort wr.t. initial detected :Speed
Transition t5_2 : guard parameter $S(Speed:4000) in guard (OR (LEQ $S 1999) (EQ $S 3999))introduces in Speed(4000) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:4000) in guard (AND (GT $S 1999) (NEQ $S 3999))introduces in Speed(4000) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:4000) in guard (OR (LEQ $S 1999) (EQ $S 3999))introduces in Speed(4000) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:4000) in guard (AND (GT $S 1999) (NEQ $S 3999))introduces in Speed(4000) partition with 2 elements
Sort wr.t. initial and guards Speed has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 4000 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 1999) (EQ $S 3999)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 1999) (NEQ $S 3999)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 1999) (EQ $S 3999)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 1999) (NEQ $S 3999)) -> (EQ $S 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Signal
Arc [19:1*[1]] contains constants of sort Signal
Transition t5_2 : constants on arcs in [[19:1*[1]]] introduces in Signal(2) partition with 1 elements that refines current partition to 2 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :Weight
Symmetric sort wr.t. initial detected :Weight
Transition t2_2 : guard parameter $W(Weight:2) in guard (EQ $W 1)introduces in Weight(2) partition with 2 elements
[2023-03-09 06:52:43] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 130 ms.
[2023-03-09 06:52:43] [INFO ] Unfolded 5 HLPN properties in 1 ms.
Reduce places removed 6 places and 0 transitions.
Support contains 13 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Applied a total of 0 rules in 13 ms. Remains 23 /23 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 23 cols
[2023-03-09 06:52:43] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-09 06:52:43] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-09 06:52:43] [INFO ] Invariant cache hit.
[2023-03-09 06:52:43] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-09 06:52:43] [INFO ] Invariant cache hit.
[2023-03-09 06:52:43] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 23/23 places, 20/20 transitions.
Support contains 13 out of 23 places after structural reductions.
[2023-03-09 06:52:43] [INFO ] Flatten gal took : 22 ms
[2023-03-09 06:52:43] [INFO ] Flatten gal took : 4 ms
[2023-03-09 06:52:43] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 10 steps, including 1 resets, run visited all 8 properties in 2 ms. (steps per millisecond=5 )
Computed a total of 23 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 20
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(F((p0||G((F(p0)&&F(G(p1)))))))))'
Support contains 1 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 20
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-09 06:52:43] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 06:52:44] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-09 06:52:44] [INFO ] Invariant cache hit.
[2023-03-09 06:52:44] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2023-03-09 06:52:44] [INFO ] Invariant cache hit.
[2023-03-09 06:52:44] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 20/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 753 ms. Remains : 22/23 places, 20/20 transitions.
Stuttering acceptance computed with spot in 440 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-4000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 4 ms.
FORMULA AirplaneLD-COL-4000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-4000-LTLCardinality-02 finished in 1289 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 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Graph (complete) has 41 edges and 23 vertex of which 1 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1 transition count 1
Applied a total of 2 rules in 10 ms. Remains 1 /23 variables (removed 22) and now considering 1/20 (removed 19) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-09 06:52:45] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 06:52:45] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-09 06:52:45] [INFO ] Invariant cache hit.
[2023-03-09 06:52:45] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-09 06:52:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 06:52:45] [INFO ] Invariant cache hit.
[2023-03-09 06:52:45] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/23 places, 1/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 1/23 places, 1/20 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-4000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
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 p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-COL-4000-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-4000-LTLCardinality-04 finished in 773 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))||G((p1 U p0))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Graph (complete) has 41 edges and 23 vertex of which 21 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 20 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 20 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 20 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 19 transition count 17
Applied a total of 6 rules in 7 ms. Remains 19 /23 variables (removed 4) and now considering 17/20 (removed 3) transitions.
// Phase 1: matrix 17 rows 19 cols
[2023-03-09 06:52:45] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 06:52:45] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-09 06:52:45] [INFO ] Invariant cache hit.
[2023-03-09 06:52:46] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 151 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/23 places, 17/20 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 18/23 places, 17/20 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-4000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s9 s8), p1:(LEQ (ADD s12 s13) s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 15217 reset in 197 ms.
Product exploration explored 100000 steps with 15270 reset in 137 ms.
Computed a total of 18 stabilizing places and 17 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 17
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) p1), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 7 factoid took 768 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 1084 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 17 rows 18 cols
[2023-03-09 06:52:49] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 06:52:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:52:49] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-09 06:52:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:52:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:52:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:52:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-09 06:52:49] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-09 06:52:49] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 17/17 transitions.
Applied a total of 0 rules in 34 ms. Remains 18 /18 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-09 06:52:49] [INFO ] Invariant cache hit.
[2023-03-09 06:52:49] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-09 06:52:49] [INFO ] Invariant cache hit.
[2023-03-09 06:52:49] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-09 06:52:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 06:52:49] [INFO ] Invariant cache hit.
[2023-03-09 06:52:49] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 338 ms. Remains : 18/18 places, 17/17 transitions.
Computed a total of 18 stabilizing places and 17 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 17
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) p1), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 7 factoid took 611 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) p1), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 930 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-09 06:52:51] [INFO ] Invariant cache hit.
[2023-03-09 06:52:52] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 06:52:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:52:52] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-09 06:52:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:52:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 06:52:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:52:52] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-09 06:52:52] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-09 06:52:52] [INFO ] Added : 0 causal constraints over 0 iterations in 66 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15308 reset in 139 ms.
Product exploration explored 100000 steps with 15285 reset in 149 ms.
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-09 06:52:52] [INFO ] Invariant cache hit.
[2023-03-09 06:52:52] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-09 06:52:52] [INFO ] Invariant cache hit.
[2023-03-09 06:52:53] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-09 06:52:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 06:52:53] [INFO ] Invariant cache hit.
[2023-03-09 06:52:53] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 388 ms. Remains : 18/18 places, 17/17 transitions.
Treatment of property AirplaneLD-COL-4000-LTLCardinality-13 finished in 7403 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(F(p0)))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 20
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-09 06:52:53] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 06:52:53] [INFO ] Implicit Places using invariants in 47 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 21/23 places, 20/20 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-4000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s19 s20) s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Computed a total of 21 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-COL-4000-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-4000-LTLCardinality-14 finished in 575 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(F((p0&&G(F(p1))))))'
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 19 transition count 18
Applied a total of 6 rules in 4 ms. Remains 19 /23 variables (removed 4) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-09 06:52:53] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 06:52:53] [INFO ] Implicit Places using invariants in 59 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/23 places, 18/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 18/23 places, 18/20 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-4000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s11 s12) s7), p0:(LEQ (ADD s9 s10) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 14947 reset in 88 ms.
Product exploration explored 100000 steps with 14916 reset in 130 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
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 p1 p0), (X p0), true, (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 413 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-COL-4000-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-4000-LTLCardinality-15 finished in 1215 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))||G((p1 U p0))))'
[2023-03-09 06:52:55] [INFO ] Flatten gal took : 6 ms
[2023-03-09 06:52:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-09 06:52:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 23 places, 20 transitions and 56 arcs took 1 ms.
Total runtime 15467 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AirplaneLD-COL-4000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
LTLCardinality

FORMULA AirplaneLD-COL-4000-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678344776043

--------------------
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 LTLCardinality -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/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 AirplaneLD-COL-4000-LTLCardinality-13
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for AirplaneLD-COL-4000-LTLCardinality-13
lola: result : true
lola: markings : 435
lola: fired transitions : 926
lola: time used : 0.000000
lola: memory pages used : 1
lola: Created skeleton in 0.000000 secs.
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-COL-4000-LTLCardinality-13: LTL true LTL model checker


Time elapsed: 1 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="AirplaneLD-COL-4000"
export BK_EXAMINATION="LTLCardinality"
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 AirplaneLD-COL-4000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-oct2-167813595200235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-COL-4000.tgz
mv AirplaneLD-COL-4000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;