fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r461-smll-171701122800067
Last Updated
July 7, 2024

About the Execution of 2023-gold for UtilityControlRoom-COL-Z4T4N02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
394.464 19980.00 37592.00 692.50 FFFFFFFTFFFFFFFF normal

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.r461-smll-171701122800067.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 UtilityControlRoom-COL-Z4T4N02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701122800067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 11K Apr 13 05:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 05:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 13 05:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 13 05:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 05:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 13 05:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 05:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 05:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K 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 UtilityControlRoom-COL-Z4T4N02-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717173396405

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N02
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-31 16:36:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 16:36:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 16:36:38] [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.
[2024-05-31 16:36:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 16:36:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 710 ms
[2024-05-31 16:36:39] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 80 PT places and 150.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 16:36:40] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2024-05-31 16:36:40] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10001 steps, including 2 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 29) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 11 rows 13 cols
[2024-05-31 16:36:41] [INFO ] Computed 5 invariants in 7 ms
[2024-05-31 16:36:41] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-31 16:36:41] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 2 ms.
Successfully simplified 6 atomic propositions for a total of 15 simplifications.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 16:36:41] [INFO ] Flatten gal took : 22 ms
[2024-05-31 16:36:41] [INFO ] Flatten gal took : 4 ms
Domain [Cli(2), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
[2024-05-31 16:36:41] [INFO ] Unfolded HLPN to a Petri net with 80 places and 150 transitions 482 arcs in 24 ms.
[2024-05-31 16:36:41] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Support contains 78 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Applied a total of 0 rules in 10 ms. Remains 80 /80 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 80 cols
[2024-05-31 16:36:41] [INFO ] Computed 7 invariants in 7 ms
[2024-05-31 16:36:41] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 16:36:41] [INFO ] Invariant cache hit.
[2024-05-31 16:36:42] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-31 16:36:42] [INFO ] Invariant cache hit.
[2024-05-31 16:36:42] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 80/80 places, 118/118 transitions.
Support contains 78 out of 80 places after structural reductions.
[2024-05-31 16:36:42] [INFO ] Flatten gal took : 22 ms
[2024-05-31 16:36:42] [INFO ] Flatten gal took : 18 ms
[2024-05-31 16:36:42] [INFO ] Input system was already deterministic with 118 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 16:36:42] [INFO ] Invariant cache hit.
[2024-05-31 16:36:42] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-05-31 16:36:42] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 80 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 48 transition count 78
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 45 transition count 54
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 45 transition count 54
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 39 transition count 48
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 39 transition count 48
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 99 place count 34 transition count 44
Applied a total of 99 rules in 25 ms. Remains 34 /80 variables (removed 46) and now considering 44/118 (removed 74) transitions.
// Phase 1: matrix 44 rows 34 cols
[2024-05-31 16:36:42] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 16:36:42] [INFO ] Implicit Places using invariants in 52 ms returned [26, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/80 places, 44/118 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 32 transition count 36
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 24 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 22 transition count 34
Applied a total of 20 rules in 6 ms. Remains 22 /32 variables (removed 10) and now considering 34/44 (removed 10) transitions.
// Phase 1: matrix 34 rows 22 cols
[2024-05-31 16:36:42] [INFO ] Computed 4 invariants in 1 ms
[2024-05-31 16:36:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-31 16:36:42] [INFO ] Invariant cache hit.
[2024-05-31 16:36:42] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/80 places, 34/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 162 ms. Remains : 22/80 places, 34/118 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 230 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s20 s21) (ADD s10 s11 s12 s13 s14 s15 s16 s17))], 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 7490 reset in 490 ms.
Stack based approach found an accepted trace after 165 steps with 9 reset with depth 13 and stack size 13 in 2 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLCardinality-00 finished in 952 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((p0 U p1)))'
Support contains 11 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 56 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 56 transition count 94
Applied a total of 48 rules in 5 ms. Remains 56 /80 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 56 cols
[2024-05-31 16:36:43] [INFO ] Computed 7 invariants in 2 ms
[2024-05-31 16:36:43] [INFO ] Implicit Places using invariants in 82 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/80 places, 94/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 55/80 places, 94/118 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 2 s40), p0:(LEQ (ADD s41 s42) (ADD s30 s31 s32 s33 s34 s35 s36 s37))], 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]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLCardinality-03 finished in 221 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(G(p0)))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 56 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 56 transition count 94
Applied a total of 48 rules in 4 ms. Remains 56 /80 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-05-31 16:36:43] [INFO ] Invariant cache hit.
[2024-05-31 16:36:44] [INFO ] Implicit Places using invariants in 105 ms returned [40, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 107 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/80 places, 94/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 54/80 places, 94/118 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s42 s43) (ADD s38 s39))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLCardinality-04 finished in 210 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((F(p0)&&F(G(p1)))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 80 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 48 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 48 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 40 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 37 transition count 46
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 37 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 31 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 31 transition count 40
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 25 transition count 28
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 25 transition count 28
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 19 transition count 22
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 19 transition count 22
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 136 place count 19 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 136 place count 19 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 17 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 144 place count 15 transition count 12
Applied a total of 144 rules in 19 ms. Remains 15 /80 variables (removed 65) and now considering 12/118 (removed 106) transitions.
// Phase 1: matrix 12 rows 15 cols
[2024-05-31 16:36:44] [INFO ] Computed 7 invariants in 0 ms
[2024-05-31 16:36:44] [INFO ] Implicit Places using invariants in 33 ms returned [0, 5, 6]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/80 places, 12/118 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 12 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 10 transition count 10
Applied a total of 4 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-31 16:36:44] [INFO ] Computed 4 invariants in 1 ms
[2024-05-31 16:36:44] [INFO ] Implicit Places using invariants in 28 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/80 places, 10/118 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 83 ms. Remains : 8/80 places, 10/118 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s4 s5)), p1:(GT (ADD s4 s5) (ADD s0 s1))], 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 3 reset in 213 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLCardinality-06 finished in 433 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((X((p0&&X(F(p1))))||(p2 U (p3||G(p2)))))))'
Support contains 69 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 80 cols
[2024-05-31 16:36:44] [INFO ] Computed 7 invariants in 2 ms
[2024-05-31 16:36:44] [INFO ] Implicit Places using invariants in 62 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/80 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 79/80 places, 118/118 transitions.
Stuttering acceptance computed with spot in 523 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p2)), true, (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=8 dest: 8}]], initial=5, aps=[p1:(OR (GT 3 s64) (GT (ADD s6 s7 s8 s9 s10 s11 s12 s13) (ADD s71 s72 s73 s74 s75 s76 s77 s78))), p3:(AND (GT (ADD s14 s15 s16 s17 s18 s19 s20 s21) (ADD s2...], 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13683 reset in 287 ms.
Product exploration explored 100000 steps with 13646 reset in 372 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) (NOT p3) (NOT p2) p0)]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2))))]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), true, (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 118 rows 79 cols
[2024-05-31 16:36:46] [INFO ] Computed 6 invariants in 2 ms
[2024-05-31 16:36:46] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-31 16:36:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 16:36:46] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) p0), (G (NOT (AND (NOT p0) p2 (NOT p3)))), (G (NOT (AND (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p1), (F (AND p0 p2 (NOT p3))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (AND p2 (NOT p3))), (F (NOT p0)), (F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 3 factoid took 449 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), true]
Stuttering acceptance computed with spot in 333 ms :[(NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), true]
[2024-05-31 16:36:47] [INFO ] Invariant cache hit.
[2024-05-31 16:36:48] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-31 16:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:36:48] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-31 16:36:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:36:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 16:36:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:36:48] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-31 16:36:48] [INFO ] Computed and/alt/rep : 116/178/116 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-31 16:36:48] [INFO ] Added : 59 causal constraints over 12 iterations in 192 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Support contains 69 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-31 16:36:48] [INFO ] Invariant cache hit.
[2024-05-31 16:36:48] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-31 16:36:48] [INFO ] Invariant cache hit.
[2024-05-31 16:36:48] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-31 16:36:48] [INFO ] Invariant cache hit.
[2024-05-31 16:36:48] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 79/79 places, 118/118 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 : [(AND (NOT p1) (NOT p3) p0 (NOT p2))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3)))))]
Knowledge based reduction with 1 factoid took 221 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 8 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Finished random walk after 11 steps, including 0 resets, run visited all 8 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0 (NOT p2))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (F (AND p2 (NOT p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (AND p0 p2 (NOT p3))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F p1), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 1 factoid took 377 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 8 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 419 ms :[(NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
[2024-05-31 16:36:50] [INFO ] Invariant cache hit.
[2024-05-31 16:36:50] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 16:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:36:50] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-31 16:36:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:36:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 16:36:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:36:50] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-31 16:36:51] [INFO ] Computed and/alt/rep : 116/178/116 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-31 16:36:51] [INFO ] Added : 59 causal constraints over 12 iterations in 152 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Product exploration explored 100000 steps with 13681 reset in 236 ms.
Product exploration explored 100000 steps with 13675 reset in 222 ms.
Applying partial POR strategy [true, true, false, false, false, false, true, false]
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Support contains 69 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-31 16:36:52] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 16:36:52] [INFO ] Invariant cache hit.
[2024-05-31 16:36:52] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 79/79 places, 118/118 transitions.
Built C files in :
/tmp/ltsmin13851836159198339891
[2024-05-31 16:36:52] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13851836159198339891
Running compilation step : cd /tmp/ltsmin13851836159198339891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 469 ms.
Running link step : cd /tmp/ltsmin13851836159198339891;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin13851836159198339891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9473072953104007226.hoa' '--buchi-type=spotba'
LTSmin run took 378 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLCardinality-07 finished in 8948 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(G(p0)))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 56 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 56 transition count 94
Applied a total of 48 rules in 4 ms. Remains 56 /80 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 56 cols
[2024-05-31 16:36:53] [INFO ] Computed 7 invariants in 1 ms
[2024-05-31 16:36:53] [INFO ] Implicit Places using invariants in 101 ms returned [40, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 104 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/80 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 54/80 places, 94/118 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 (ADD s42 s43))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLCardinality-09 finished in 211 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 U G(p0)))&&G(F(p1))))'
Support contains 43 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 80 transition count 110
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 72 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 70 transition count 108
Applied a total of 20 rules in 9 ms. Remains 70 /80 variables (removed 10) and now considering 108/118 (removed 10) transitions.
// Phase 1: matrix 108 rows 70 cols
[2024-05-31 16:36:53] [INFO ] Computed 7 invariants in 2 ms
[2024-05-31 16:36:53] [INFO ] Implicit Places using invariants in 85 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/80 places, 108/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 69 /69 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 69/80 places, 108/118 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s54 (ADD s55 s56)), p1:(LEQ (ADD s61 s62 s63 s64 s65 s66 s67 s68) (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLCardinality-10 finished in 363 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(p0)))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 80 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 48 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 48 transition count 70
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 40 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 37 transition count 46
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 37 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 31 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 31 transition count 40
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 25 transition count 28
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 25 transition count 28
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 19 transition count 22
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 19 transition count 22
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 136 place count 19 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 136 place count 19 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 17 transition count 14
Applied a total of 140 rules in 21 ms. Remains 17 /80 variables (removed 63) and now considering 14/118 (removed 104) transitions.
// Phase 1: matrix 14 rows 17 cols
[2024-05-31 16:36:54] [INFO ] Computed 7 invariants in 1 ms
[2024-05-31 16:36:54] [INFO ] Implicit Places using invariants in 38 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/80 places, 14/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61 ms. Remains : 16/80 places, 14/118 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s6 s7)], 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 93 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLCardinality-11 finished in 204 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(F(p0)))'
Support contains 12 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 80 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 48 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 48 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 40 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 37 transition count 46
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 37 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 35 transition count 44
Applied a total of 98 rules in 7 ms. Remains 35 /80 variables (removed 45) and now considering 44/118 (removed 74) transitions.
// Phase 1: matrix 44 rows 35 cols
[2024-05-31 16:36:54] [INFO ] Computed 7 invariants in 1 ms
[2024-05-31 16:36:54] [INFO ] Implicit Places using invariants in 64 ms returned [0, 19, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 65 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/80 places, 44/118 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 32 transition count 36
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 24 transition count 36
Applied a total of 16 rules in 3 ms. Remains 24 /32 variables (removed 8) and now considering 36/44 (removed 8) transitions.
// Phase 1: matrix 36 rows 24 cols
[2024-05-31 16:36:54] [INFO ] Computed 4 invariants in 1 ms
[2024-05-31 16:36:54] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-31 16:36:54] [INFO ] Invariant cache hit.
[2024-05-31 16:36:54] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/80 places, 36/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 143 ms. Remains : 24/80 places, 36/118 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ (ADD s10 s11) (ADD s14 s15)) (LEQ 3 (ADD s16 s17 s18 s19 s20 s21 s22 s23)))], 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 8023 reset in 188 ms.
Stack based approach found an accepted trace after 39 steps with 2 reset with depth 16 and stack size 16 in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLCardinality-12 finished in 422 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(G((p0&&X(p1)))))'
Support contains 14 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 56 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 56 transition count 94
Applied a total of 48 rules in 2 ms. Remains 56 /80 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 56 cols
[2024-05-31 16:36:54] [INFO ] Computed 7 invariants in 1 ms
[2024-05-31 16:36:54] [INFO ] Implicit Places using invariants in 93 ms returned [40, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 100 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/80 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 54/80 places, 94/118 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 2 (ADD s44 s45)), p1:(OR (GT (ADD s40 s41) (ADD s46 s47 s48 s49 s50 s51 s52 s53)) (LEQ 1 (ADD s38 s39)))], 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 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLCardinality-14 finished in 344 ms.
All properties solved by simple procedures.
Total runtime 16213 ms.

BK_STOP 1717173416385

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-COL-Z4T4N02"
export BK_EXAMINATION="LTLCardinality"
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 UtilityControlRoom-COL-Z4T4N02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r461-smll-171701122800067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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