fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r197-smll-167840343800164
Last Updated
May 14, 2023

About the Execution of ITS-Tools for GlobalResAllocation-COL-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
424.756 24479.00 41002.00 584.10 FTFFFTTTFTFFTTFF normal

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.r197-smll-167840343800164.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 GlobalResAllocation-COL-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840343800164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 8.1K Feb 25 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 18:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 18:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 28K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-00
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-01
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-02
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-03
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-04
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-05
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-06
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-07
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-08
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-09
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-10
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-11
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-12
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-13
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-14
FORMULA_NAME GlobalResAllocation-COL-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678499536423

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GlobalResAllocation-COL-03
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-11 01:52:19] [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]
[2023-03-11 01:52:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 01:52:20] [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-11 01:52:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 01:52:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 715 ms
[2023-03-11 01:52:20] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 33 PT places and 4791.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 01:52:21] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 6 ms.
[2023-03-11 01:52:21] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA GlobalResAllocation-COL-03-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 4 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=0 )
[2023-03-11 01:52:21] [INFO ] Flatten gal took : 32 ms
[2023-03-11 01:52:21] [INFO ] Flatten gal took : 5 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Res
Symmetric sort wr.t. initial detected :Res
Symmetric sort wr.t. initial and guards detected :Res
Applying symmetric unfolding of full symmetric sort :Res domain size was 6
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2023-03-11 01:52:21] [INFO ] Unfolded HLPN to a Petri net with 13 places and 21 transitions 87 arcs in 28 ms.
[2023-03-11 01:52:21] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA GlobalResAllocation-COL-03-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 21/21 transitions.
Reduce isomorphic (modulo) transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 13 transition count 18
Applied a total of 6 rules in 14 ms. Remains 13 /13 variables (removed 0) and now considering 18/21 (removed 3) transitions.
// Phase 1: matrix 18 rows 13 cols
[2023-03-11 01:52:21] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-11 01:52:21] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
[2023-03-11 01:52:21] [INFO ] Invariant cache hit.
[2023-03-11 01:52:21] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-11 01:52:21] [INFO ] Invariant cache hit.
[2023-03-11 01:52:21] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-11 01:52:21] [INFO ] Invariant cache hit.
[2023-03-11 01:52:21] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 13/13 places, 18/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 13/13 places, 18/21 transitions.
Support contains 13 out of 13 places after structural reductions.
[2023-03-11 01:52:21] [INFO ] Flatten gal took : 10 ms
[2023-03-11 01:52:21] [INFO ] Flatten gal took : 11 ms
[2023-03-11 01:52:22] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 17 steps, including 0 resets, run visited all 12 properties in 6 ms. (steps per millisecond=2 )
FORMULA GlobalResAllocation-COL-03-LTLFireability-03 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 18
Applied a total of 3 rules in 2 ms. Remains 10 /13 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 10 cols
[2023-03-11 01:52:22] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 01:52:22] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
[2023-03-11 01:52:22] [INFO ] Invariant cache hit.
[2023-03-11 01:52:22] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-11 01:52:22] [INFO ] Invariant cache hit.
[2023-03-11 01:52:22] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-11 01:52:22] [INFO ] Invariant cache hit.
[2023-03-11 01:52:22] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 10/13 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 10/13 places, 18/18 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s3 3)) (AND (GEQ s2 1) (GEQ s3 3)) (AND (GEQ s0 1) (GEQ s3 3))), p0:(AND (OR (LT s1 1) (LT s3 2)) (OR (LT s2 1) (LT s3 2)) (OR...], 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 explored 100000 steps with 28201 reset in 560 ms.
Stack based approach found an accepted trace after 71 steps with 18 reset with depth 4 and stack size 4 in 1 ms.
FORMULA GlobalResAllocation-COL-03-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-03-LTLFireability-00 finished in 1220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 10 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 13 cols
[2023-03-11 01:52:23] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 01:52:23] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-11 01:52:23] [INFO ] Invariant cache hit.
[2023-03-11 01:52:23] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 01:52:23] [INFO ] Invariant cache hit.
[2023-03-11 01:52:23] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-11 01:52:23] [INFO ] Invariant cache hit.
[2023-03-11 01:52:23] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 13/13 places, 18/18 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s2 1) (GEQ s3 1)) (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s3 1))), p0:(AND (OR (LT s4 1) (LT s7 1)) (OR (LT s5 1) (LT s8 1)) (OR...], 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 explored 100000 steps with 50000 reset in 242 ms.
Product exploration explored 100000 steps with 50000 reset in 371 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 (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 333 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-03-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-03-LTLFireability-01 finished in 1206 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(G(p0))))'
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 18
Applied a total of 3 rules in 1 ms. Remains 10 /13 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 10 cols
[2023-03-11 01:52:25] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 01:52:25] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-11 01:52:25] [INFO ] Invariant cache hit.
[2023-03-11 01:52:25] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-11 01:52:25] [INFO ] Invariant cache hit.
[2023-03-11 01:52:25] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-11 01:52:25] [INFO ] Invariant cache hit.
[2023-03-11 01:52:25] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 10/13 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 10/13 places, 18/18 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s7 4) (LT s8 4) (LT s9 4))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA GlobalResAllocation-COL-03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-03-LTLFireability-02 finished in 334 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(G(p0))))'
Support contains 10 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 13 cols
[2023-03-11 01:52:25] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-11 01:52:25] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
[2023-03-11 01:52:25] [INFO ] Invariant cache hit.
[2023-03-11 01:52:25] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-11 01:52:25] [INFO ] Invariant cache hit.
[2023-03-11 01:52:25] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-11 01:52:25] [INFO ] Invariant cache hit.
[2023-03-11 01:52:25] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 13/13 places, 18/18 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (AND (GEQ s1 1) (GEQ s3 3)) (AND (GEQ s2 1) (GEQ s3 3)) (AND (GEQ s0 1) (GEQ s3 3))) (OR (AND (GEQ s4 1) (GEQ s7 1)) (AND (GEQ s5 1) (GEQ s8 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-03-LTLFireability-04 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0) U X(G(p1))) U X(p0)))'
Support contains 9 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-11 01:52:25] [INFO ] Invariant cache hit.
[2023-03-11 01:52:25] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
[2023-03-11 01:52:25] [INFO ] Invariant cache hit.
[2023-03-11 01:52:25] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-11 01:52:25] [INFO ] Invariant cache hit.
[2023-03-11 01:52:25] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-11 01:52:25] [INFO ] Invariant cache hit.
[2023-03-11 01:52:25] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 13/13 places, 18/18 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(OR (AND (GEQ s4 2) (GEQ s7 2)) (AND (GEQ s5 2) (GEQ s8 2)) (AND (GEQ s6 2) (GEQ s9 2))), p0:(AND (LT s10 4) (LT s11 4) (LT s12 4))], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 277 ms.
Product exploration explored 100000 steps with 50000 reset in 220 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 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 277 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-03-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-03-LTLFireability-05 finished in 1331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 18
Applied a total of 3 rules in 1 ms. Remains 10 /13 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 10 cols
[2023-03-11 01:52:27] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 01:52:27] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-11 01:52:27] [INFO ] Invariant cache hit.
[2023-03-11 01:52:27] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 01:52:27] [INFO ] Invariant cache hit.
[2023-03-11 01:52:27] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-11 01:52:27] [INFO ] Invariant cache hit.
[2023-03-11 01:52:27] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 10/13 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 10/13 places, 18/18 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : GlobalResAllocation-COL-03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s3 3)) (AND (GEQ s2 1) (GEQ s3 3)) (AND (GEQ s0 1) (GEQ s3 3))), p1:(OR (AND (GEQ s1 1) (GEQ s3 2)) (AND (GEQ s2 1) (GEQ s3 2)...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 250 ms.
Product exploration explored 100000 steps with 50000 reset in 305 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 p0 p1), (X p1), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-03-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-03-LTLFireability-06 finished in 1103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((!p0&&X(!p0)&&F(p1)))))))'
Support contains 10 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 13 cols
[2023-03-11 01:52:28] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-11 01:52:28] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
[2023-03-11 01:52:28] [INFO ] Invariant cache hit.
[2023-03-11 01:52:28] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-11 01:52:28] [INFO ] Invariant cache hit.
[2023-03-11 01:52:28] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-11 01:52:28] [INFO ] Invariant cache hit.
[2023-03-11 01:52:28] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 13/13 places, 18/18 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-03-LTLFireability-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=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s4 1) (LT s7 1)) (OR (LT s5 1) (LT s8 1)) (OR (LT s6 1) (LT s9 1))), p1:(OR (AND (GEQ s1 1) (GEQ s3 2)) (AND (GEQ s2 1) (GEQ s3 2)) (AND (...], nbAcceptance=0, 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 explored 100000 steps with 17561 reset in 240 ms.
Stack based approach found an accepted trace after 2651 steps with 466 reset with depth 7 and stack size 7 in 12 ms.
FORMULA GlobalResAllocation-COL-03-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-03-LTLFireability-08 finished in 815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U p1))||(F(!p2)&&((p0 U p1)||F(G(p1)))))))'
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Ensure Unique test removed 3 places
Applied a total of 0 rules in 9 ms. Remains 10 /13 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 10 cols
[2023-03-11 01:52:29] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 01:52:29] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-11 01:52:29] [INFO ] Invariant cache hit.
[2023-03-11 01:52:29] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-11 01:52:29] [INFO ] Invariant cache hit.
[2023-03-11 01:52:29] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-11 01:52:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 01:52:29] [INFO ] Invariant cache hit.
[2023-03-11 01:52:29] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 10/13 places, 18/18 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : GlobalResAllocation-COL-03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s3 2)) (AND (GEQ s2 1) (GEQ s3 2)) (AND (GEQ s0 1) (GEQ s3 2))), p0:(OR (AND (GEQ s2 1) (GEQ s3 1)) (AND (GEQ s0 1) (GEQ s3 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 31399 reset in 361 ms.
Product exploration explored 100000 steps with 31272 reset in 361 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 p2), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (OR (AND p2 p1) (AND p2 p0))), (X (NOT (OR (AND p2 p1) (AND p2 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR (AND p2 p1) (AND p2 p0)))), (X (X (NOT (OR (AND p2 p1) (AND p2 p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 7 factoid took 781 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 01:52:31] [INFO ] Invariant cache hit.
[2023-03-11 01:52:31] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (OR (AND p2 p1) (AND p2 p0))), (X (NOT (OR (AND p2 p1) (AND p2 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR (AND p2 p1) (AND p2 p0)))), (X (X (NOT (OR (AND p2 p1) (AND p2 p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (OR (AND p0 p2) (AND p1 p2))))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1) p2)))
Knowledge based reduction with 9 factoid took 445 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-03-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-03-LTLFireability-09 finished in 3302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((X(F(p0))||(!p1 U p2)))))))'
Support contains 10 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 13 cols
[2023-03-11 01:52:32] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-11 01:52:32] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
[2023-03-11 01:52:32] [INFO ] Invariant cache hit.
[2023-03-11 01:52:32] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-11 01:52:32] [INFO ] Invariant cache hit.
[2023-03-11 01:52:32] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-11 01:52:32] [INFO ] Invariant cache hit.
[2023-03-11 01:52:32] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 13/13 places, 18/18 transitions.
Stuttering acceptance computed with spot in 374 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GlobalResAllocation-COL-03-LTLFireability-10 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=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s1 1) (GEQ s3 4)) (AND (GEQ s2 1) (GEQ s3 4)) (AND (GEQ s0 1) (GEQ s3 4))), p1:(AND (OR (LT s4 1) (LT s7 1)) (OR (LT s5 1) (LT s8 1)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11895 reset in 311 ms.
Stack based approach found an accepted trace after 144 steps with 16 reset with depth 10 and stack size 9 in 0 ms.
FORMULA GlobalResAllocation-COL-03-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-03-LTLFireability-10 finished in 920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U !p1) U !p2))))'
Support contains 10 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-11 01:52:33] [INFO ] Invariant cache hit.
[2023-03-11 01:52:33] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-11 01:52:33] [INFO ] Invariant cache hit.
[2023-03-11 01:52:33] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-11 01:52:33] [INFO ] Invariant cache hit.
[2023-03-11 01:52:33] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-11 01:52:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 01:52:33] [INFO ] Invariant cache hit.
[2023-03-11 01:52:33] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 13/13 places, 18/18 transitions.
Stuttering acceptance computed with spot in 178 ms :[p2, p2, (AND p1 p2)]
Running random walk in product with property : GlobalResAllocation-COL-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 (NOT p1)) (AND p2 p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p2 p1 p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p1)) (AND p2 p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s4 1) (GEQ s7 1)) (AND (GEQ s5 1) (GEQ s8 1)) (AND (GEQ s6 1) (GEQ s9 1)) (AND (GEQ s2 1) (GEQ s3 1)) (AND (GEQ s0 1) (GEQ s3 1)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3293 reset in 452 ms.
Stack based approach found an accepted trace after 15 steps with 2 reset with depth 12 and stack size 12 in 0 ms.
FORMULA GlobalResAllocation-COL-03-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-03-LTLFireability-11 finished in 834 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 6 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-11 01:52:34] [INFO ] Invariant cache hit.
[2023-03-11 01:52:34] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
[2023-03-11 01:52:34] [INFO ] Invariant cache hit.
[2023-03-11 01:52:34] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-11 01:52:34] [INFO ] Invariant cache hit.
[2023-03-11 01:52:34] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-11 01:52:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 01:52:34] [INFO ] Invariant cache hit.
[2023-03-11 01:52:34] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 13/13 places, 18/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[p0, p0]
Running random walk in product with property : GlobalResAllocation-COL-03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s4 1) (LT s7 1)) (OR (LT s5 1) (LT s8 1)) (OR (LT s6 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3664 reset in 216 ms.
Product exploration explored 100000 steps with 3541 reset in 238 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 : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 326 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[p0, p0]
Stuttering acceptance computed with spot in 100 ms :[p0, p0]
[2023-03-11 01:52:35] [INFO ] Invariant cache hit.
[2023-03-11 01:52:35] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-11 01:52:35] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-11 01:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:52:35] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-11 01:52:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:52:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 01:52:35] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-11 01:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:52:35] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-11 01:52:35] [INFO ] Computed and/alt/rep : 6/36/6 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 01:52:35] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG p0
Support contains 6 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-11 01:52:35] [INFO ] Invariant cache hit.
[2023-03-11 01:52:35] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
[2023-03-11 01:52:35] [INFO ] Invariant cache hit.
[2023-03-11 01:52:35] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-11 01:52:35] [INFO ] Invariant cache hit.
[2023-03-11 01:52:36] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-11 01:52:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 01:52:36] [INFO ] Invariant cache hit.
[2023-03-11 01:52:36] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 13/13 places, 18/18 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 : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[p0, p0]
Stuttering acceptance computed with spot in 101 ms :[p0, p0]
[2023-03-11 01:52:36] [INFO ] Invariant cache hit.
[2023-03-11 01:52:36] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-11 01:52:36] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-11 01:52:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:52:36] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-11 01:52:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:52:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-11 01:52:36] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-11 01:52:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:52:36] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-11 01:52:36] [INFO ] Computed and/alt/rep : 6/36/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 01:52:36] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 101 ms :[p0, p0]
Product exploration explored 100000 steps with 3590 reset in 218 ms.
Product exploration explored 100000 steps with 3526 reset in 245 ms.
Built C files in :
/tmp/ltsmin12623700330351911445
[2023-03-11 01:52:37] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2023-03-11 01:52:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 01:52:37] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2023-03-11 01:52:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 01:52:37] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2023-03-11 01:52:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 01:52:37] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12623700330351911445
Running compilation step : cd /tmp/ltsmin12623700330351911445;'/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 389 ms.
Running link step : cd /tmp/ltsmin12623700330351911445;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin12623700330351911445;'/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/stateBased2787792558285727640.hoa' '--buchi-type=spotba'
LTSmin run took 142 ms.
FORMULA GlobalResAllocation-COL-03-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GlobalResAllocation-COL-03-LTLFireability-12 finished in 4160 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((X(((!p0&&G(!p1)) U ((G(!p1)&&p2)||G((!p0&&G(!p1))))))||p3))))'
Support contains 13 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-11 01:52:38] [INFO ] Invariant cache hit.
[2023-03-11 01:52:38] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-03-11 01:52:38] [INFO ] Invariant cache hit.
[2023-03-11 01:52:38] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-11 01:52:38] [INFO ] Invariant cache hit.
[2023-03-11 01:52:38] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-11 01:52:38] [INFO ] Invariant cache hit.
[2023-03-11 01:52:38] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 13/13 places, 18/18 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Running random walk in product with property : GlobalResAllocation-COL-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 p3) (AND p0 (NOT p2) p3)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=1 dest: 1}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p2) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p3), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 2}]], initial=1, aps=[p3:(AND (LT s10 4) (LT s11 4) (LT s12 4)), p1:(OR (AND (GEQ s1 1) (GEQ s3 3)) (AND (GEQ s2 1) (GEQ s3 3)) (AND (GEQ s0 1) (GEQ s3 3))), p0:(OR (AND (GEQ s...], 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]]
Product exploration explored 100000 steps with 0 reset in 560 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA GlobalResAllocation-COL-03-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-03-LTLFireability-14 finished in 1000 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 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Ensure Unique test removed 3 places
Applied a total of 0 rules in 7 ms. Remains 10 /13 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 10 cols
[2023-03-11 01:52:39] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 01:52:39] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-11 01:52:39] [INFO ] Invariant cache hit.
[2023-03-11 01:52:39] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 01:52:39] [INFO ] Invariant cache hit.
[2023-03-11 01:52:39] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-11 01:52:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 01:52:39] [INFO ] Invariant cache hit.
[2023-03-11 01:52:39] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 10/13 places, 18/18 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s1 1) (GEQ s3 4)) (AND (GEQ s2 1) (GEQ s3 4)) (AND (GEQ s0 1) (GEQ s3 4))) (OR (AND (OR (LT s2 1) (LT s3 1)) (OR (LT s0 1) (LT s3 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 260 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA GlobalResAllocation-COL-03-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-03-LTLFireability-15 finished in 512 ms.
All properties solved by simple procedures.
Total runtime 19739 ms.

BK_STOP 1678499560902

--------------------
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:
++ 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 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="GlobalResAllocation-COL-03"
export BK_EXAMINATION="LTLFireability"
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 GlobalResAllocation-COL-03, 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 r197-smll-167840343800164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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