Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r489-tall-167912707601035.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is UtilityControlRoom-COL-Z4T3N08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707601035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 9.1K Feb 26 14:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 14:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 14:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 14:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 17:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 14:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 14:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 17:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 29K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679335856984

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T3N08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 18:10:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 18:10:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:10:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-20 18:10:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-20 18:10:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 636 ms
[2023-03-20 18:10:59] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 302 PT places and 600.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-20 18:10:59] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 5 ms.
[2023-03-20 18:10:59] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 6 formulas.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 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 10002 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 22) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 13 cols
[2023-03-20 18:10:59] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-20 18:10:59] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 18:10:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-20 18:10:59] [INFO ] After 39ms 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.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 18:10:59] [INFO ] Flatten gal took : 14 ms
[2023-03-20 18:10:59] [INFO ] Flatten gal took : 3 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2023-03-20 18:10:59] [INFO ] Unfolded HLPN to a Petri net with 302 places and 600 transitions 1928 arcs in 19 ms.
[2023-03-20 18:10:59] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 294 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 15 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2023-03-20 18:10:59] [INFO ] Computed 19 place invariants in 13 ms
[2023-03-20 18:10:59] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-20 18:10:59] [INFO ] Invariant cache hit.
[2023-03-20 18:11:00] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-20 18:11:00] [INFO ] Invariant cache hit.
[2023-03-20 18:11:00] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 547 ms. Remains : 302/302 places, 472/472 transitions.
Support contains 294 out of 302 places after structural reductions.
[2023-03-20 18:11:00] [INFO ] Flatten gal took : 51 ms
[2023-03-20 18:11:00] [INFO ] Flatten gal took : 29 ms
[2023-03-20 18:11:00] [INFO ] Input system was already deterministic with 472 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 20) seen :19
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.
[2023-03-20 18:11:00] [INFO ] Invariant cache hit.
[2023-03-20 18:11:00] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-20 18:11:00] [INFO ] After 68ms 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)||(X(p0)&&p2))))'
Support contains 50 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 25 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2023-03-20 18:11:01] [INFO ] Computed 19 place invariants in 8 ms
[2023-03-20 18:11:01] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-20 18:11:01] [INFO ] Invariant cache hit.
[2023-03-20 18:11:01] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-20 18:11:01] [INFO ] Invariant cache hit.
[2023-03-20 18:11:01] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/302 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s148 (ADD s158 s159 s160 s161 s162 s163 s164 s165)), p2:(AND (LEQ s148 (ADD s158 s159 s160 s161 s162 s163 s164 s165)) (OR (LEQ 3 s148) (LEQ (ADD s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 17464 reset in 454 ms.
Product exploration explored 100000 steps with 17370 reset in 392 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 p2) (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 389 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 18:11:03] [INFO ] Invariant cache hit.
[2023-03-20 18:11:03] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 11 factoid took 478 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
[2023-03-20 18:11:03] [INFO ] Invariant cache hit.
[2023-03-20 18:11:04] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 11 factoid took 201 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-00 finished in 3244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U p0)))'
Support contains 4 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 25 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2023-03-20 18:11:04] [INFO ] Invariant cache hit.
[2023-03-20 18:11:04] [INFO ] Implicit Places using invariants in 91 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 273 ms.
Product exploration explored 100000 steps with 50000 reset in 289 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), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-02 finished in 918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((X(X(p1))||G(p2)))))'
Support contains 173 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 2 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2023-03-20 18:11:05] [INFO ] Computed 19 place invariants in 11 ms
[2023-03-20 18:11:05] [INFO ] Implicit Places using invariants in 93 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 472/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 301/302 places, 472/472 transitions.
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}]], initial=1, aps=[p0:(LEQ s244 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43)), p1:(L...], 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][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 363 ms.
Product exploration explored 100000 steps with 25000 reset in 356 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) p1 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 242 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 472 rows 301 cols
[2023-03-20 18:11:06] [INFO ] Computed 18 place invariants in 10 ms
[2023-03-20 18:11:06] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 18:11:06] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-20 18:11:06] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p0)]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 7 factoid took 220 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-03 finished in 2019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 12 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2023-03-20 18:11:07] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-20 18:11:07] [INFO ] Implicit Places using invariants in 100 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 3 s148)], 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 4 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-07 finished in 257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(G(p1)))) U (p1&&G(p2)))))'
Support contains 194 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2023-03-20 18:11:07] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-20 18:11:07] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-20 18:11:07] [INFO ] Invariant cache hit.
[2023-03-20 18:11:07] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-20 18:11:07] [INFO ] Invariant cache hit.
[2023-03-20 18:11:07] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 469 ms. Remains : 302/302 places, 472/472 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s244 (ADD s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 363 ms.
Product exploration explored 100000 steps with 0 reset in 456 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) p2 p0), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 697 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :6
Finished Best-First random walk after 123 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p2 p1)), (F (AND (NOT p2) (NOT p0))), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 14 factoid took 986 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p2)]
[2023-03-20 18:11:11] [INFO ] Invariant cache hit.
[2023-03-20 18:11:11] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-20 18:11:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:11:12] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2023-03-20 18:11:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:11:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-20 18:11:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:11:12] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2023-03-20 18:11:12] [INFO ] Computed and/alt/rep : 432/648/432 causal constraints (skipped 32 transitions) in 25 ms.
[2023-03-20 18:11:14] [INFO ] Added : 306 causal constraints over 62 iterations in 1835 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 194 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
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 16 place count 294 transition count 464
Applied a total of 16 rules in 25 ms. Remains 294 /302 variables (removed 8) and now considering 464/472 (removed 8) transitions.
// Phase 1: matrix 464 rows 294 cols
[2023-03-20 18:11:14] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-20 18:11:14] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-20 18:11:14] [INFO ] Invariant cache hit.
[2023-03-20 18:11:14] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-20 18:11:14] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-20 18:11:14] [INFO ] Invariant cache hit.
[2023-03-20 18:11:14] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 294/302 places, 464/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 531 ms. Remains : 294/302 places, 464/472 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 p2 (NOT p1) p0), (X (OR (NOT p2) (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (OR (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 13 factoid took 775 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 8) seen :6
Finished Best-First random walk after 242 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=121 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (OR (NOT p2) (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (OR (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT p0)), (F (AND p2 p1)), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 13 factoid took 935 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p2)]
[2023-03-20 18:11:17] [INFO ] Invariant cache hit.
[2023-03-20 18:11:17] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-20 18:11:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:11:18] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2023-03-20 18:11:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:11:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-20 18:11:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:11:18] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2023-03-20 18:11:18] [INFO ] Computed and/alt/rep : 400/736/400 causal constraints (skipped 32 transitions) in 25 ms.
[2023-03-20 18:11:20] [INFO ] Added : 369 causal constraints over 75 iterations in 2187 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 380 ms.
Stack based approach found an accepted trace after 17329 steps with 0 reset with depth 17330 and stack size 17330 in 71 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-08 finished in 13944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 32 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 291 place count 171 transition count 216
Iterating global reduction 2 with 3 rules applied. Total rules applied 294 place count 171 transition count 216
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 318 place count 147 transition count 192
Iterating global reduction 2 with 24 rules applied. Total rules applied 342 place count 147 transition count 192
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 375 place count 130 transition count 176
Applied a total of 375 rules in 25 ms. Remains 130 /302 variables (removed 172) and now considering 176/472 (removed 296) transitions.
// Phase 1: matrix 176 rows 130 cols
[2023-03-20 18:11:21] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-20 18:11:21] [INFO ] Implicit Places using invariants in 51 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/302 places, 176/472 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 121 transition count 168
Applied a total of 16 rules in 9 ms. Remains 121 /129 variables (removed 8) and now considering 168/176 (removed 8) transitions.
// Phase 1: matrix 168 rows 121 cols
[2023-03-20 18:11:21] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-20 18:11:21] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 18:11:21] [INFO ] Invariant cache hit.
[2023-03-20 18:11:21] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/302 places, 168/472 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 206 ms. Remains : 121/302 places, 168/472 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-09 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 3 (ADD s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103))], 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 257 ms.
Stack based approach found an accepted trace after 953 steps with 0 reset with depth 954 and stack size 954 in 3 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-09 finished in 520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0||G(F(p1))||(F(p1)&&X(p2))))))'
Support contains 140 out of 302 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 302 transition count 440
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 64 place count 270 transition count 440
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 80 place count 262 transition count 432
Applied a total of 80 rules in 24 ms. Remains 262 /302 variables (removed 40) and now considering 432/472 (removed 40) transitions.
// Phase 1: matrix 432 rows 262 cols
[2023-03-20 18:11:21] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-20 18:11:22] [INFO ] Implicit Places using invariants in 90 ms returned [213]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 261/302 places, 432/472 transitions.
Applied a total of 0 rules in 10 ms. Remains 261 /261 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 126 ms. Remains : 261/302 places, 432/472 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT (ADD s0 s1 s2 s3) (ADD s221 s222 s223 s224 s225 s226 s227 s228)), p0:(AND (LEQ (ADD s0 s1 s2 s3) (ADD s221 s222 s223 s224 s225 s226 s227 s228)) (LE...], 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 662 reset in 469 ms.
Product exploration explored 100000 steps with 670 reset in 472 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 140 out of 261 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 432/432 transitions.
Applied a total of 0 rules in 17 ms. Remains 261 /261 variables (removed 0) and now considering 432/432 (removed 0) transitions.
// Phase 1: matrix 432 rows 261 cols
[2023-03-20 18:11:23] [INFO ] Computed 18 place invariants in 8 ms
[2023-03-20 18:11:23] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-20 18:11:23] [INFO ] Invariant cache hit.
[2023-03-20 18:11:23] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-20 18:11:23] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-20 18:11:23] [INFO ] Invariant cache hit.
[2023-03-20 18:11:23] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 443 ms. Remains : 261/261 places, 432/432 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) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 661 reset in 479 ms.
Product exploration explored 100000 steps with 655 reset in 454 ms.
Support contains 140 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 432/432 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 253 transition count 424
Applied a total of 16 rules in 15 ms. Remains 253 /261 variables (removed 8) and now considering 424/432 (removed 8) transitions.
// Phase 1: matrix 424 rows 253 cols
[2023-03-20 18:11:25] [INFO ] Computed 18 place invariants in 7 ms
[2023-03-20 18:11:25] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-20 18:11:25] [INFO ] Invariant cache hit.
[2023-03-20 18:11:25] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-20 18:11:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 18:11:25] [INFO ] Invariant cache hit.
[2023-03-20 18:11:25] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 253/261 places, 424/432 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 418 ms. Remains : 253/261 places, 424/432 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-10 finished in 4112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((X(p0) U p1) U p2))'
Support contains 84 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 3 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2023-03-20 18:11:26] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-20 18:11:26] [INFO ] Implicit Places using invariants in 75 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 1 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, p2, (AND p2 p1 p0), (AND p1 p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2 p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(LEQ 1 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43)), p1:(GT (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 414 ms.
Product exploration explored 100000 steps with 50000 reset in 420 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 p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND p1 p2 p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (X (NOT (AND p1 p2 p0)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p1) p0)
Knowledge based reduction with 14 factoid took 605 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-12 finished in 1678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(G(p1))))'
Support contains 18 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 7 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2023-03-20 18:11:27] [INFO ] Invariant cache hit.
[2023-03-20 18:11:27] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-20 18:11:27] [INFO ] Invariant cache hit.
[2023-03-20 18:11:27] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-20 18:11:27] [INFO ] Invariant cache hit.
[2023-03-20 18:11:28] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/302 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 400 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p1 p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (LEQ 2 (ADD s140 s141 s142 s143 s144 s145 s146 s147)) (LEQ 2 s149)), p0:(LEQ s148 (ADD s158 s159 s160 s161 s162 s163 s164 s165))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 4 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-13 finished in 587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0||G(F(p1))||(F(p1)&&X(p2))))))'
[2023-03-20 18:11:28] [INFO ] Flatten gal took : 26 ms
[2023-03-20 18:11:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 18:11:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 302 places, 472 transitions and 1416 arcs took 4 ms.
Total runtime 30052 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1475/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 16015624 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16067632 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023

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-Z4T3N08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is UtilityControlRoom-COL-Z4T3N08, 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 r489-tall-167912707601035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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