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.r071-smll-167814397500092.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 lolaxred
Input is CSRepetitions-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397500092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 409K Feb 25 12:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 12:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 721K Feb 25 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.9M Feb 25 12:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 216K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 550K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 240K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 779K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 735K Feb 25 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.5M Feb 25 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 189K Feb 25 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 679K Feb 25 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678242447128

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 02:27:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 02:27:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 02:27:30] [INFO ] Load time of PNML (sax parser for PT used): 453 ms
[2023-03-08 02:27:30] [INFO ] Transformed 1311 places.
[2023-03-08 02:27:30] [INFO ] Transformed 2300 transitions.
[2023-03-08 02:27:30] [INFO ] Parsed PT model containing 1311 places and 2300 transitions and 8700 arcs in 620 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CSRepetitions-PT-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1311 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 47 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2023-03-08 02:27:31] [INFO ] Computed 110 place invariants in 71 ms
[2023-03-08 02:27:31] [INFO ] Implicit Places using invariants in 571 ms returned []
[2023-03-08 02:27:31] [INFO ] Invariant cache hit.
[2023-03-08 02:27:33] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:27:33] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1897 ms to find 0 implicit places.
[2023-03-08 02:27:33] [INFO ] Invariant cache hit.
[2023-03-08 02:27:34] [INFO ] Dead Transitions using invariants and state equation in 1580 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3528 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Support contains 1311 out of 1311 places after structural reductions.
[2023-03-08 02:27:35] [INFO ] Flatten gal took : 345 ms
[2023-03-08 02:27:35] [INFO ] Flatten gal took : 245 ms
[2023-03-08 02:27:36] [INFO ] Input system was already deterministic with 2300 transitions.
Finished random walk after 6016 steps, including 33 resets, run visited all 23 properties in 368 ms. (steps per millisecond=16 )
Computed a total of 0 stabilizing places and 100 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' '!(X((p0 U p1)))'
Support contains 1310 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 14 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:27:37] [INFO ] Invariant cache hit.
[2023-03-08 02:27:38] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-08 02:27:38] [INFO ] Invariant cache hit.
[2023-03-08 02:27:39] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:27:39] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2023-03-08 02:27:39] [INFO ] Invariant cache hit.
[2023-03-08 02:27:40] [INFO ] Dead Transitions using invariants and state equation in 1767 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3124 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s55 1) (GEQ s686 1)) (AND (GEQ s508 1) (GEQ s663 1)) (AND (GEQ s3 1) (GEQ s331 1)) (AND (GEQ s151 1) (GEQ s1186 1)) (AND (GEQ s1124 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLFireability-00 finished in 3578 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(F((p0||X(p1))))))'
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 152 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:27:41] [INFO ] Invariant cache hit.
[2023-03-08 02:27:42] [INFO ] Implicit Places using invariants in 1077 ms returned []
[2023-03-08 02:27:42] [INFO ] Invariant cache hit.
[2023-03-08 02:27:43] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:27:45] [INFO ] Implicit Places using invariants and state equation in 3094 ms returned []
Implicit Place search using SMT with State Equation took 4174 ms to find 0 implicit places.
[2023-03-08 02:27:45] [INFO ] Invariant cache hit.
[2023-03-08 02:27:47] [INFO ] Dead Transitions using invariants and state equation in 1801 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6129 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (OR (LT s156 1) (LT s342 1)) (OR (LT s342 1) (LT s1124 1)) (OR (LT s342 1) (LT s1193 1)) (OR (LT s342 1) (LT s925 1)) (OR (LT s98 1) (LT s342 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 21761 reset in 4344 ms.
Product exploration explored 100000 steps with 21855 reset in 4245 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 56 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:27:57] [INFO ] Invariant cache hit.
[2023-03-08 02:27:58] [INFO ] Implicit Places using invariants in 1067 ms returned []
[2023-03-08 02:27:58] [INFO ] Invariant cache hit.
[2023-03-08 02:27:59] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:28:01] [INFO ] Implicit Places using invariants and state equation in 3144 ms returned []
Implicit Place search using SMT with State Equation took 4215 ms to find 0 implicit places.
[2023-03-08 02:28:01] [INFO ] Invariant cache hit.
[2023-03-08 02:28:03] [INFO ] Dead Transitions using invariants and state equation in 2214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6491 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 21658 reset in 3958 ms.
Product exploration explored 100000 steps with 21693 reset in 4047 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 275 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:28:13] [INFO ] Redundant transitions in 221 ms returned []
[2023-03-08 02:28:13] [INFO ] Invariant cache hit.
[2023-03-08 02:28:15] [INFO ] Dead Transitions using invariants and state equation in 2246 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2751 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 54 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:28:15] [INFO ] Invariant cache hit.
[2023-03-08 02:28:16] [INFO ] Implicit Places using invariants in 1150 ms returned []
[2023-03-08 02:28:16] [INFO ] Invariant cache hit.
[2023-03-08 02:28:17] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:28:19] [INFO ] Implicit Places using invariants and state equation in 2758 ms returned []
Implicit Place search using SMT with State Equation took 3912 ms to find 0 implicit places.
[2023-03-08 02:28:19] [INFO ] Invariant cache hit.
[2023-03-08 02:28:21] [INFO ] Dead Transitions using invariants and state equation in 1742 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5711 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Treatment of property CSRepetitions-PT-10-LTLFireability-01 finished in 40363 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((F(!p0)&&G(F(p1)))))'
Support contains 1200 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 12 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:28:21] [INFO ] Invariant cache hit.
[2023-03-08 02:28:22] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-08 02:28:22] [INFO ] Invariant cache hit.
[2023-03-08 02:28:23] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:28:23] [INFO ] Implicit Places using invariants and state equation in 1372 ms returned []
Implicit Place search using SMT with State Equation took 1648 ms to find 0 implicit places.
[2023-03-08 02:28:23] [INFO ] Invariant cache hit.
[2023-03-08 02:28:25] [INFO ] Dead Transitions using invariants and state equation in 1622 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3284 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s55 1) (GEQ s686 1)) (AND (GEQ s508 1) (GEQ s663 1)) (AND (GEQ s3 1) (GEQ s331 1)) (AND (GEQ s151 1) (GEQ s1186 1)) (AND (GEQ s1124 1) (G...], 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 1159 reset in 1833 ms.
Product exploration explored 100000 steps with 1140 reset in 1914 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 251 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Support contains 100 out of 1311 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 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 81 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:28:30] [INFO ] Invariant cache hit.
[2023-03-08 02:28:30] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-08 02:28:30] [INFO ] Invariant cache hit.
[2023-03-08 02:28:31] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:28:32] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
[2023-03-08 02:28:32] [INFO ] Redundant transitions in 133 ms returned []
[2023-03-08 02:28:32] [INFO ] Invariant cache hit.
[2023-03-08 02:28:34] [INFO ] Dead Transitions using invariants and state equation in 2205 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4061 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1118 reset in 1740 ms.
Product exploration explored 100000 steps with 1136 reset in 1910 ms.
Support contains 100 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 300 rules applied. Total rules applied 300 place count 1111 transition count 2200
Discarding 990 places :
Symmetric choice reduction at 0 with 990 rule applications. Total rules 1290 place count 121 transition count 1210
Iterating global reduction 0 with 990 rules applied. Total rules applied 2280 place count 121 transition count 1210
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 2310 place count 101 transition count 1200
Ensure Unique test removed 900 transitions
Reduce isomorphic transitions removed 900 transitions.
Iterating post reduction 0 with 900 rules applied. Total rules applied 3210 place count 101 transition count 300
Applied a total of 3210 rules in 204 ms. Remains 101 /1311 variables (removed 1210) and now considering 300/2300 (removed 2000) transitions.
// Phase 1: matrix 300 rows 101 cols
[2023-03-08 02:28:39] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-08 02:28:39] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 02:28:39] [INFO ] Invariant cache hit.
[2023-03-08 02:28:39] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-08 02:28:39] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-08 02:28:39] [INFO ] Invariant cache hit.
[2023-03-08 02:28:39] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/1311 places, 300/2300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 552 ms. Remains : 101/1311 places, 300/2300 transitions.
Treatment of property CSRepetitions-PT-10-LTLFireability-03 finished in 17818 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((G(!(((p1 U p2)&&F(p3))||p0)) U p1)))'
Support contains 1301 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 60 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2023-03-08 02:28:39] [INFO ] Computed 110 place invariants in 31 ms
[2023-03-08 02:28:39] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-08 02:28:39] [INFO ] Invariant cache hit.
[2023-03-08 02:28:40] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:28:41] [INFO ] Implicit Places using invariants and state equation in 1357 ms returned []
Implicit Place search using SMT with State Equation took 1655 ms to find 0 implicit places.
[2023-03-08 02:28:41] [INFO ] Redundant transitions in 192 ms returned []
[2023-03-08 02:28:41] [INFO ] Invariant cache hit.
[2023-03-08 02:28:43] [INFO ] Dead Transitions using invariants and state equation in 2067 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3982 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), true, p3, (OR p0 (AND p2 p3)), (NOT p1), p2]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p2 p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={} source=2 dest: 2}], [{ cond=(OR p0 (AND p2 p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p2 p3)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s968 1) (GEQ s1033 1) (GEQ s70 1) (GEQ s1179 1) (GEQ s964 1) (GEQ s1305 1) (GEQ s407 1) (GEQ s147 1) (GEQ s1281 1) (GEQ s793 1) (GEQ s1159 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 441 steps with 1 reset in 9 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLFireability-06 finished in 4273 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(F((p0&&(F(!p0) U (G(!p2)||p1))))))'
Support contains 1101 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 15 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:28:43] [INFO ] Invariant cache hit.
[2023-03-08 02:28:44] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-08 02:28:44] [INFO ] Invariant cache hit.
[2023-03-08 02:28:45] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:28:45] [INFO ] Implicit Places using invariants and state equation in 1373 ms returned []
Implicit Place search using SMT with State Equation took 1620 ms to find 0 implicit places.
[2023-03-08 02:28:45] [INFO ] Invariant cache hit.
[2023-03-08 02:28:46] [INFO ] Dead Transitions using invariants and state equation in 1499 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3137 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s55 1) (GEQ s686 1)) (AND (GEQ s508 1) (GEQ s663 1)) (AND (GEQ s3 1) (GEQ s331 1)) (AND (GEQ s151 1) (GEQ s1186 1)) (AND (GEQ s1124 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 59260 steps with 2650 reset in 10001 ms.
Product exploration timeout after 59440 steps with 2688 reset in 10001 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 52 resets, run finished after 807 ms. (steps per millisecond=12 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3491 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 02:29:15] [INFO ] Invariant cache hit.
[2023-03-08 02:29:18] [INFO ] After 460ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F p0), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 8 factoid took 360 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2023-03-08 02:29:21] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 1100 out of 1311 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 14 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:29:36] [INFO ] Invariant cache hit.
[2023-03-08 02:29:36] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-08 02:29:36] [INFO ] Invariant cache hit.
[2023-03-08 02:29:37] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:29:38] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
[2023-03-08 02:29:38] [INFO ] Invariant cache hit.
[2023-03-08 02:29:40] [INFO ] Dead Transitions using invariants and state equation in 2122 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3867 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-08 02:29:43] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration timeout after 94240 steps with 4243 reset in 10001 ms.
Product exploration explored 100000 steps with 4472 reset in 9894 ms.
Support contains 1100 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 93 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:30:18] [INFO ] Invariant cache hit.
[2023-03-08 02:30:18] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-08 02:30:18] [INFO ] Invariant cache hit.
[2023-03-08 02:30:19] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:30:20] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 1710 ms to find 0 implicit places.
[2023-03-08 02:30:20] [INFO ] Redundant transitions in 135 ms returned []
[2023-03-08 02:30:20] [INFO ] Invariant cache hit.
[2023-03-08 02:30:22] [INFO ] Dead Transitions using invariants and state equation in 2019 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3964 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Treatment of property CSRepetitions-PT-10-LTLFireability-07 finished in 98827 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((X(p1)||p0))||G(p2))))'
Support contains 5 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 152 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:30:22] [INFO ] Invariant cache hit.
[2023-03-08 02:30:24] [INFO ] Implicit Places using invariants in 1255 ms returned []
[2023-03-08 02:30:24] [INFO ] Invariant cache hit.
[2023-03-08 02:30:25] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:30:27] [INFO ] Implicit Places using invariants and state equation in 3822 ms returned []
Implicit Place search using SMT with State Equation took 5079 ms to find 0 implicit places.
[2023-03-08 02:30:27] [INFO ] Invariant cache hit.
[2023-03-08 02:30:30] [INFO ] Dead Transitions using invariants and state equation in 2207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7439 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(GEQ s912 1), p0:(OR (LT s542 1) (LT s1044 1)), p2:(AND (GEQ s342 1) (GEQ s785 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 319 steps with 1 reset in 6 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLFireability-09 finished in 7703 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((X(F((G(!p1)||(!p1&&F(p2)))))||p0))))'
Support contains 4 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 77 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:30:30] [INFO ] Invariant cache hit.
[2023-03-08 02:30:31] [INFO ] Implicit Places using invariants in 1173 ms returned []
[2023-03-08 02:30:31] [INFO ] Invariant cache hit.
[2023-03-08 02:30:32] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:30:35] [INFO ] Implicit Places using invariants and state equation in 3785 ms returned []
Implicit Place search using SMT with State Equation took 4961 ms to find 0 implicit places.
[2023-03-08 02:30:35] [INFO ] Invariant cache hit.
[2023-03-08 02:30:37] [INFO ] Dead Transitions using invariants and state equation in 2586 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7627 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s45 1) (LT s342 1)), p1:(OR (AND (GEQ s342 1) (GEQ s783 1)) (AND (GEQ s45 1) (GEQ s342 1))), p2:(GEQ s820 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 592 reset in 1791 ms.
Product exploration explored 100000 steps with 605 reset in 1656 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 265 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Finished random walk after 85 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND p1 (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F p1)]
Knowledge based reduction with 2 factoid took 457 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Support contains 4 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 78 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:30:42] [INFO ] Invariant cache hit.
[2023-03-08 02:30:44] [INFO ] Implicit Places using invariants in 1627 ms returned []
[2023-03-08 02:30:44] [INFO ] Invariant cache hit.
[2023-03-08 02:30:45] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:30:48] [INFO ] Implicit Places using invariants and state equation in 4257 ms returned []
Implicit Place search using SMT with State Equation took 5886 ms to find 0 implicit places.
[2023-03-08 02:30:48] [INFO ] Invariant cache hit.
[2023-03-08 02:30:50] [INFO ] Dead Transitions using invariants and state equation in 1580 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7546 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 267 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Finished random walk after 239 steps, including 1 resets, run visited all 4 properties in 7 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND p1 (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F p1)]
Knowledge based reduction with 2 factoid took 350 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 583 reset in 1561 ms.
Product exploration explored 100000 steps with 598 reset in 1665 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Support contains 4 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 120 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:30:55] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-08 02:30:55] [INFO ] Invariant cache hit.
[2023-03-08 02:30:58] [INFO ] Dead Transitions using invariants and state equation in 2652 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2915 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Support contains 4 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 68 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:30:58] [INFO ] Invariant cache hit.
[2023-03-08 02:30:59] [INFO ] Implicit Places using invariants in 1665 ms returned []
[2023-03-08 02:30:59] [INFO ] Invariant cache hit.
[2023-03-08 02:31:01] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:31:04] [INFO ] Implicit Places using invariants and state equation in 4397 ms returned []
Implicit Place search using SMT with State Equation took 6067 ms to find 0 implicit places.
[2023-03-08 02:31:04] [INFO ] Invariant cache hit.
[2023-03-08 02:31:06] [INFO ] Dead Transitions using invariants and state equation in 2484 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8620 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Treatment of property CSRepetitions-PT-10-LTLFireability-10 finished in 36584 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(p0)))'
Support contains 2 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 62 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:31:06] [INFO ] Invariant cache hit.
[2023-03-08 02:31:08] [INFO ] Implicit Places using invariants in 1611 ms returned []
[2023-03-08 02:31:08] [INFO ] Invariant cache hit.
[2023-03-08 02:31:09] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:31:13] [INFO ] Implicit Places using invariants and state equation in 4456 ms returned []
Implicit Place search using SMT with State Equation took 6071 ms to find 0 implicit places.
[2023-03-08 02:31:13] [INFO ] Invariant cache hit.
[2023-03-08 02:31:15] [INFO ] Dead Transitions using invariants and state equation in 2634 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8768 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-12 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:(AND (GEQ s342 1) (GEQ s916 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLFireability-12 finished in 8871 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((G((!p0||G(p1))) U X(!p1)))))'
Support contains 3 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 297 rules applied. Total rules applied 297 place count 1113 transition count 2201
Discarding 980 places :
Symmetric choice reduction at 0 with 980 rule applications. Total rules 1277 place count 133 transition count 1221
Iterating global reduction 0 with 980 rules applied. Total rules applied 2257 place count 133 transition count 1221
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 2346 place count 44 transition count 242
Iterating global reduction 0 with 89 rules applied. Total rules applied 2435 place count 44 transition count 242
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 0 with 89 rules applied. Total rules applied 2524 place count 44 transition count 153
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 2544 place count 34 transition count 143
Applied a total of 2544 rules in 168 ms. Remains 34 /1311 variables (removed 1277) and now considering 143/2300 (removed 2157) transitions.
[2023-03-08 02:31:15] [INFO ] Flow matrix only has 53 transitions (discarded 90 similar events)
// Phase 1: matrix 53 rows 34 cols
[2023-03-08 02:31:15] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-08 02:31:16] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 02:31:16] [INFO ] Flow matrix only has 53 transitions (discarded 90 similar events)
[2023-03-08 02:31:16] [INFO ] Invariant cache hit.
[2023-03-08 02:31:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 02:31:16] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-08 02:31:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 02:31:16] [INFO ] Flow matrix only has 53 transitions (discarded 90 similar events)
[2023-03-08 02:31:16] [INFO ] Invariant cache hit.
[2023-03-08 02:31:16] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/1311 places, 143/2300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 364 ms. Remains : 34/1311 places, 143/2300 transitions.
Stuttering acceptance computed with spot in 378 ms :[p1, false, p1, p1, false, false, false, false, false]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0, 1} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={0, 2} source=0 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={1, 2} source=0 dest: 4}], [{ cond=p1, acceptance={0, 2} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={1, 2} source=1 dest: 4}, { cond=p1, acceptance={0} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 6}], [{ cond=p1, acceptance={0, 2} source=2 dest: 1}, { cond=p1, acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={1, 2} source=2 dest: 4}], [{ cond=p1, acceptance={0, 1} source=3 dest: 0}, { cond=p1, acceptance={0, 2} source=3 dest: 1}, { cond=p1, acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={1, 2} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={1, 2} source=4 dest: 4}, { cond=p1, acceptance={1} source=4 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={2} source=4 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=4 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 2} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 2} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={1, 2} source=6 dest: 4}, { cond=p1, acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={2} source=6 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=6 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={1} source=7 dest: 6}], [{ cond=(AND p0 p1), acceptance={1, 2} source=8 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={2} source=8 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s29 1)), p1:(LT s20 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 83675 steps with 12557 reset in 342 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLFireability-13 finished in 1114 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) U (G(X(X(G(p1)))) U p2)))'
Support contains 5 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 161 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2023-03-08 02:31:17] [INFO ] Computed 110 place invariants in 23 ms
[2023-03-08 02:31:18] [INFO ] Implicit Places using invariants in 1101 ms returned []
[2023-03-08 02:31:18] [INFO ] Invariant cache hit.
[2023-03-08 02:31:19] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:31:21] [INFO ] Implicit Places using invariants and state equation in 3726 ms returned []
Implicit Place search using SMT with State Equation took 4831 ms to find 0 implicit places.
[2023-03-08 02:31:21] [INFO ] Invariant cache hit.
[2023-03-08 02:31:24] [INFO ] Dead Transitions using invariants and state equation in 2651 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7646 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (NOT p1), true, (AND (NOT p1) p0), p0]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s342 1) (GEQ s521 1)), p0:(AND (GEQ s146 1) (GEQ s180 1)), p1:(GEQ s834 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 474 steps with 2 reset in 11 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLFireability-14 finished in 7964 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(p0) U p1)&&G(p2))))'
Support contains 5 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 114 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:31:24] [INFO ] Invariant cache hit.
[2023-03-08 02:31:26] [INFO ] Implicit Places using invariants in 1400 ms returned []
[2023-03-08 02:31:26] [INFO ] Invariant cache hit.
[2023-03-08 02:31:27] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:31:30] [INFO ] Implicit Places using invariants and state equation in 4372 ms returned []
Implicit Place search using SMT with State Equation took 5776 ms to find 0 implicit places.
[2023-03-08 02:31:30] [INFO ] Invariant cache hit.
[2023-03-08 02:31:33] [INFO ] Dead Transitions using invariants and state equation in 2432 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8325 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(GEQ s226 1), p1:(AND (GEQ s342 1) (GEQ s1002 1) (GEQ s226 1)), p0:(AND (GEQ s180 1) (GEQ s638 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLFireability-15 finished in 8535 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(F((p0||X(p1))))))'
Found a Shortening insensitive property : CSRepetitions-PT-10-LTLFireability-01
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 76 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:31:33] [INFO ] Invariant cache hit.
[2023-03-08 02:31:34] [INFO ] Implicit Places using invariants in 1260 ms returned []
[2023-03-08 02:31:34] [INFO ] Invariant cache hit.
[2023-03-08 02:31:35] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:31:37] [INFO ] Implicit Places using invariants and state equation in 2212 ms returned []
Implicit Place search using SMT with State Equation took 3474 ms to find 0 implicit places.
[2023-03-08 02:31:37] [INFO ] Invariant cache hit.
[2023-03-08 02:31:39] [INFO ] Dead Transitions using invariants and state equation in 2652 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6205 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (OR (LT s156 1) (LT s342 1)) (OR (LT s342 1) (LT s1124 1)) (OR (LT s342 1) (LT s1193 1)) (OR (LT s342 1) (LT s925 1)) (OR (LT s98 1) (LT s342 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22014 reset in 4917 ms.
Product exploration explored 100000 steps with 22018 reset in 4716 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 54 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:31:50] [INFO ] Invariant cache hit.
[2023-03-08 02:31:51] [INFO ] Implicit Places using invariants in 1113 ms returned []
[2023-03-08 02:31:51] [INFO ] Invariant cache hit.
[2023-03-08 02:31:52] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:31:54] [INFO ] Implicit Places using invariants and state equation in 3172 ms returned []
Implicit Place search using SMT with State Equation took 4287 ms to find 0 implicit places.
[2023-03-08 02:31:54] [INFO ] Invariant cache hit.
[2023-03-08 02:31:56] [INFO ] Dead Transitions using invariants and state equation in 1885 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6227 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 21455 reset in 4679 ms.
Product exploration explored 100000 steps with 21640 reset in 4544 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 161 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:32:07] [INFO ] Redundant transitions in 223 ms returned []
[2023-03-08 02:32:07] [INFO ] Invariant cache hit.
[2023-03-08 02:32:09] [INFO ] Dead Transitions using invariants and state equation in 2055 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2453 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 57 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:32:09] [INFO ] Invariant cache hit.
[2023-03-08 02:32:11] [INFO ] Implicit Places using invariants in 1272 ms returned []
[2023-03-08 02:32:11] [INFO ] Invariant cache hit.
[2023-03-08 02:32:12] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:32:14] [INFO ] Implicit Places using invariants and state equation in 3187 ms returned []
Implicit Place search using SMT with State Equation took 4461 ms to find 0 implicit places.
[2023-03-08 02:32:14] [INFO ] Invariant cache hit.
[2023-03-08 02:32:16] [INFO ] Dead Transitions using invariants and state equation in 1883 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6403 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Treatment of property CSRepetitions-PT-10-LTLFireability-01 finished in 42994 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((F(!p0)&&G(F(p1)))))'
Found a Shortening insensitive property : CSRepetitions-PT-10-LTLFireability-03
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1), (NOT p1)]
Support contains 1200 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 27 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:32:16] [INFO ] Invariant cache hit.
[2023-03-08 02:32:17] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-08 02:32:17] [INFO ] Invariant cache hit.
[2023-03-08 02:32:17] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:32:18] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1379 ms to find 0 implicit places.
[2023-03-08 02:32:18] [INFO ] Invariant cache hit.
[2023-03-08 02:32:20] [INFO ] Dead Transitions using invariants and state equation in 2558 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3966 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s55 1) (GEQ s686 1)) (AND (GEQ s508 1) (GEQ s663 1)) (AND (GEQ s3 1) (GEQ s331 1)) (AND (GEQ s151 1) (GEQ s1186 1)) (AND (GEQ s1124 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1186 reset in 2504 ms.
Product exploration explored 100000 steps with 1161 reset in 2018 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 290 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Support contains 100 out of 1311 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 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 113 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:32:27] [INFO ] Invariant cache hit.
[2023-03-08 02:32:27] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-08 02:32:27] [INFO ] Invariant cache hit.
[2023-03-08 02:32:28] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:32:28] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
[2023-03-08 02:32:28] [INFO ] Redundant transitions in 225 ms returned []
[2023-03-08 02:32:28] [INFO ] Invariant cache hit.
[2023-03-08 02:32:31] [INFO ] Dead Transitions using invariants and state equation in 2545 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4195 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1138 reset in 1958 ms.
Product exploration explored 100000 steps with 1233 reset in 2132 ms.
Support contains 100 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 300 rules applied. Total rules applied 300 place count 1111 transition count 2200
Discarding 990 places :
Symmetric choice reduction at 0 with 990 rule applications. Total rules 1290 place count 121 transition count 1210
Iterating global reduction 0 with 990 rules applied. Total rules applied 2280 place count 121 transition count 1210
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 2310 place count 101 transition count 1200
Ensure Unique test removed 900 transitions
Reduce isomorphic transitions removed 900 transitions.
Iterating post reduction 0 with 900 rules applied. Total rules applied 3210 place count 101 transition count 300
Applied a total of 3210 rules in 125 ms. Remains 101 /1311 variables (removed 1210) and now considering 300/2300 (removed 2000) transitions.
// Phase 1: matrix 300 rows 101 cols
[2023-03-08 02:32:36] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 02:32:36] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 02:32:36] [INFO ] Invariant cache hit.
[2023-03-08 02:32:36] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-08 02:32:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:32:36] [INFO ] Invariant cache hit.
[2023-03-08 02:32:36] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/1311 places, 300/2300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 423 ms. Remains : 101/1311 places, 300/2300 transitions.
Treatment of property CSRepetitions-PT-10-LTLFireability-03 finished in 20229 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(F((p0&&(F(!p0) U (G(!p2)||p1))))))'
Found a Shortening insensitive property : CSRepetitions-PT-10-LTLFireability-07
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Support contains 1101 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 21 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2023-03-08 02:32:36] [INFO ] Computed 110 place invariants in 24 ms
[2023-03-08 02:32:37] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-08 02:32:37] [INFO ] Invariant cache hit.
[2023-03-08 02:32:38] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:32:38] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
[2023-03-08 02:32:38] [INFO ] Invariant cache hit.
[2023-03-08 02:32:40] [INFO ] Dead Transitions using invariants and state equation in 2477 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3732 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s55 1) (GEQ s686 1)) (AND (GEQ s508 1) (GEQ s663 1)) (AND (GEQ s3 1) (GEQ s331 1)) (AND (GEQ s151 1) (GEQ s1186 1)) (AND (GEQ s1124 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 54910 steps with 2467 reset in 10002 ms.
Product exploration timeout after 54890 steps with 2453 reset in 10001 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 264 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Incomplete random walk after 10009 steps, including 57 resets, run finished after 896 ms. (steps per millisecond=11 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3201 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 02:33:08] [INFO ] Invariant cache hit.
[2023-03-08 02:33:11] [INFO ] After 516ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F p0), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 8 factoid took 376 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2023-03-08 02:33:15] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 1100 out of 1311 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 8 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:33:30] [INFO ] Invariant cache hit.
[2023-03-08 02:33:30] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-08 02:33:30] [INFO ] Invariant cache hit.
[2023-03-08 02:33:31] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:33:31] [INFO ] Implicit Places using invariants and state equation in 1464 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
[2023-03-08 02:33:31] [INFO ] Invariant cache hit.
[2023-03-08 02:33:34] [INFO ] Dead Transitions using invariants and state equation in 2570 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4326 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-08 02:33:38] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration timeout after 97420 steps with 4365 reset in 10002 ms.
Product exploration timeout after 97690 steps with 4426 reset in 10001 ms.
Support contains 1100 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 72 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 02:34:13] [INFO ] Invariant cache hit.
[2023-03-08 02:34:13] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-08 02:34:13] [INFO ] Invariant cache hit.
[2023-03-08 02:34:14] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 02:34:15] [INFO ] Implicit Places using invariants and state equation in 1524 ms returned []
Implicit Place search using SMT with State Equation took 1808 ms to find 0 implicit places.
[2023-03-08 02:34:15] [INFO ] Redundant transitions in 139 ms returned []
[2023-03-08 02:34:15] [INFO ] Invariant cache hit.
[2023-03-08 02:34:17] [INFO ] Dead Transitions using invariants and state equation in 2382 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4407 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Treatment of property CSRepetitions-PT-10-LTLFireability-07 finished in 101361 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((X(F((G(!p1)||(!p1&&F(p2)))))||p0))))'
Found a Lengthening insensitive property : CSRepetitions-PT-10-LTLFireability-10
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Support contains 4 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 0 with 291 rules applied. Total rules applied 291 place count 1117 transition count 2203
Discarding 960 places :
Symmetric choice reduction at 0 with 960 rule applications. Total rules 1251 place count 157 transition count 1243
Iterating global reduction 0 with 960 rules applied. Total rules applied 2211 place count 157 transition count 1243
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 2299 place count 69 transition count 275
Iterating global reduction 0 with 88 rules applied. Total rules applied 2387 place count 69 transition count 275
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 2475 place count 69 transition count 187
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 2495 place count 59 transition count 177
Applied a total of 2495 rules in 135 ms. Remains 59 /1311 variables (removed 1252) and now considering 177/2300 (removed 2123) transitions.
[2023-03-08 02:34:18] [INFO ] Flow matrix only has 96 transitions (discarded 81 similar events)
// Phase 1: matrix 96 rows 59 cols
[2023-03-08 02:34:18] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-08 02:34:18] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 02:34:18] [INFO ] Flow matrix only has 96 transitions (discarded 81 similar events)
[2023-03-08 02:34:18] [INFO ] Invariant cache hit.
[2023-03-08 02:34:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 02:34:18] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-08 02:34:18] [INFO ] Flow matrix only has 96 transitions (discarded 81 similar events)
[2023-03-08 02:34:18] [INFO ] Invariant cache hit.
[2023-03-08 02:34:18] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 59/1311 places, 177/2300 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 393 ms. Remains : 59/1311 places, 177/2300 transitions.
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s12 1)), p1:(OR (AND (GEQ s12 1) (GEQ s35 1)) (AND (GEQ s1 1) (GEQ s12 1))), p2:(GEQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2527 reset in 256 ms.
Stack based approach found an accepted trace after 131 steps with 4 reset with depth 40 and stack size 40 in 1 ms.
Treatment of property CSRepetitions-PT-10-LTLFireability-10 finished in 905 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-08 02:34:19] [INFO ] Flatten gal took : 149 ms
[2023-03-08 02:34:19] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 37 ms.
[2023-03-08 02:34:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1311 places, 2300 transitions and 8700 arcs took 13 ms.
Total runtime 409709 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CSRepetitions-PT-10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/366
LTLFireability

FORMULA CSRepetitions-PT-10-LTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-10-LTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-10-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-10-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678243126670

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/366/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/366/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/366/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 8 (type EXCL) for 3 CSRepetitions-PT-10-LTLFireability-03
lola: time limit : 667 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for CSRepetitions-PT-10-LTLFireability-03
lola: result : false
lola: markings : 23
lola: fired transitions : 23
lola: time used : 0.000000
lola: memory pages used : 1
lola: planning for (null) stopped (result already fixed).
lola: LAUNCH task # 1 (type EXCL) for 0 CSRepetitions-PT-10-LTLFireability-01
lola: time limit : 1112 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CSRepetitions-PT-10-LTLFireability-01
lola: result : false
lola: markings : 76
lola: fired transitions : 76
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 14 (type EXCL) for 13 CSRepetitions-PT-10-LTLFireability-10
lola: time limit : 1668 sec
lola: memory limit: 32 pages
lola: FINISHED task # 14 (type EXCL) for CSRepetitions-PT-10-LTLFireability-10
lola: result : false
lola: markings : 27
lola: fired transitions : 27
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 11 (type EXCL) for 10 CSRepetitions-PT-10-LTLFireability-07
lola: time limit : 3336 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for CSRepetitions-PT-10-LTLFireability-07
lola: result : false
lola: markings : 1003
lola: fired transitions : 1003
lola: time used : 1.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CSRepetitions-PT-10-LTLFireability-01: LTL false LTL model checker
CSRepetitions-PT-10-LTLFireability-03: CONJ false LTL model checker
CSRepetitions-PT-10-LTLFireability-07: LTL false LTL model checker
CSRepetitions-PT-10-LTLFireability-10: LTL false LTL model checker


Time elapsed: 265 secs. Pages in use: 1

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="CSRepetitions-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CSRepetitions-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-167814397500092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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