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

About the Execution of ITS-Tools for CSRepetitions-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
304.371 12547.00 22856.00 356.90 FFFFFFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r069-smll-167814395900052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CSRepetitions-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-167814395900052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 13K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:51 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 7.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 146K Feb 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 15:41 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 26K 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-02-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678241180431

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-02
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 02:06:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 02:06:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 02:06:23] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-08 02:06:23] [INFO ] Transformed 23 places.
[2023-03-08 02:06:23] [INFO ] Transformed 28 transitions.
[2023-03-08 02:06:23] [INFO ] Parsed PT model containing 23 places and 28 transitions and 92 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-PT-02-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 12 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2023-03-08 02:06:23] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-08 02:06:23] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-08 02:06:23] [INFO ] Invariant cache hit.
[2023-03-08 02:06:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 02:06:23] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-08 02:06:23] [INFO ] Invariant cache hit.
[2023-03-08 02:06:23] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 23/23 places, 28/28 transitions.
Support contains 23 out of 23 places after structural reductions.
[2023-03-08 02:06:24] [INFO ] Flatten gal took : 30 ms
[2023-03-08 02:06:24] [INFO ] Flatten gal took : 12 ms
[2023-03-08 02:06:24] [INFO ] Input system was already deterministic with 28 transitions.
Finished random walk after 48 steps, including 1 resets, run visited all 21 properties in 22 ms. (steps per millisecond=2 )
FORMULA CSRepetitions-PT-02-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CSRepetitions-PT-02-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 4 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(G(p0))||G(p1)))'
Support contains 13 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-03-08 02:06:24] [INFO ] Invariant cache hit.
[2023-03-08 02:06:24] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 02:06:24] [INFO ] Invariant cache hit.
[2023-03-08 02:06:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 02:06:24] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-08 02:06:24] [INFO ] Invariant cache hit.
[2023-03-08 02:06:24] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 418 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (OR (LT s14 1) (LT s20 1)) (OR (LT s9 1) (LT s20 1)) (OR (LT s10 1) (LT s20 1)) (OR (LT s12 1) (LT s20 1))), p0:(AND (OR (LT s9 1) (LT s13 1)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 3 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-00 finished in 681 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) U X(X(!p1)))))'
Support contains 18 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-03-08 02:06:25] [INFO ] Invariant cache hit.
[2023-03-08 02:06:25] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 02:06:25] [INFO ] Invariant cache hit.
[2023-03-08 02:06:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 02:06:25] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-08 02:06:25] [INFO ] Invariant cache hit.
[2023-03-08 02:06:25] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 455 ms :[p1, p1, p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (OR (LT s9 1) (LT s13 1)) (OR (LT s14 1) (LT s15 1)) (OR (LT s10 1) (LT s11 1)) (OR (LT s5 1) (LT s14 1)) (OR (LT s2 1) (LT s9 1)) (OR (LT s7 1) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21063 reset in 449 ms.
Stack based approach found an accepted trace after 26003 steps with 5494 reset with depth 15 and stack size 15 in 71 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-03 finished in 1169 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)) U (G(!p0) U X(X(p1)))))'
Support contains 20 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-03-08 02:06:26] [INFO ] Invariant cache hit.
[2023-03-08 02:06:26] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 02:06:26] [INFO ] Invariant cache hit.
[2023-03-08 02:06:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 02:06:26] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-08 02:06:26] [INFO ] Invariant cache hit.
[2023-03-08 02:06:26] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 567 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (LT s16 1) (LT s0 1) (LT s19 1) (LT s4 1)), p1:(AND (OR (GEQ s3 1) (GEQ s21 1) (GEQ s6 1) (GEQ s22 1)) (OR (AND (GEQ s9 1) (GEQ s13 1)) (AND (GEQ ...], 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]]
Stuttering criterion allowed to conclude after 142 steps with 44 reset in 1 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-05 finished in 750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0)||(G(p0)&&F(p1))))'
Support contains 11 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-03-08 02:06:27] [INFO ] Invariant cache hit.
[2023-03-08 02:06:27] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 02:06:27] [INFO ] Invariant cache hit.
[2023-03-08 02:06:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 02:06:27] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-08 02:06:27] [INFO ] Invariant cache hit.
[2023-03-08 02:06:27] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 300 ms :[true, p0, (AND p0 (NOT p1)), false, (NOT p0), (AND p0 (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(AND (LT s16 1) (LT s0 1) (LT s19 1) (LT s4 1)), p1:(AND (OR (LT s14 1) (LT s20 1)) (OR (LT s9 1) (LT s20 1)) (OR (LT s10 1) (LT s20 1)) (OR (LT s12 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-06 finished in 486 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&&F(!p1)))))&&F(!p2))||G((F(!p1)&&F(!p0)))))'
Support contains 13 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-03-08 02:06:27] [INFO ] Invariant cache hit.
[2023-03-08 02:06:27] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 02:06:27] [INFO ] Invariant cache hit.
[2023-03-08 02:06:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 02:06:27] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-08 02:06:27] [INFO ] Invariant cache hit.
[2023-03-08 02:06:28] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 440 ms :[(OR p0 p1), (OR p0 p1), (OR (AND p0 p2) (AND p1 p2)), p0, (AND p2 p0), p1, (AND p2 p1), (OR p0 p1)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 5}, { cond=true, acceptance={} source=1 dest: 7}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2), acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 3}, { cond=p1, acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (OR (GEQ s3 1) (GEQ s21 1) (GEQ s6 1) (GEQ s22 1)) (OR (GEQ s16 1) (GEQ s0 1) (GEQ s19 1) (GEQ s4 1))), p0:(OR (GEQ s3 1) (GEQ s21 1) (GEQ s6 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9821 reset in 217 ms.
Stack based approach found an accepted trace after 198 steps with 18 reset with depth 12 and stack size 12 in 1 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-07 finished in 873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&((G(F(p1)) U p0) U X(p2))))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 19 transition count 26
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 17 transition count 24
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 17 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 15 transition count 22
Applied a total of 14 rules in 14 ms. Remains 15 /23 variables (removed 8) and now considering 22/28 (removed 6) transitions.
[2023-03-08 02:06:28] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 15 cols
[2023-03-08 02:06:28] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 02:06:28] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-08 02:06:28] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2023-03-08 02:06:28] [INFO ] Invariant cache hit.
[2023-03-08 02:06:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 02:06:28] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-08 02:06:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:06:28] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2023-03-08 02:06:28] [INFO ] Invariant cache hit.
[2023-03-08 02:06:28] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/23 places, 22/28 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 15/23 places, 22/28 transitions.
Stuttering acceptance computed with spot in 676 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(NOT p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=(NOT p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s14 1), p2:(AND (GEQ s14 1) (GEQ s4 1) (GEQ s8 1)), p1:(AND (GEQ s6 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-08 finished in 937 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(F(p0))||G(p1))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 15 transition count 24
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 9 transition count 18
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 9 transition count 18
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 8 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 8 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 8 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 6 transition count 13
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 5 transition count 10
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 5 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 2 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 4 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 4 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 4 transition count 7
Applied a total of 36 rules in 18 ms. Remains 4 /23 variables (removed 19) and now considering 7/28 (removed 21) transitions.
// Phase 1: matrix 7 rows 4 cols
[2023-03-08 02:06:29] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 02:06:29] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-08 02:06:29] [INFO ] Invariant cache hit.
[2023-03-08 02:06:29] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-08 02:06:29] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-08 02:06:29] [INFO ] Invariant cache hit.
[2023-03-08 02:06:29] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/23 places, 7/28 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 4/23 places, 7/28 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s2 1), p0:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-09 finished in 294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 17 transition count 25
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 13 transition count 21
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 13 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 11 transition count 19
Applied a total of 21 rules in 7 ms. Remains 11 /23 variables (removed 12) and now considering 19/28 (removed 9) transitions.
[2023-03-08 02:06:29] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 11 cols
[2023-03-08 02:06:29] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 02:06:29] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 02:06:29] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2023-03-08 02:06:29] [INFO ] Invariant cache hit.
[2023-03-08 02:06:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 02:06:30] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-08 02:06:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:06:30] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2023-03-08 02:06:30] [INFO ] Invariant cache hit.
[2023-03-08 02:06:30] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/23 places, 19/28 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 11/23 places, 19/28 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8991 reset in 304 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 10 in 1 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-10 finished in 505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 17 transition count 25
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 13 transition count 21
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 13 transition count 21
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 12 transition count 18
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 12 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 12 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 10 transition count 15
Applied a total of 24 rules in 10 ms. Remains 10 /23 variables (removed 13) and now considering 15/28 (removed 13) transitions.
[2023-03-08 02:06:30] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2023-03-08 02:06:30] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 02:06:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 02:06:30] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2023-03-08 02:06:30] [INFO ] Invariant cache hit.
[2023-03-08 02:06:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 02:06:30] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-08 02:06:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:06:30] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2023-03-08 02:06:30] [INFO ] Invariant cache hit.
[2023-03-08 02:06:30] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/23 places, 15/28 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 10/23 places, 15/28 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9536 reset in 230 ms.
Stack based approach found an accepted trace after 288 steps with 26 reset with depth 9 and stack size 9 in 2 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-11 finished in 459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 17 transition count 25
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 13 transition count 21
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 13 transition count 21
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 12 transition count 18
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 12 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 12 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 10 transition count 15
Applied a total of 24 rules in 10 ms. Remains 10 /23 variables (removed 13) and now considering 15/28 (removed 13) transitions.
[2023-03-08 02:06:30] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2023-03-08 02:06:30] [INFO ] Invariant cache hit.
[2023-03-08 02:06:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-08 02:06:30] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2023-03-08 02:06:30] [INFO ] Invariant cache hit.
[2023-03-08 02:06:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 02:06:30] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-08 02:06:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:06:30] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2023-03-08 02:06:30] [INFO ] Invariant cache hit.
[2023-03-08 02:06:31] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/23 places, 15/28 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 10/23 places, 15/28 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s8 1), p1:(GEQ s2 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-12 finished in 175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 17 transition count 25
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 13 transition count 21
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 13 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 11 transition count 19
Applied a total of 21 rules in 8 ms. Remains 11 /23 variables (removed 12) and now considering 19/28 (removed 9) transitions.
[2023-03-08 02:06:31] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 11 cols
[2023-03-08 02:06:31] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 02:06:31] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 02:06:31] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2023-03-08 02:06:31] [INFO ] Invariant cache hit.
[2023-03-08 02:06:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 02:06:31] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-08 02:06:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:06:31] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2023-03-08 02:06:31] [INFO ] Invariant cache hit.
[2023-03-08 02:06:31] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/23 places, 19/28 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 11/23 places, 19/28 transitions.
Stuttering acceptance computed with spot in 85 ms :[p0, p0]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 1 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-13 finished in 221 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' '!((p0 U X(G(p1))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2023-03-08 02:06:31] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-08 02:06:31] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 02:06:31] [INFO ] Invariant cache hit.
[2023-03-08 02:06:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 02:06:31] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-08 02:06:31] [INFO ] Invariant cache hit.
[2023-03-08 02:06:31] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s17 1)), p0:(OR (LT s6 1) (NOT (AND (GEQ s5 1) (GEQ s14 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-14 finished in 267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||G(p1)) U (!p0&&(p0||G(p1))))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-03-08 02:06:31] [INFO ] Invariant cache hit.
[2023-03-08 02:06:31] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 02:06:31] [INFO ] Invariant cache hit.
[2023-03-08 02:06:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 02:06:31] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-08 02:06:31] [INFO ] Invariant cache hit.
[2023-03-08 02:06:31] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s16 1) (GEQ s6 1)), p0:(GEQ s6 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-15 finished in 316 ms.
All properties solved by simple procedures.
Total runtime 8732 ms.

BK_STOP 1678241192978

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-PT-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CSRepetitions-PT-02, 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 r069-smll-167814395900052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-02.tgz
mv CSRepetitions-PT-02 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 ;