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.r357-smll-167891806700555.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is SharedMemory-COL-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r357-smll-167891806700555
=====================================================================

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-COL-000010
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-20 12:16:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 12:16:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:16:55] [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-20 12:16:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-20 12:16:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 884 ms
[2023-03-20 12:16:56] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 141 PT places and 320.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
[2023-03-20 12:16:56] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 8 ms.
[2023-03-20 12:16:56] [INFO ] Skeletonized 16 HLPN properties in 3 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 942 ms. (steps per millisecond=10 ) properties (out of 25) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 5 rows 6 cols
[2023-03-20 12:16:58] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-20 12:16:58] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 12:16:58] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2023-03-20 12:16:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:16:58] [INFO ] After 79ms 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 0 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-20 12:16:58] [INFO ] Flatten gal took : 31 ms
[2023-03-20 12:16:58] [INFO ] Flatten gal took : 4 ms
Domain [P(10), P(10)] of place Ext_Mem_Acc breaks symmetries in sort P
[2023-03-20 12:16:58] [INFO ] Unfolded HLPN to a Petri net with 141 places and 220 transitions 840 arcs in 51 ms.
[2023-03-20 12:16:58] [INFO ] Unfolded 8 HLPN properties in 1 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 15 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2023-03-20 12:16:59] [INFO ] Computed 21 place invariants in 15 ms
[2023-03-20 12:16:59] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-20 12:16:59] [INFO ] Invariant cache hit.
[2023-03-20 12:16:59] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2023-03-20 12:16:59] [INFO ] Invariant cache hit.
[2023-03-20 12:16:59] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 663 ms. Remains : 131/131 places, 210/210 transitions.
Support contains 131 out of 131 places after structural reductions.
[2023-03-20 12:16:59] [INFO ] Flatten gal took : 55 ms
[2023-03-20 12:16:59] [INFO ] Flatten gal took : 44 ms
[2023-03-20 12:16:59] [INFO ] Input system was already deterministic with 210 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-20 12:17:00] [INFO ] Invariant cache hit.
[2023-03-20 12:17:00] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-03-20 12:17:00] [INFO ] After 65ms 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 27 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-20 12:17:00] [INFO ] Invariant cache hit.
[2023-03-20 12:17:00] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-20 12:17:00] [INFO ] Invariant cache hit.
[2023-03-20 12:17:01] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-20 12:17:01] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-20 12:17:01] [INFO ] Invariant cache hit.
[2023-03-20 12:17:01] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 590 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 318 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 36871 reset in 619 ms.
Product exploration explored 100000 steps with 36867 reset in 568 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 200 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 56 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
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 220 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 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
[2023-03-20 12:17:03] [INFO ] Invariant cache hit.
[2023-03-20 12:17:04] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2023-03-20 12:17:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:17:04] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-03-20 12:17:04] [INFO ] Computed and/alt/rep : 190/190/190 causal constraints (skipped 0 transitions) in 38 ms.
[2023-03-20 12:17:04] [INFO ] Added : 0 causal constraints over 0 iterations in 95 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 27 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-20 12:17:04] [INFO ] Invariant cache hit.
[2023-03-20 12:17:04] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-20 12:17:04] [INFO ] Invariant cache hit.
[2023-03-20 12:17:04] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-20 12:17:04] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-20 12:17:04] [INFO ] Invariant cache hit.
[2023-03-20 12:17:04] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 559 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 166 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 54 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
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 156 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)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-20 12:17:05] [INFO ] Invariant cache hit.
[2023-03-20 12:17:05] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2023-03-20 12:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:17:05] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-20 12:17:05] [INFO ] Computed and/alt/rep : 190/190/190 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-20 12:17:06] [INFO ] Added : 0 causal constraints over 0 iterations in 63 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 36846 reset in 687 ms.
Product exploration explored 100000 steps with 36856 reset in 435 ms.
Built C files in :
/tmp/ltsmin16271241495123812376
[2023-03-20 12:17:07] [INFO ] Computing symmetric may disable matrix : 210 transitions.
[2023-03-20 12:17:07] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 12:17:07] [INFO ] Computing symmetric may enable matrix : 210 transitions.
[2023-03-20 12:17:07] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 12:17:07] [INFO ] Computing Do-Not-Accords matrix : 210 transitions.
[2023-03-20 12:17:07] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 12:17:07] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16271241495123812376
Running compilation step : cd /tmp/ltsmin16271241495123812376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 898 ms.
Running link step : cd /tmp/ltsmin16271241495123812376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin16271241495123812376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2284615837609047474.hoa' '--buchi-type=spotba'
LTSmin run took 10271 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SharedMemory-COL-000010-LTLCardinality-02 finished in 17884 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 18 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-20 12:17:18] [INFO ] Invariant cache hit.
[2023-03-20 12:17:18] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-20 12:17:18] [INFO ] Invariant cache hit.
[2023-03-20 12:17:18] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-20 12:17:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 12:17:18] [INFO ] Invariant cache hit.
[2023-03-20 12:17:18] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 432 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 91 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 6911 reset in 485 ms.
Stack based approach found an accepted trace after 136 steps with 8 reset with depth 9 and stack size 9 in 1 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-05 finished in 1028 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 7 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 18 ms. Remains 20 /131 variables (removed 111) and now considering 30/210 (removed 180) transitions.
[2023-03-20 12:17:19] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
// Phase 1: matrix 21 rows 20 cols
[2023-03-20 12:17:19] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-20 12:17:19] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-20 12:17:19] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
[2023-03-20 12:17:19] [INFO ] Invariant cache hit.
[2023-03-20 12:17:19] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-20 12:17:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:17:19] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
[2023-03-20 12:17:19] [INFO ] Invariant cache hit.
[2023-03-20 12:17:19] [INFO ] Dead Transitions using invariants and state equation in 45 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 146 ms. Remains : 20/131 places, 30/210 transitions.
Stuttering acceptance computed with spot in 98 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 264 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 6 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2023-03-20 12:17:19] [INFO ] Computed 21 place invariants in 5 ms
[2023-03-20 12:17:19] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-20 12:17:19] [INFO ] Invariant cache hit.
[2023-03-20 12:17:20] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-20 12:17:20] [INFO ] Invariant cache hit.
[2023-03-20 12:17:20] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 481 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 261 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 1020 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-08 finished in 1792 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 13 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-20 12:17:21] [INFO ] Invariant cache hit.
[2023-03-20 12:17:21] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-20 12:17:21] [INFO ] Invariant cache hit.
[2023-03-20 12:17:21] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-20 12:17:21] [INFO ] Invariant cache hit.
[2023-03-20 12:17:22] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 112 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 1123 ms.
Stack based approach found an accepted trace after 84 steps with 0 reset with depth 85 and stack size 84 in 1 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-09 finished in 1873 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 7 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-20 12:17:23] [INFO ] Invariant cache hit.
[2023-03-20 12:17:23] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 12:17:23] [INFO ] Invariant cache hit.
[2023-03-20 12:17:23] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-20 12:17:23] [INFO ] Invariant cache hit.
[2023-03-20 12:17:23] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 220 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 6049 reset in 852 ms.
Stack based approach found an accepted trace after 69 steps with 7 reset with depth 30 and stack size 30 in 2 ms.
FORMULA SharedMemory-COL-000010-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLCardinality-13 finished in 1571 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 12 ms. Remains 20 /131 variables (removed 111) and now considering 30/210 (removed 180) transitions.
[2023-03-20 12:17:25] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
// Phase 1: matrix 21 rows 20 cols
[2023-03-20 12:17:25] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-20 12:17:25] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-20 12:17:25] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
[2023-03-20 12:17:25] [INFO ] Invariant cache hit.
[2023-03-20 12:17:25] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-20 12:17:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:17:25] [INFO ] Flow matrix only has 21 transitions (discarded 9 similar events)
[2023-03-20 12:17:25] [INFO ] Invariant cache hit.
[2023-03-20 12:17:25] [INFO ] Dead Transitions using invariants and state equation in 40 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 152 ms. Remains : 20/131 places, 30/210 transitions.
Stuttering acceptance computed with spot in 78 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 255 ms.
All properties solved by simple procedures.
Total runtime 30036 ms.

BK_STOP 1679314646298

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SharedMemory-COL-000010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is 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 r357-smll-167891806700555"
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 ;