Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r351-tall-171679102600528.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is SharedMemory-PT-000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679102600528
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 127M
-rw-r--r-- 1 mcc users 1.9M Apr 12 23:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.6M Apr 12 23:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7M Apr 12 20:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 14M Apr 12 20:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.8M Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 4.8M Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4M Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.9M Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5M Apr 13 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13M Apr 13 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12M Apr 13 11:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47M Apr 13 11:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 202K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 419K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M May 18 16:43 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-PT-000100-LTLFireability-00
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-01
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-02
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-03
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-04
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-05
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-06
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-07
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-08
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-09
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-10
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-11
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-12
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-13
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-14
FORMULA_NAME SharedMemory-PT-000100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716915381489

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-PT-000100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 16:56:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 16:56:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:56:23] [INFO ] Load time of PNML (sax parser for PT used): 486 ms
[2024-05-28 16:56:23] [INFO ] Transformed 10301 places.
[2024-05-28 16:56:23] [INFO ] Transformed 20100 transitions.
[2024-05-28 16:56:23] [INFO ] Found NUPN structural information;
[2024-05-28 16:56:23] [INFO ] Parsed PT model containing 10301 places and 20100 transitions and 80000 arcs in 636 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 204 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA SharedMemory-PT-000100-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000100-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10301 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 78 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2024-05-28 16:56:28] [INFO ] Computed 201 invariants in 2568 ms
[2024-05-28 16:56:29] [INFO ] Implicit Places using invariants in 4142 ms returned []
Implicit Place search using SMT only with invariants took 4170 ms to find 0 implicit places.
[2024-05-28 16:56:29] [INFO ] Invariant cache hit.
[2024-05-28 16:56:31] [INFO ] Dead Transitions using invariants and state equation in 1361 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5617 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Support contains 10301 out of 10301 places after structural reductions.
[2024-05-28 16:56:33] [INFO ] Flatten gal took : 1267 ms
[2024-05-28 16:56:37] [INFO ] Flatten gal took : 1212 ms
[2024-05-28 16:56:41] [INFO ] Input system was already deterministic with 20100 transitions.
Interrupted random walk after 6438 steps, including 1 resets, run timeout after 30014 ms. (steps per millisecond=0 ) properties seen 17
Interrupted Best-First random walk after 3235 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 16:57:17] [INFO ] Invariant cache hit.
[2024-05-28 16:57:20] [INFO ] [Real]Absence check using 201 positive place invariants in 488 ms returned sat
[2024-05-28 16:57:42] [INFO ] After 25040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10102 out of 10301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Free-agglomeration rule applied 99 times.
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 10301 transition count 20001
Reduce places removed 99 places and 0 transitions.
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 297 place count 10202 transition count 19902
Applied a total of 297 rules in 7035 ms. Remains 10202 /10301 variables (removed 99) and now considering 19902/20100 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7044 ms. Remains : 10202/10301 places, 19902/20100 transitions.
Interrupted random walk after 3726 steps, including 1 resets, run timeout after 30012 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 3119 steps, including 0 resets, run timeout after 5086 ms. (steps per millisecond=0 ) properties seen 0
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
Probabilistic random walk after 264250 steps, saw 263775 distinct states, run finished after 105171 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 19902 rows 10202 cols
[2024-05-28 17:00:12] [INFO ] Computed 201 invariants in 2253 ms
[2024-05-28 17:00:40] [INFO ] [Real]Absence check using 201 positive place invariants in 385 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:800)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:634)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 17:01:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-28 17:01:02] [INFO ] After 25025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10102 out of 10202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10202/10202 places, 19902/19902 transitions.
Applied a total of 0 rules in 6906 ms. Remains 10202 /10202 variables (removed 0) and now considering 19902/19902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6908 ms. Remains : 10202/10202 places, 19902/19902 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10202/10202 places, 19902/19902 transitions.
Applied a total of 0 rules in 6469 ms. Remains 10202 /10202 variables (removed 0) and now considering 19902/19902 (removed 0) transitions.
[2024-05-28 17:01:16] [INFO ] Invariant cache hit.
[2024-05-28 17:01:17] [INFO ] Implicit Places using invariants in 1264 ms returned []
Implicit Place search using SMT only with invariants took 1265 ms to find 0 implicit places.
[2024-05-28 17:01:17] [INFO ] Invariant cache hit.
[2024-05-28 17:01:18] [INFO ] Dead Transitions using invariants and state equation in 1276 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9018 ms. Remains : 10202/10202 places, 19902/19902 transitions.
FORMULA SharedMemory-PT-000100-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(p1)&&X(p2))))'
Support contains 10100 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 58 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2024-05-28 17:01:22] [INFO ] Computed 201 invariants in 2472 ms
[2024-05-28 17:01:23] [INFO ] Implicit Places using invariants in 3801 ms returned []
Implicit Place search using SMT only with invariants took 3802 ms to find 0 implicit places.
[2024-05-28 17:01:23] [INFO ] Invariant cache hit.
[2024-05-28 17:01:25] [INFO ] Dead Transitions using invariants and state equation in 1503 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5367 ms. Remains : 10301/10301 places, 20100/20100 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 375 ms :[true, (NOT p1), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=4, aps=[p1:(AND (OR (EQ s9425 0) (EQ s10285 0)) (OR (EQ s9365 0) (EQ s9688 0)) (OR (EQ s9422 0) (EQ s10251 0)) (OR (EQ s9430 0) (EQ s10290 0)) (OR (EQ s9418 0) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 9 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-02 finished in 5884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p1))))'
Support contains 100 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 93 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
[2024-05-28 17:01:25] [INFO ] Invariant cache hit.
[2024-05-28 17:01:27] [INFO ] Implicit Places using invariants in 1486 ms returned []
Implicit Place search using SMT only with invariants took 1488 ms to find 0 implicit places.
[2024-05-28 17:01:27] [INFO ] Invariant cache hit.
[2024-05-28 17:01:28] [INFO ] Dead Transitions using invariants and state equation in 1543 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3130 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 94 ms :[p1, p1, true]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s9548 1) (EQ s9483 1) (EQ s9544 1) (EQ s9487 1) (EQ s9475 1) (EQ s9479 1) (EQ s9564 1) (EQ s9499 1) (EQ s9560 1) (EQ s9503 1) (EQ s9556 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 354 steps with 0 reset in 323 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-03 finished in 3609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Support contains 300 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 3383 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
[2024-05-28 17:01:32] [INFO ] Invariant cache hit.
[2024-05-28 17:01:34] [INFO ] Implicit Places using invariants in 1365 ms returned []
Implicit Place search using SMT only with invariants took 1369 ms to find 0 implicit places.
[2024-05-28 17:01:34] [INFO ] Invariant cache hit.
[2024-05-28 17:01:35] [INFO ] Dead Transitions using invariants and state equation in 1427 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6186 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(AND (OR (EQ s9425 0) (EQ s10285 0)) (OR (EQ s9365 0) (EQ s9688 0)) (OR (EQ s9422 0) (EQ s10251 0)) (OR (EQ s9430 0) (EQ s10290 0)) (OR (EQ s9418 0) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 6594 ms.
Product exploration explored 100000 steps with 33333 reset in 6063 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 : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SharedMemory-PT-000100-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-PT-000100-LTLFireability-04 finished in 19960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1)||G(F(p2))))'
Support contains 10101 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 186 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
[2024-05-28 17:01:49] [INFO ] Invariant cache hit.
[2024-05-28 17:01:50] [INFO ] Implicit Places using invariants in 1406 ms returned []
Implicit Place search using SMT only with invariants took 1413 ms to find 0 implicit places.
[2024-05-28 17:01:51] [INFO ] Invariant cache hit.
[2024-05-28 17:01:52] [INFO ] Dead Transitions using invariants and state equation in 1374 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2986 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (EQ s9351 1) (EQ s9460 1) (EQ s9636 1)) (AND (EQ s9351 1) (EQ s9461 1) (EQ s9715 1)) (AND (EQ s9351 1) (EQ s9412 1) (EQ s9646 1)) (AND (EQ s93...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 2280 steps with 782 reset in 10003 ms.
Stack based approach found an accepted trace after 65 steps with 18 reset with depth 7 and stack size 7 in 286 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-06 finished in 13670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F((X(p1)&&(p2 U p1))))))))'
Support contains 401 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 2719 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
[2024-05-28 17:02:05] [INFO ] Invariant cache hit.
[2024-05-28 17:02:07] [INFO ] Implicit Places using invariants in 1370 ms returned []
Implicit Place search using SMT only with invariants took 1384 ms to find 0 implicit places.
[2024-05-28 17:02:07] [INFO ] Invariant cache hit.
[2024-05-28 17:02:08] [INFO ] Dead Transitions using invariants and state equation in 1444 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5552 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(OR p1 p2), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s9483 1) (EQ s9548 1) (EQ s9487 1) (EQ s9544 1) (EQ s9475 1) (EQ s9479 1) (EQ s9499 1) (EQ s9564 1) (EQ s9503 1) (EQ s9560 1) (EQ s9491 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 11600 steps with 168 reset in 10002 ms.
Stack based approach found an accepted trace after 76 steps with 1 reset with depth 73 and stack size 73 in 67 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-07 finished in 16059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1||X((p2||F(p3)))))))'
Support contains 6 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 2890 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
[2024-05-28 17:02:21] [INFO ] Invariant cache hit.
[2024-05-28 17:02:23] [INFO ] Implicit Places using invariants in 1382 ms returned []
Implicit Place search using SMT only with invariants took 1383 ms to find 0 implicit places.
[2024-05-28 17:02:23] [INFO ] Invariant cache hit.
[2024-05-28 17:02:24] [INFO ] Dead Transitions using invariants and state equation in 1355 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5660 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s466 1), p2:(EQ s7097 1), p3:(AND (EQ s9351 1) (EQ s9527 1) (EQ s9610 1)), p0:(AND (EQ s9527 1) (EQ s10272 1) (EQ s466 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 85150 steps with 439 reset in 10004 ms.
Stack based approach found an accepted trace after 89 steps with 0 reset with depth 90 and stack size 90 in 6 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-10 finished in 15857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Drop transitions removed 9801 transitions
Trivial Post-agglo rules discarded 9801 transitions
Performed 9801 trivial Post agglomeration. Transition count delta: 9801
Iterating post reduction 0 with 9801 rules applied. Total rules applied 9801 place count 10301 transition count 10299
Reduce places removed 9802 places and 0 transitions.
Iterating post reduction 1 with 9802 rules applied. Total rules applied 19603 place count 499 transition count 10299
Drop transitions removed 9702 transitions
Redundant transition composition rules discarded 9702 transitions
Iterating global reduction 2 with 9702 rules applied. Total rules applied 29305 place count 499 transition count 597
Applied a total of 29305 rules in 1755 ms. Remains 499 /10301 variables (removed 9802) and now considering 597/20100 (removed 19503) transitions.
// Phase 1: matrix 597 rows 499 cols
[2024-05-28 17:02:36] [INFO ] Computed 200 invariants in 8 ms
[2024-05-28 17:02:37] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-28 17:02:37] [INFO ] Invariant cache hit.
[2024-05-28 17:02:37] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
[2024-05-28 17:02:37] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-28 17:02:37] [INFO ] Invariant cache hit.
[2024-05-28 17:02:37] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/10301 places, 597/20100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3010 ms. Remains : 499/10301 places, 597/20100 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s278 0)], 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 1214 reset in 1390 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 1 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-12 finished in 4507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Support contains 4 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 147 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2024-05-28 17:02:41] [INFO ] Computed 201 invariants in 2338 ms
[2024-05-28 17:02:43] [INFO ] Implicit Places using invariants in 3676 ms returned []
Implicit Place search using SMT only with invariants took 3686 ms to find 0 implicit places.
[2024-05-28 17:02:43] [INFO ] Invariant cache hit.
[2024-05-28 17:02:44] [INFO ] Dead Transitions using invariants and state equation in 1303 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5151 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SharedMemory-PT-000100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s9351 0) (EQ s9361 0) (EQ s9533 0)), p1:(EQ s9510 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 3550 steps with 3 reset in 10023 ms.
Stack based approach found an accepted trace after 599 steps with 0 reset with depth 600 and stack size 568 in 1281 ms.
FORMULA SharedMemory-PT-000100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000100-LTLFireability-13 finished in 16580 ms.
All properties solved by simple procedures.
Total runtime 392614 ms.

BK_STOP 1716915776964

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SharedMemory-PT-000100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is SharedMemory-PT-000100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r351-tall-171679102600528"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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