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.r361-smll-167891811700555.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 ltsminxred
Input is SharedMemory-COL-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891811700555
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.9K Feb 25 14:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 14:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 25 14:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 14:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 12K 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 SharedMemory-COL-000010-LTLCardinality-00
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-01
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-02
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-03
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-04
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-05
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-06
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-07
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-08
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-09
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-10
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-11
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-12
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-13
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-14
FORMULA_NAME SharedMemory-COL-000010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679371411923

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-COL-000010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 04:03:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 04:03:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 04:03:35] [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-21 04:03:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-21 04:03:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 857 ms
[2023-03-21 04:03:36] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 141 PT places and 320.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2023-03-21 04:03:36] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 6 ms.
[2023-03-21 04:03:36] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA SharedMemory-COL-000010-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 2 resets, run finished after 938 ms. (steps per millisecond=10 ) properties (out of 25) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 5 rows 6 cols
[2023-03-21 04:03:38] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-21 04:03:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 04:03:38] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2023-03-21 04:03:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 04:03:38] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :0
Fused 10 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 10 atomic propositions for a total of 14 simplifications.
FORMULA SharedMemory-COL-000010-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 04:03:39] [INFO ] Flatten gal took : 27 ms
[2023-03-21 04:03:39] [INFO ] Flatten gal took : 5 ms
Domain [P(10), P(10)] of place Ext_Mem_Acc breaks symmetries in sort P
[2023-03-21 04:03:39] [INFO ] Unfolded HLPN to a Petri net with 141 places and 220 transitions 840 arcs in 29 ms.
[2023-03-21 04:03:39] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 10 transitions.
Support contains 131 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 23 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2023-03-21 04:03:39] [INFO ] Computed 21 place invariants in 24 ms
[2023-03-21 04:03:39] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-21 04:03:39] [INFO ] Invariant cache hit.
[2023-03-21 04:03:39] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-21 04:03:39] [INFO ] Invariant cache hit.
[2023-03-21 04:03:39] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 667 ms. Remains : 131/131 places, 210/210 transitions.
Support contains 131 out of 131 places after structural reductions.
[2023-03-21 04:03:39] [INFO ] Flatten gal took : 58 ms
[2023-03-21 04:03:39] [INFO ] Flatten gal took : 49 ms
[2023-03-21 04:03:40] [INFO ] Input system was already deterministic with 210 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-21 04:03:40] [INFO ] Invariant cache hit.
[2023-03-21 04:03:40] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-03-21 04:03:40] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
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 101 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 22 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-21 04:03:40] [INFO ] Invariant cache hit.
[2023-03-21 04:03:40] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-21 04:03:40] [INFO ] Invariant cache hit.
[2023-03-21 04:03:41] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-21 04:03:41] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-21 04:03:41] [INFO ] Invariant cache hit.
[2023-03-21 04:03:41] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 528 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT 1 s130) (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s6...], 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 36857 reset in 781 ms.
Product exploration explored 100000 steps with 36900 reset in 544 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 193 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)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 204 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 49 ms :[(NOT p0)]
[2023-03-21 04:03:43] [INFO ] Invariant cache hit.
[2023-03-21 04:03:43] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2023-03-21 04:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 04:03:44] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-21 04:03:44] [INFO ] Computed and/alt/rep : 190/190/190 causal constraints (skipped 0 transitions) in 31 ms.
[2023-03-21 04:03:44] [INFO ] Added : 0 causal constraints over 0 iterations in 76 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 101 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 18 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-21 04:03:44] [INFO ] Invariant cache hit.
[2023-03-21 04:03:44] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-21 04:03:44] [INFO ] Invariant cache hit.
[2023-03-21 04:03:44] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-21 04:03:44] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-21 04:03:44] [INFO ] Invariant cache hit.
[2023-03-21 04:03:44] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 613 ms. Remains : 131/131 places, 210/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 185 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 36 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 141 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-21 04:03:45] [INFO ] Invariant cache hit.
[2023-03-21 04:03:45] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2023-03-21 04:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 04:03:45] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-21 04:03:45] [INFO ] Computed and/alt/rep : 190/190/190 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-21 04:03:46] [INFO ] Added : 0 causal constraints over 0 iterations in 69 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Product exploration explored 100000 steps with 36878 reset in 684 ms.
Product exploration explored 100000 steps with 36829 reset in 479 ms.
Support contains 101 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 17 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-21 04:03:47] [INFO ] Invariant cache hit.
[2023-03-21 04:03:47] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-21 04:03:47] [INFO ] Invariant cache hit.
[2023-03-21 04:03:47] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-21 04:03:47] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-21 04:03:47] [INFO ] Invariant cache hit.
[2023-03-21 04:03:47] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 626 ms. Remains : 131/131 places, 210/210 transitions.
Treatment of property SharedMemory-COL-000010-LTLCardinality-02 finished in 7268 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 U (p1||G(p0))))))'
Support contains 21 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 27 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-21 04:03:48] [INFO ] Invariant cache hit.
[2023-03-21 04:03:48] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-21 04:03:48] [INFO ] Invariant cache hit.
[2023-03-21 04:03:48] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-21 04:03:48] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 04:03:48] [INFO ] Invariant cache hit.
[2023-03-21 04:03:48] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 603 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SharedMemory-COL-000010-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT 1 s130) (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39))), p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6933 reset in 486 ms.
Stack based approach found an accepted trace after 54 steps with 4 reset with depth 12 and stack size 12 in 0 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-05 finished in 1222 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 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 131 transition count 120
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (trivial) has 20 edges and 30 vertex of which 20 / 30 are part of one of the 10 SCC in 3 ms
Free SCC test removed 10 places
Iterating post reduction 1 with 182 rules applied. Total rules applied 272 place count 20 transition count 40
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 282 place count 20 transition count 30
Applied a total of 282 rules in 13 ms. Remains 20 /131 variables (removed 111) and now considering 30/210 (removed 180) transitions.
[2023-03-21 04:03:49] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
// Phase 1: matrix 21 rows 20 cols
[2023-03-21 04:03:49] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-21 04:03:49] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-21 04:03:49] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
[2023-03-21 04:03:49] [INFO ] Invariant cache hit.
[2023-03-21 04:03:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-21 04:03:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 04:03:49] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
[2023-03-21 04:03:49] [INFO ] Invariant cache hit.
[2023-03-21 04:03:49] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/131 places, 30/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 20/131 places, 30/210 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9))], 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 0 steps with 0 reset in 0 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-06 finished in 214 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(F((p0&&F(G(p1)))))))'
Support contains 40 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 8 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2023-03-21 04:03:49] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-21 04:03:49] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-21 04:03:49] [INFO ] Invariant cache hit.
[2023-03-21 04:03:49] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-21 04:03:49] [INFO ] Invariant cache hit.
[2023-03-21 04:03:49] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 494 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9)), p1:(LEQ (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39) (ADD s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1098 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-08 finished in 1920 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&&(p1||X(p1))))))'
Support contains 20 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 8 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-21 04:03:51] [INFO ] Invariant cache hit.
[2023-03-21 04:03:51] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-21 04:03:51] [INFO ] Invariant cache hit.
[2023-03-21 04:03:51] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-21 04:03:51] [INFO ] Invariant cache hit.
[2023-03-21 04:03:51] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SharedMemory-COL-000010-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 3 (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s19)) (LEQ 2 (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39))), p1:(LEQ 2 (ADD s30 s31 s32 s33 s34 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 1072 ms.
Stack based approach found an accepted trace after 68 steps with 0 reset with depth 69 and stack size 68 in 1 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-09 finished in 1621 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((F((G(!p0)||X(F(p1)))) U !p1))))'
Support contains 11 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-21 04:03:53] [INFO ] Invariant cache hit.
[2023-03-21 04:03:53] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-21 04:03:53] [INFO ] Invariant cache hit.
[2023-03-21 04:03:53] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-21 04:03:53] [INFO ] Invariant cache hit.
[2023-03-21 04:03:53] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 177 ms :[p1, p1, p1, (AND (NOT p1) p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9) s130), p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6258 reset in 793 ms.
Stack based approach found an accepted trace after 52 steps with 10 reset with depth 12 and stack size 12 in 0 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-13 finished in 1423 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 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 131 transition count 120
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (trivial) has 20 edges and 30 vertex of which 20 / 30 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 places
Iterating post reduction 1 with 182 rules applied. Total rules applied 272 place count 20 transition count 40
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 282 place count 20 transition count 30
Applied a total of 282 rules in 10 ms. Remains 20 /131 variables (removed 111) and now considering 30/210 (removed 180) transitions.
[2023-03-21 04:03:54] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
// Phase 1: matrix 21 rows 20 cols
[2023-03-21 04:03:54] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-21 04:03:54] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-21 04:03:54] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
[2023-03-21 04:03:54] [INFO ] Invariant cache hit.
[2023-03-21 04:03:54] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-21 04:03:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 04:03:54] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
[2023-03-21 04:03:54] [INFO ] Invariant cache hit.
[2023-03-21 04:03:54] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/131 places, 30/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 20/131 places, 30/210 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9))], 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 3 steps with 0 reset in 1 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-14 finished in 268 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))'
[2023-03-21 04:03:55] [INFO ] Flatten gal took : 20 ms
[2023-03-21 04:03:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-21 04:03:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 131 places, 210 transitions and 800 arcs took 4 ms.
Total runtime 19878 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/782/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SharedMemory-COL-000010-LTLCardinality-02

BK_STOP 1679371436996

--------------------
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
mcc2023
ltl formula name SharedMemory-COL-000010-LTLCardinality-02
ltl formula formula --ltl=/tmp/782/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 131 places, 210 transitions and 800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/782/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/782/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/782/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/782/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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="SharedMemory-COL-000010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SharedMemory-COL-000010, 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 r361-smll-167891811700555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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