About the Execution of LoLa+red for CSRepetitions-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 403.632 | 29390.00 | 49016.00 | 474.70 | FFFFFFFTFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r071-smll-167814397500076.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-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397500076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 85K Feb 25 11:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 354K Feb 25 11:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 76K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 336K Feb 25 11:56 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 29K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 91K Feb 25 12:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 385K Feb 25 12:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 301K Feb 25 12:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 25 12:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K 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 162K 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-05-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678237148438
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-05
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 00:59:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 00:59:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 00:59:11] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2023-03-08 00:59:11] [INFO ] Transformed 206 places.
[2023-03-08 00:59:11] [INFO ] Transformed 325 transitions.
[2023-03-08 00:59:11] [INFO ] Parsed PT model containing 206 places and 325 transitions and 1175 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CSRepetitions-PT-05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-05-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 206 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 26 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2023-03-08 00:59:12] [INFO ] Computed 30 place invariants in 24 ms
[2023-03-08 00:59:12] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-08 00:59:12] [INFO ] Invariant cache hit.
[2023-03-08 00:59:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 00:59:13] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2023-03-08 00:59:13] [INFO ] Invariant cache hit.
[2023-03-08 00:59:13] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1386 ms. Remains : 206/206 places, 325/325 transitions.
Support contains 206 out of 206 places after structural reductions.
[2023-03-08 00:59:14] [INFO ] Flatten gal took : 225 ms
[2023-03-08 00:59:14] [INFO ] Flatten gal took : 89 ms
[2023-03-08 00:59:14] [INFO ] Input system was already deterministic with 325 transitions.
Finished random walk after 1585 steps, including 26 resets, run visited all 18 properties in 172 ms. (steps per millisecond=9 )
Computed a total of 0 stabilizing places and 25 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' '!(G(((G(p0)&&F(p1)) U X(G(!(X(p1)&&!p1))))))'
Support contains 51 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 27 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2023-03-08 00:59:15] [INFO ] Invariant cache hit.
[2023-03-08 00:59:15] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-08 00:59:15] [INFO ] Invariant cache hit.
[2023-03-08 00:59:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 00:59:16] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
[2023-03-08 00:59:16] [INFO ] Invariant cache hit.
[2023-03-08 00:59:16] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1150 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 738 ms :[false, false, false, p1, true, (AND (NOT p0) p1), false, (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 0}, { cond=(AND p0 p1), acceptance={} source=6 dest: 1}, { cond=(AND p0 p1), acceptance={} source=6 dest: 2}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=2, aps=[p1:(OR (GEQ s67 1) (GEQ s192 1) (GEQ s197 1) (GEQ s133 1) (GEQ s72 1) (GEQ s137 1) (GEQ s15 1) (GEQ s82 1) (GEQ s145 1) (GEQ s20 1) (GEQ s23 1) (GEQ s153 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 117 steps with 12 reset in 9 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-00 finished in 1993 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 25 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 156 transition count 300
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 195 place count 36 transition count 180
Iterating global reduction 0 with 120 rules applied. Total rules applied 315 place count 36 transition count 180
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 330 place count 26 transition count 175
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 430 place count 26 transition count 75
Applied a total of 430 rules in 87 ms. Remains 26 /206 variables (removed 180) and now considering 75/325 (removed 250) transitions.
// Phase 1: matrix 75 rows 26 cols
[2023-03-08 00:59:17] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 00:59:17] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 00:59:17] [INFO ] Invariant cache hit.
[2023-03-08 00:59:17] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-08 00:59:17] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 00:59:17] [INFO ] Invariant cache hit.
[2023-03-08 00:59:17] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/206 places, 75/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 280 ms. Remains : 26/206 places, 75/325 transitions.
Stuttering acceptance computed with spot in 56 ms :[p0]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s8 1) (GEQ s24 1) (GEQ s25 1) (GEQ s16 1) (GEQ s9 1) (GEQ s17 1) (GEQ s0 1) (GEQ s10 1) (GEQ s18 1) (GEQ s1 1) (GEQ s2 1) (GEQ s19 1) (GEQ s3 ...], 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 4774 reset in 761 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-01 finished in 1121 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)))'
Support contains 25 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 10 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2023-03-08 00:59:18] [INFO ] Computed 30 place invariants in 5 ms
[2023-03-08 00:59:18] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-08 00:59:18] [INFO ] Invariant cache hit.
[2023-03-08 00:59:19] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 00:59:19] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
[2023-03-08 00:59:19] [INFO ] Invariant cache hit.
[2023-03-08 00:59:19] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1355 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s0 1) (LT s130 1) (LT s131 1) (LT s66 1) (LT s8 1) (LT s138 1) (LT s75 1) (LT s141 1) (LT s19 1) (LT s151 1) (LT s25 1) (LT s29 1) (LT s96 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][false, false]]
Product exploration explored 100000 steps with 1336 reset in 844 ms.
Stack based approach found an accepted trace after 11101 steps with 152 reset with depth 10 and stack size 10 in 134 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-02 finished in 2463 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 30 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2023-03-08 00:59:20] [INFO ] Invariant cache hit.
[2023-03-08 00:59:21] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-08 00:59:21] [INFO ] Invariant cache hit.
[2023-03-08 00:59:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 00:59:21] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2023-03-08 00:59:21] [INFO ] Invariant cache hit.
[2023-03-08 00:59:21] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 904 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s169 1) (LT s187 1)) (OR (LT s100 1) (LT s183 1)) (OR (LT s42 1) (LT s187 1)) (OR (LT s100 1) (LT s122 1)) (OR (LT s38 1) (LT s192 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-04 finished in 1124 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))&&(!p1 U (G(!p1)||(!p1&&G(p0))))))'
Support contains 51 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2023-03-08 00:59:22] [INFO ] Invariant cache hit.
[2023-03-08 00:59:22] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-08 00:59:22] [INFO ] Invariant cache hit.
[2023-03-08 00:59:22] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 00:59:22] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2023-03-08 00:59:22] [INFO ] Invariant cache hit.
[2023-03-08 00:59:23] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1039 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p0) p1), true, (NOT p0), p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (GEQ s86 1) (GEQ s123 1)) (AND (GEQ s73 1) (GEQ s86 1)) (AND (GEQ s86 1) (GEQ s126 1)) (AND (GEQ s86 1) (GEQ s198 1)) (AND (GEQ s53 1) (GEQ s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-05 finished in 1422 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||X(G(p0))))))'
Support contains 25 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2023-03-08 00:59:23] [INFO ] Invariant cache hit.
[2023-03-08 00:59:23] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-08 00:59:23] [INFO ] Invariant cache hit.
[2023-03-08 00:59:24] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 00:59:24] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
[2023-03-08 00:59:24] [INFO ] Invariant cache hit.
[2023-03-08 00:59:24] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1307 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), false, false]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (GEQ s67 1) (GEQ s192 1) (GEQ s197 1) (GEQ s133 1) (GEQ s72 1) (GEQ s137 1) (GEQ s15 1) (GEQ s82 1) (GEQ s145 1) (GEQ s20 1) (GEQ s23 1) (GEQ s153 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-06 finished in 1521 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((X(p1)||(p1&&X(!p2))||p0))))'
Support contains 200 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2023-03-08 00:59:25] [INFO ] Invariant cache hit.
[2023-03-08 00:59:25] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-08 00:59:25] [INFO ] Invariant cache hit.
[2023-03-08 00:59:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 00:59:25] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-08 00:59:25] [INFO ] Invariant cache hit.
[2023-03-08 00:59:25] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 856 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s0 1) (GEQ s130 1) (GEQ s131 1) (GEQ s66 1) (GEQ s8 1) (GEQ s138 1) (GEQ s75 1) (GEQ s141 1) (GEQ s19 1) (GEQ s151 1) (GEQ s25 1) (GEQ s29 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 50000 reset in 507 ms.
Product exploration explored 100000 steps with 50000 reset in 491 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 361 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-05-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-05-LTLFireability-07 finished in 2502 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))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 72 place count 158 transition count 301
Discarding 115 places :
Symmetric choice reduction at 0 with 115 rule applications. Total rules 187 place count 43 transition count 186
Iterating global reduction 0 with 115 rules applied. Total rules applied 302 place count 43 transition count 186
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 322 place count 23 transition count 66
Iterating global reduction 0 with 20 rules applied. Total rules applied 342 place count 23 transition count 66
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 362 place count 23 transition count 46
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 372 place count 18 transition count 41
Applied a total of 372 rules in 59 ms. Remains 18 /206 variables (removed 188) and now considering 41/325 (removed 284) transitions.
[2023-03-08 00:59:27] [INFO ] Flow matrix only has 25 transitions (discarded 16 similar events)
// Phase 1: matrix 25 rows 18 cols
[2023-03-08 00:59:27] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-08 00:59:27] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-08 00:59:27] [INFO ] Flow matrix only has 25 transitions (discarded 16 similar events)
[2023-03-08 00:59:27] [INFO ] Invariant cache hit.
[2023-03-08 00:59:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 00:59:27] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-08 00:59:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 00:59:27] [INFO ] Flow matrix only has 25 transitions (discarded 16 similar events)
[2023-03-08 00:59:27] [INFO ] Invariant cache hit.
[2023-03-08 00:59:27] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/206 places, 41/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 263 ms. Remains : 18/206 places, 41/325 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 27 steps with 2 reset in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-08 finished in 331 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(X(F(p0)))))'
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2023-03-08 00:59:27] [INFO ] Computed 30 place invariants in 4 ms
[2023-03-08 00:59:28] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-08 00:59:28] [INFO ] Invariant cache hit.
[2023-03-08 00:59:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 00:59:28] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2023-03-08 00:59:28] [INFO ] Invariant cache hit.
[2023-03-08 00:59:29] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1314 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LT s184 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 3814 reset in 712 ms.
Stack based approach found an accepted trace after 5568 steps with 199 reset with depth 41 and stack size 41 in 33 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-09 finished in 2293 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) U (p1&&G(p0)))))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2023-03-08 00:59:30] [INFO ] Invariant cache hit.
[2023-03-08 00:59:30] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-08 00:59:30] [INFO ] Invariant cache hit.
[2023-03-08 00:59:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 00:59:30] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2023-03-08 00:59:30] [INFO ] Invariant cache hit.
[2023-03-08 00:59:30] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 842 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s178 1), p1:(GEQ s137 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 1 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-10 finished in 1042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||F(G(p2)))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2023-03-08 00:59:31] [INFO ] Invariant cache hit.
[2023-03-08 00:59:31] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-08 00:59:31] [INFO ] Invariant cache hit.
[2023-03-08 00:59:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 00:59:31] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2023-03-08 00:59:31] [INFO ] Invariant cache hit.
[2023-03-08 00:59:32] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1236 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (GEQ s41 1) (GEQ s86 1)), p0:(AND (GEQ s28 1) (GEQ s35 1)), p2:(AND (OR (LT s41 1) (LT s86 1)) (OR (LT s63 1) (LT s86 1)))], 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 explored 100000 steps with 1375 reset in 842 ms.
Stack based approach found an accepted trace after 3619 steps with 49 reset with depth 84 and stack size 84 in 33 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-12 finished in 2334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&F((p1&&G(p2))))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2023-03-08 00:59:33] [INFO ] Invariant cache hit.
[2023-03-08 00:59:33] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-08 00:59:33] [INFO ] Invariant cache hit.
[2023-03-08 00:59:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 00:59:34] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2023-03-08 00:59:34] [INFO ] Invariant cache hit.
[2023-03-08 00:59:34] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1054 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s86 1) (GEQ s146 1)), p1:(GEQ s178 1), p2:(LT s131 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-13 finished in 1452 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(p0) U p1))||X(p0)))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2023-03-08 00:59:34] [INFO ] Invariant cache hit.
[2023-03-08 00:59:35] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-08 00:59:35] [INFO ] Invariant cache hit.
[2023-03-08 00:59:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 00:59:35] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2023-03-08 00:59:35] [INFO ] Invariant cache hit.
[2023-03-08 00:59:35] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 997 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(OR p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s113 1) (GEQ s129 1)), p0:(GEQ s45 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-14 finished in 1360 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&&(p1 U p2)))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 0 with 69 rules applied. Total rules applied 69 place count 160 transition count 302
Discarding 110 places :
Symmetric choice reduction at 0 with 110 rule applications. Total rules 179 place count 50 transition count 192
Iterating global reduction 0 with 110 rules applied. Total rules applied 289 place count 50 transition count 192
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 307 place count 32 transition count 84
Iterating global reduction 0 with 18 rules applied. Total rules applied 325 place count 32 transition count 84
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 343 place count 32 transition count 66
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 353 place count 27 transition count 61
Applied a total of 353 rules in 34 ms. Remains 27 /206 variables (removed 179) and now considering 61/325 (removed 264) transitions.
[2023-03-08 00:59:36] [INFO ] Flow matrix only has 41 transitions (discarded 20 similar events)
// Phase 1: matrix 41 rows 27 cols
[2023-03-08 00:59:36] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-08 00:59:36] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 00:59:36] [INFO ] Flow matrix only has 41 transitions (discarded 20 similar events)
[2023-03-08 00:59:36] [INFO ] Invariant cache hit.
[2023-03-08 00:59:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 00:59:36] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-08 00:59:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 00:59:36] [INFO ] Flow matrix only has 41 transitions (discarded 20 similar events)
[2023-03-08 00:59:36] [INFO ] Invariant cache hit.
[2023-03-08 00:59:36] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/206 places, 61/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 27/206 places, 61/325 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(GEQ s24 1), p0:(OR (LT s8 1) (LT s12 1)), p1:(AND (GEQ s9 1) (GEQ s15 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 24 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-15 finished in 381 ms.
All properties solved by simple procedures.
Total runtime 25084 ms.
ITS solved all properties within timeout
BK_STOP 1678237177828
--------------------
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
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-05"
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-05, 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-167814397500076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-05.tgz
mv CSRepetitions-PT-05 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 '
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 ;