About the Execution of 2023-gold for UtilityControlRoom-COL-Z2T4N08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1850.604 | 71041.00 | 185578.00 | 828.50 | TTFTTFTFFTTTTFFF | 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-171701122700042.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-Z2T4N08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701122700042
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.6K Apr 13 05:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 13 05:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 13 05:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 05:07 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.8K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 05:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 05:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 13 05:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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-Z2T4N08-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717172063395
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-Z2T4N08
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-31 16:14:26] [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:14:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 16:14:27] [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:14:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 16:14:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1105 ms
[2024-05-31 16:14:28] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 140 PT places and 216.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 16:14:28] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 9 ms.
[2024-05-31 16:14:28] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 5 formulas.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 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 586 ms. (steps per millisecond=17 ) properties (out of 21) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 11 rows 13 cols
[2024-05-31 16:14:29] [INFO ] Computed 5 invariants in 6 ms
[2024-05-31 16:14:29] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-31 16:14:29] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 16:14:29] [INFO ] Flatten gal took : 20 ms
[2024-05-31 16:14:29] [INFO ] Flatten gal took : 5 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2024-05-31 16:14:29] [INFO ] Unfolded HLPN to a Petri net with 140 places and 216 transitions 680 arcs in 21 ms.
[2024-05-31 16:14:29] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Support contains 132 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 11 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-05-31 16:14:29] [INFO ] Computed 19 invariants in 13 ms
[2024-05-31 16:14:29] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-31 16:14:29] [INFO ] Invariant cache hit.
[2024-05-31 16:14:30] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-31 16:14:30] [INFO ] Invariant cache hit.
[2024-05-31 16:14:30] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 580 ms. Remains : 140/140 places, 184/184 transitions.
Support contains 132 out of 140 places after structural reductions.
[2024-05-31 16:14:30] [INFO ] Flatten gal took : 32 ms
[2024-05-31 16:14:30] [INFO ] Flatten gal took : 43 ms
[2024-05-31 16:14:30] [INFO ] Input system was already deterministic with 184 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 16:14:30] [INFO ] Invariant cache hit.
[2024-05-31 16:14:31] [INFO ] After 151ms 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 9 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' '!(F((p0||X(F((p1||G(F(p2))))))))'
Support contains 51 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2024-05-31 16:14:31] [INFO ] Invariant cache hit.
[2024-05-31 16:14:31] [INFO ] Implicit Places using invariants in 126 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/140 places, 184/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 139/140 places, 184/184 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 429 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25)), p1:(LEQ s98 (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 20115 reset in 883 ms.
Product exploration explored 100000 steps with 20167 reset in 678 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 p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 541 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :2
Finished Best-First random walk after 315 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=157 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 584 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 545 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 925 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Support contains 51 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 139 transition count 168
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 123 transition count 168
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 48 place count 115 transition count 160
Applied a total of 48 rules in 74 ms. Remains 115 /139 variables (removed 24) and now considering 160/184 (removed 24) transitions.
// Phase 1: matrix 160 rows 115 cols
[2024-05-31 16:14:37] [INFO ] Computed 18 invariants in 23 ms
[2024-05-31 16:14:37] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-31 16:14:37] [INFO ] Invariant cache hit.
[2024-05-31 16:14:37] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-31 16:14:37] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-31 16:14:37] [INFO ] Invariant cache hit.
[2024-05-31 16:14:37] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/139 places, 160/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 631 ms. Remains : 115/139 places, 160/184 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 p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 13 factoid took 674 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 522 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :2
Finished Best-First random walk after 238 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=119 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 1081 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 562 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 535 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 629 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Product exploration explored 100000 steps with 40408 reset in 678 ms.
Product exploration explored 100000 steps with 40467 reset in 520 ms.
Built C files in :
/tmp/ltsmin995009173533114330
[2024-05-31 16:14:43] [INFO ] Computing symmetric may disable matrix : 160 transitions.
[2024-05-31 16:14:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:14:43] [INFO ] Computing symmetric may enable matrix : 160 transitions.
[2024-05-31 16:14:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:14:43] [INFO ] Computing Do-Not-Accords matrix : 160 transitions.
[2024-05-31 16:14:43] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:14:43] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin995009173533114330
Running compilation step : cd /tmp/ltsmin995009173533114330;'/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 921 ms.
Running link step : cd /tmp/ltsmin995009173533114330;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin995009173533114330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased192702287174309063.hoa' '--buchi-type=spotba'
LTSmin run took 893 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-01 finished in 13854 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 8 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 19 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-05-31 16:14:45] [INFO ] Computed 19 invariants in 4 ms
[2024-05-31 16:14:45] [INFO ] Implicit Places using invariants in 177 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 179 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 205 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-02 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 1 (ADD s74 s75 s76 s77 s78 s79 s80 s81))], 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-Z2T4N08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-02 finished in 351 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(F(p0)))'
Support contains 17 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 10 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-31 16:14:45] [INFO ] Invariant cache hit.
[2024-05-31 16:14:45] [INFO ] Implicit Places using invariants in 97 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25) s82)], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 273 ms.
Product exploration explored 100000 steps with 50000 reset in 327 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 p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-03 finished in 839 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(F(!p0)))'
Support contains 8 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 8 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-31 16:14:46] [INFO ] Invariant cache hit.
[2024-05-31 16:14:46] [INFO ] Implicit Places using invariants in 153 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 155 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 189 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s74 s75 s76 s77 s78 s79 s80 s81))], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Product exploration explored 100000 steps with 50000 reset in 282 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)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-04 finished in 823 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)||G(p1)||G(p2))))'
Support contains 33 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 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 140 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 108 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 108 transition count 120
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 92 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 91 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 91 transition count 104
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 122 place count 83 transition count 96
Iterating global reduction 2 with 8 rules applied. Total rules applied 130 place count 83 transition count 96
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 138 place count 75 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 146 place count 75 transition count 80
Applied a total of 146 rules in 33 ms. Remains 75 /140 variables (removed 65) and now considering 80/184 (removed 104) transitions.
// Phase 1: matrix 80 rows 75 cols
[2024-05-31 16:14:47] [INFO ] Computed 19 invariants in 2 ms
[2024-05-31 16:14:47] [INFO ] Implicit Places using invariants in 101 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/140 places, 80/184 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 66 transition count 72
Applied a total of 16 rules in 8 ms. Remains 66 /74 variables (removed 8) and now considering 72/80 (removed 8) transitions.
// Phase 1: matrix 72 rows 66 cols
[2024-05-31 16:14:47] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 16:14:47] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 16:14:47] [INFO ] Invariant cache hit.
[2024-05-31 16:14:47] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/140 places, 72/184 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 357 ms. Remains : 66/140 places, 72/184 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s33 s34 s35 s36 s37 s38 s39 s40) (ADD s50 s51 s52 s53 s54 s55 s56 s57)), p1:(LEQ 3 s41), p2:(LEQ 2 (ADD s9 s10 s11 s12 s13 s14 s15 s16 s17 s1...], nbAcceptance=3, 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 887 ms.
Stack based approach found an accepted trace after 2774 steps with 0 reset with depth 2775 and stack size 2774 in 25 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-07 finished in 1353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(F(p1)&&F(p0)))))))'
Support contains 40 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 3 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-05-31 16:14:48] [INFO ] Computed 19 invariants in 2 ms
[2024-05-31 16:14:48] [INFO ] Implicit Places using invariants in 103 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s...], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 72 reset in 255 ms.
Stack based approach found an accepted trace after 5106 steps with 5 reset with depth 5020 and stack size 5020 in 18 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-08 finished in 675 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((G(p1)||p0))))'
Support contains 26 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 48 place count 116 transition count 160
Applied a total of 48 rules in 13 ms. Remains 116 /140 variables (removed 24) and now considering 160/184 (removed 24) transitions.
// Phase 1: matrix 160 rows 116 cols
[2024-05-31 16:14:49] [INFO ] Computed 19 invariants in 2 ms
[2024-05-31 16:14:49] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-31 16:14:49] [INFO ] Invariant cache hit.
[2024-05-31 16:14:49] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-31 16:14:49] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 16:14:49] [INFO ] Invariant cache hit.
[2024-05-31 16:14:49] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/140 places, 160/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 514 ms. Remains : 116/140 places, 160/184 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 (ADD s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41)), p0:(OR (GT s75 s74) (GT 3 (ADD s84 s85 s86 s87 s88 s89 s90 s91)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 253 ms.
Product exploration explored 100000 steps with 0 reset in 352 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 p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :1
Finished Best-First random walk after 74 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=74 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 26 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 160/160 transitions.
Applied a total of 0 rules in 9 ms. Remains 116 /116 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-31 16:14:51] [INFO ] Invariant cache hit.
[2024-05-31 16:14:51] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-31 16:14:51] [INFO ] Invariant cache hit.
[2024-05-31 16:14:51] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-31 16:14:51] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-31 16:14:51] [INFO ] Invariant cache hit.
[2024-05-31 16:14:51] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 583 ms. Remains : 116/116 places, 160/160 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 2) seen :1
Finished Best-First random walk after 80 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 191 ms.
Product exploration explored 100000 steps with 0 reset in 551 ms.
Built C files in :
/tmp/ltsmin17296363391246612252
[2024-05-31 16:14:53] [INFO ] Computing symmetric may disable matrix : 160 transitions.
[2024-05-31 16:14:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:14:53] [INFO ] Computing symmetric may enable matrix : 160 transitions.
[2024-05-31 16:14:53] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:14:53] [INFO ] Computing Do-Not-Accords matrix : 160 transitions.
[2024-05-31 16:14:53] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:14:53] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17296363391246612252
Running compilation step : cd /tmp/ltsmin17296363391246612252;'/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 721 ms.
Running link step : cd /tmp/ltsmin17296363391246612252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17296363391246612252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16072183535714925791.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 26 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 160/160 transitions.
Applied a total of 0 rules in 6 ms. Remains 116 /116 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-31 16:15:08] [INFO ] Invariant cache hit.
[2024-05-31 16:15:08] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 16:15:08] [INFO ] Invariant cache hit.
[2024-05-31 16:15:08] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-05-31 16:15:08] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 16:15:08] [INFO ] Invariant cache hit.
[2024-05-31 16:15:09] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 486 ms. Remains : 116/116 places, 160/160 transitions.
Built C files in :
/tmp/ltsmin10388494936882823795
[2024-05-31 16:15:09] [INFO ] Computing symmetric may disable matrix : 160 transitions.
[2024-05-31 16:15:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:15:09] [INFO ] Computing symmetric may enable matrix : 160 transitions.
[2024-05-31 16:15:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:15:09] [INFO ] Computing Do-Not-Accords matrix : 160 transitions.
[2024-05-31 16:15:09] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:15:09] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10388494936882823795
Running compilation step : cd /tmp/ltsmin10388494936882823795;'/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 749 ms.
Running link step : cd /tmp/ltsmin10388494936882823795;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10388494936882823795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased587614619456264255.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 16:15:24] [INFO ] Flatten gal took : 32 ms
[2024-05-31 16:15:24] [INFO ] Flatten gal took : 13 ms
[2024-05-31 16:15:24] [INFO ] Time to serialize gal into /tmp/LTL18110304982712521208.gal : 4 ms
[2024-05-31 16:15:24] [INFO ] Time to serialize properties into /tmp/LTL16011616440794504256.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18110304982712521208.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15070668892958448271.hoa' '-atoms' '/tmp/LTL16011616440794504256.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16011616440794504256.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15070668892958448271.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
572 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.7757,149980,1,0,21,799233,34,6,3403,258492,60
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-09 finished in 41546 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((F(p0)||X(G(p1)))))'
Support contains 49 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 1 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-05-31 16:15:30] [INFO ] Computed 19 invariants in 2 ms
[2024-05-31 16:15:30] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-31 16:15:30] [INFO ] Invariant cache hit.
[2024-05-31 16:15:31] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-31 16:15:31] [INFO ] Invariant cache hit.
[2024-05-31 16:15:31] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 767 ms. Remains : 140/140 places, 184/184 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 s99), p1:(GT (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s7...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Product exploration explored 100000 steps with 50000 reset in 290 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 p0) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-11 finished in 1626 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&&G(p1))) U p1)))'
Support contains 9 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 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 140 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 108 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 108 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 92 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 91 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 91 transition count 104
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 122 place count 83 transition count 96
Iterating global reduction 2 with 8 rules applied. Total rules applied 130 place count 83 transition count 96
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 138 place count 75 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 146 place count 75 transition count 80
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 154 place count 67 transition count 72
Iterating global reduction 2 with 8 rules applied. Total rules applied 162 place count 67 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 170 place count 67 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 170 place count 67 transition count 56
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 186 place count 59 transition count 56
Applied a total of 186 rules in 31 ms. Remains 59 /140 variables (removed 81) and now considering 56/184 (removed 128) transitions.
// Phase 1: matrix 56 rows 59 cols
[2024-05-31 16:15:32] [INFO ] Computed 19 invariants in 1 ms
[2024-05-31 16:15:32] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-31 16:15:32] [INFO ] Invariant cache hit.
[2024-05-31 16:15:32] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2024-05-31 16:15:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 16:15:32] [INFO ] Invariant cache hit.
[2024-05-31 16:15:33] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/140 places, 56/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 638 ms. Remains : 59/140 places, 56/184 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 (ADD s27 s28 s29 s30 s31 s32 s33 s34)), p0:(LEQ 2 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 207 ms.
Stack based approach found an accepted trace after 305 steps with 0 reset with depth 306 and stack size 306 in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLCardinality-13 finished in 950 ms.
All properties solved by simple procedures.
Total runtime 66482 ms.
BK_STOP 1717172134436
--------------------
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-Z2T4N08"
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-Z2T4N08, 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-171701122700042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z2T4N08.tgz
mv UtilityControlRoom-COL-Z2T4N08 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 '
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 ;