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.r073-smll-167814399000012.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CSRepetitions-COL-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399000012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 11K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 4.4K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K 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-COL-03-LTLFireability-00
FORMULA_NAME CSRepetitions-COL-03-LTLFireability-01
FORMULA_NAME CSRepetitions-COL-03-LTLFireability-02
FORMULA_NAME CSRepetitions-COL-03-LTLFireability-03
FORMULA_NAME CSRepetitions-COL-03-LTLFireability-04
FORMULA_NAME CSRepetitions-COL-03-LTLFireability-05
FORMULA_NAME CSRepetitions-COL-03-LTLFireability-06
FORMULA_NAME CSRepetitions-COL-03-LTLFireability-07
FORMULA_NAME CSRepetitions-COL-03-LTLFireability-08
FORMULA_NAME CSRepetitions-COL-03-LTLFireability-09
FORMULA_NAME CSRepetitions-COL-03-LTLFireability-10
FORMULA_NAME CSRepetitions-COL-03-LTLFireability-11
FORMULA_NAME CSRepetitions-COL-03-LTLFireability-12
FORMULA_NAME CSRepetitions-COL-03-LTLFireability-13
FORMULA_NAME CSRepetitions-COL-03-LTLFireability-14
FORMULA_NAME CSRepetitions-COL-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678218775641

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-07 19:52:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-07 19:52:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 19:52:59] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-07 19:52:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-07 19:53:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 819 ms
[2023-03-07 19:53:00] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 58 PT places and 81.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2023-03-07 19:53:00] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 6 ms.
[2023-03-07 19:53:00] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CSRepetitions-COL-03-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 7 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
Incomplete random walk after 10007 steps, including 320 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 6 cols
[2023-03-07 19:53:00] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-07 19:53:00] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA CSRepetitions-COL-03-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-07 19:53:00] [INFO ] Flatten gal took : 24 ms
[2023-03-07 19:53:00] [INFO ] Flatten gal took : 5 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 3
[2023-03-07 19:53:00] [INFO ] Unfolded HLPN to a Petri net with 38 places and 45 transitions 135 arcs in 13 ms.
[2023-03-07 19:53:00] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 38 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 10 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2023-03-07 19:53:01] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-07 19:53:01] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-07 19:53:01] [INFO ] Invariant cache hit.
[2023-03-07 19:53:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:01] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-07 19:53:01] [INFO ] Invariant cache hit.
[2023-03-07 19:53:01] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 38/38 places, 45/45 transitions.
Support contains 38 out of 38 places after structural reductions.
[2023-03-07 19:53:01] [INFO ] Flatten gal took : 12 ms
[2023-03-07 19:53:01] [INFO ] Flatten gal took : 18 ms
[2023-03-07 19:53:01] [INFO ] Input system was already deterministic with 45 transitions.
Finished random walk after 25 steps, including 0 resets, run visited all 13 properties in 4 ms. (steps per millisecond=6 )
Computed a total of 0 stabilizing places and 9 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((X((X((X(G(!p2)) U (p3&&X(G(!p2)))))||p1))||p0)))'
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:02] [INFO ] Invariant cache hit.
[2023-03-07 19:53:02] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-07 19:53:02] [INFO ] Invariant cache hit.
[2023-03-07 19:53:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:02] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-07 19:53:02] [INFO ] Invariant cache hit.
[2023-03-07 19:53:02] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 544 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (OR (NOT p3) p2), p2, true]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s17 1) (GEQ s19 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s18 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s19 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 3 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-03 finished in 901 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 18 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:02] [INFO ] Invariant cache hit.
[2023-03-07 19:53:02] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-07 19:53:02] [INFO ] Invariant cache hit.
[2023-03-07 19:53:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:03] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-07 19:53:03] [INFO ] Invariant cache hit.
[2023-03-07 19:53:03] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-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 s2 1) (LT s30 1)) (OR (LT s3 1) (LT s31 1)) (OR (LT s6 1) (LT s34 1)) (OR (LT s7 1) (LT s35 1)) (OR (LT s4 1) (LT s32 1)) (OR (LT s5 1) (L...], 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 6 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-04 finished in 411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G(p1)))'
Support contains 18 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 10 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:03] [INFO ] Invariant cache hit.
[2023-03-07 19:53:03] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-07 19:53:03] [INFO ] Invariant cache hit.
[2023-03-07 19:53:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:03] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-07 19:53:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-07 19:53:03] [INFO ] Invariant cache hit.
[2023-03-07 19:53:03] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 346 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s15 1) (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-05 finished in 564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(F(p1)))) U p1))'
Support contains 10 out of 38 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:03] [INFO ] Invariant cache hit.
[2023-03-07 19:53:03] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-07 19:53:03] [INFO ] Invariant cache hit.
[2023-03-07 19:53:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:04] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-07 19:53:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:53:04] [INFO ] Invariant cache hit.
[2023-03-07 19:53:04] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p1)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s17 1) (GEQ s19 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s18 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s19 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]]
Product exploration explored 100000 steps with 18298 reset in 690 ms.
Product exploration explored 100000 steps with 18451 reset in 506 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p1)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
[2023-03-07 19:53:05] [INFO ] Invariant cache hit.
[2023-03-07 19:53:06] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-07 19:53:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:06] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-07 19:53:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-07 19:53:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:06] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-07 19:53:06] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:06] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-07 19:53:06] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-07 19:53:06] [INFO ] Added : 0 causal constraints over 0 iterations in 29 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 10 out of 38 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:06] [INFO ] Invariant cache hit.
[2023-03-07 19:53:06] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-07 19:53:06] [INFO ] Invariant cache hit.
[2023-03-07 19:53:06] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:06] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-07 19:53:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:53:06] [INFO ] Invariant cache hit.
[2023-03-07 19:53:06] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 38/38 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p1)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
[2023-03-07 19:53:07] [INFO ] Invariant cache hit.
[2023-03-07 19:53:07] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-07 19:53:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:07] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-07 19:53:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-07 19:53:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:07] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-07 19:53:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:07] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2023-03-07 19:53:07] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-07 19:53:07] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 59 ms :[(NOT p1)]
Product exploration explored 100000 steps with 18255 reset in 384 ms.
Product exploration explored 100000 steps with 18373 reset in 295 ms.
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 20 transition count 36
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 35 place count 12 transition count 28
Iterating global reduction 0 with 8 rules applied. Total rules applied 43 place count 12 transition count 28
Applied a total of 43 rules in 8 ms. Remains 12 /38 variables (removed 26) and now considering 28/45 (removed 17) transitions.
// Phase 1: matrix 28 rows 12 cols
[2023-03-07 19:53:07] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-07 19:53:08] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-07 19:53:08] [INFO ] Invariant cache hit.
[2023-03-07 19:53:08] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-07 19:53:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:53:08] [INFO ] Invariant cache hit.
[2023-03-07 19:53:08] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/38 places, 28/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 12/38 places, 28/45 transitions.
Treatment of property CSRepetitions-COL-03-LTLFireability-06 finished in 4291 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||X((F(p2)&&p1)))))'
Support contains 28 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2023-03-07 19:53:08] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-07 19:53:08] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-07 19:53:08] [INFO ] Invariant cache hit.
[2023-03-07 19:53:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:08] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-07 19:53:08] [INFO ] Invariant cache hit.
[2023-03-07 19:53:08] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(AND (OR (LT s0 1) (LT s5 1)) (OR (LT s0 1) (LT s4 1)) (OR (LT s0 1) (LT s7 1)) (OR (LT s0 1) (LT s6 1)) (OR (LT s0 1) (LT s1 1)) (OR (LT s0 1) (LT s3 ...], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-07 finished in 416 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(!p1)||p0))))'
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:08] [INFO ] Invariant cache hit.
[2023-03-07 19:53:08] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-07 19:53:08] [INFO ] Invariant cache hit.
[2023-03-07 19:53:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:08] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-07 19:53:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:08] [INFO ] Invariant cache hit.
[2023-03-07 19:53:08] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s7 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (GEQ s0 1) (GEQ s1 1)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5039 reset in 483 ms.
Stack based approach found an accepted trace after 5277 steps with 262 reset with depth 16 and stack size 16 in 34 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-08 finished in 875 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)||X((G(F(p2))||p1)))))'
Support contains 28 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:09] [INFO ] Invariant cache hit.
[2023-03-07 19:53:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-07 19:53:09] [INFO ] Invariant cache hit.
[2023-03-07 19:53:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:09] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-07 19:53:09] [INFO ] Invariant cache hit.
[2023-03-07 19:53:09] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s15 1)), p1:(OR (AND (GEQ s0 1) (GEQ s5 1)) (A...], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33196 reset in 402 ms.
Product exploration explored 100000 steps with 33338 reset in 347 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 9 factoid took 774 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Finished random walk after 34 steps, including 0 resets, run visited all 10 properties in 4 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND p0 (NOT p1))), (F p0), (F p1), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 845 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Support contains 28 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:13] [INFO ] Invariant cache hit.
[2023-03-07 19:53:13] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-07 19:53:13] [INFO ] Invariant cache hit.
[2023-03-07 19:53:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:13] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-07 19:53:13] [INFO ] Invariant cache hit.
[2023-03-07 19:53:13] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 38/38 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 9 factoid took 643 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Finished random walk after 65 steps, including 2 resets, run visited all 10 properties in 12 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND p0 (NOT p1))), (F p0), (F p1), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 1276 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Product exploration explored 100000 steps with 33100 reset in 321 ms.
Product exploration explored 100000 steps with 33347 reset in 341 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Support contains 28 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:17] [INFO ] Invariant cache hit.
[2023-03-07 19:53:18] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 38/38 places, 45/45 transitions.
Support contains 28 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:18] [INFO ] Invariant cache hit.
[2023-03-07 19:53:18] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-07 19:53:18] [INFO ] Invariant cache hit.
[2023-03-07 19:53:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:18] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-07 19:53:18] [INFO ] Invariant cache hit.
[2023-03-07 19:53:18] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 38/38 places, 45/45 transitions.
Treatment of property CSRepetitions-COL-03-LTLFireability-09 finished in 8852 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((G(!p1)||p0))))))'
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:18] [INFO ] Invariant cache hit.
[2023-03-07 19:53:18] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-07 19:53:18] [INFO ] Invariant cache hit.
[2023-03-07 19:53:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:18] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-07 19:53:18] [INFO ] Invariant cache hit.
[2023-03-07 19:53:18] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1)), p0:(OR (AND (GEQ s12 1) (GEQ s19 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 17794 reset in 255 ms.
Product exploration explored 100000 steps with 17732 reset in 282 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 27 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-07 19:53:20] [INFO ] Invariant cache hit.
[2023-03-07 19:53:20] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-07 19:53:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:20] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-07 19:53:20] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:20] [INFO ] [Real]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-07 19:53:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-07 19:53:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:20] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-07 19:53:20] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-07 19:53:20] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-07 19:53:20] [INFO ] Added : 4 causal constraints over 1 iterations in 40 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:20] [INFO ] Invariant cache hit.
[2023-03-07 19:53:20] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-07 19:53:20] [INFO ] Invariant cache hit.
[2023-03-07 19:53:20] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:20] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-07 19:53:20] [INFO ] Invariant cache hit.
[2023-03-07 19:53:21] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 38/38 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-07 19:53:22] [INFO ] Invariant cache hit.
[2023-03-07 19:53:22] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-07 19:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:22] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-07 19:53:22] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:22] [INFO ] [Real]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-07 19:53:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-07 19:53:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:22] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-07 19:53:22] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-07 19:53:22] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-07 19:53:22] [INFO ] Added : 4 causal constraints over 1 iterations in 26 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 17685 reset in 275 ms.
Product exploration explored 100000 steps with 17712 reset in 307 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:53:23] [INFO ] Invariant cache hit.
[2023-03-07 19:53:23] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 38/38 places, 45/45 transitions.
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:23] [INFO ] Invariant cache hit.
[2023-03-07 19:53:23] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-07 19:53:23] [INFO ] Invariant cache hit.
[2023-03-07 19:53:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:23] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-07 19:53:23] [INFO ] Invariant cache hit.
[2023-03-07 19:53:23] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 38/38 places, 45/45 transitions.
Treatment of property CSRepetitions-COL-03-LTLFireability-10 finished in 5552 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 (F(G(!p1)) U (F(!p2) U p1))))'
Support contains 20 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:23] [INFO ] Invariant cache hit.
[2023-03-07 19:53:23] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-07 19:53:23] [INFO ] Invariant cache hit.
[2023-03-07 19:53:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:24] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-07 19:53:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:24] [INFO ] Invariant cache hit.
[2023-03-07 19:53:24] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (AND p1 p2)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s17 1) (GEQ s19 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s18 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s19 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 26805 reset in 593 ms.
Product exploration explored 100000 steps with 26766 reset in 584 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 11 factoid took 628 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) p2), (NOT p1), (AND p1 p2)]
Finished random walk after 8 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F p1), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 11 factoid took 817 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) p2), (NOT p1), (AND p1 p2)]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) p2), (NOT p1), (AND p1 p2)]
[2023-03-07 19:53:27] [INFO ] Invariant cache hit.
[2023-03-07 19:53:27] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-07 19:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:27] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-07 19:53:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-07 19:53:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:27] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-07 19:53:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:27] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-07 19:53:27] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-07 19:53:27] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-07 19:53:27] [INFO ] Invariant cache hit.
[2023-03-07 19:53:27] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-07 19:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:27] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-07 19:53:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-07 19:53:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:27] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-07 19:53:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:27] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-07 19:53:27] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-07 19:53:27] [INFO ] Added : 4 causal constraints over 1 iterations in 23 ms. Result :sat
Could not prove EG p2
Support contains 20 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:27] [INFO ] Invariant cache hit.
[2023-03-07 19:53:28] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-07 19:53:28] [INFO ] Invariant cache hit.
[2023-03-07 19:53:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:28] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-07 19:53:28] [INFO ] Invariant cache hit.
[2023-03-07 19:53:28] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 38/38 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 6 factoid took 359 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) p2), (NOT p1), (AND p1 p2)]
Finished random walk after 9 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 427 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) p2), (NOT p1), (AND p1 p2)]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) p2), (NOT p1), (AND p1 p2)]
[2023-03-07 19:53:29] [INFO ] Invariant cache hit.
[2023-03-07 19:53:29] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-07 19:53:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:29] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-07 19:53:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-07 19:53:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:29] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-07 19:53:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:29] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-07 19:53:29] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-07 19:53:29] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-07 19:53:29] [INFO ] Invariant cache hit.
[2023-03-07 19:53:29] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-07 19:53:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:29] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-07 19:53:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-07 19:53:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:29] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-07 19:53:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:29] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2023-03-07 19:53:29] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-07 19:53:29] [INFO ] Added : 4 causal constraints over 1 iterations in 22 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) p2), (NOT p1), (AND p1 p2)]
Product exploration explored 100000 steps with 26789 reset in 272 ms.
Product exploration explored 100000 steps with 26733 reset in 223 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) p2), (NOT p1), (AND p1 p2)]
Support contains 20 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:30] [INFO ] Invariant cache hit.
[2023-03-07 19:53:30] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 38/38 places, 45/45 transitions.
Support contains 20 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:30] [INFO ] Invariant cache hit.
[2023-03-07 19:53:31] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-07 19:53:31] [INFO ] Invariant cache hit.
[2023-03-07 19:53:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:31] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-07 19:53:31] [INFO ] Invariant cache hit.
[2023-03-07 19:53:31] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 38/38 places, 45/45 transitions.
Treatment of property CSRepetitions-COL-03-LTLFireability-11 finished in 7278 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)&&F((G(p1)||G((p2&&X(p2))))))))'
Support contains 36 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:31] [INFO ] Invariant cache hit.
[2023-03-07 19:53:31] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-07 19:53:31] [INFO ] Invariant cache hit.
[2023-03-07 19:53:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:31] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-07 19:53:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:31] [INFO ] Invariant cache hit.
[2023-03-07 19:53:31] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s30 1)) (OR (LT s3 1) (LT s31 1)) (OR (LT s6 1) (LT s34 1)) (OR (LT s7 1) (LT s35 1)) (OR (LT s4 1) (LT s32 1)) (OR (LT s5 1) (L...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 89 steps with 7 reset in 1 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-12 finished in 372 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)||X(p1)) U p2)||X(X(F(p3))))))'
Support contains 29 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:31] [INFO ] Invariant cache hit.
[2023-03-07 19:53:31] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-07 19:53:31] [INFO ] Invariant cache hit.
[2023-03-07 19:53:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:31] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-07 19:53:31] [INFO ] Invariant cache hit.
[2023-03-07 19:53:31] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p3))]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s15 1)), p0:(AND (OR (LT s0 1) (LT s5 1)) (OR ...], 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25703 reset in 273 ms.
Product exploration explored 100000 steps with 25713 reset in 505 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p3), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 5 factoid took 331 ms. Reduced automaton from 7 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) p0)]
Finished random walk after 39 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p3), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND (NOT p3) p0)), (F (AND (NOT p3) (NOT p1) p0)), (F p2), (F (AND (NOT p3) p0 (NOT p2))), (F (AND (NOT p3) (NOT p2)))]
Knowledge based reduction with 5 factoid took 605 ms. Reduced automaton from 6 states, 7 edges and 4 AP (stutter sensitive) to 6 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 488 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) p0)]
Stuttering acceptance computed with spot in 380 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) p0)]
Support contains 29 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:35] [INFO ] Invariant cache hit.
[2023-03-07 19:53:35] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-07 19:53:35] [INFO ] Invariant cache hit.
[2023-03-07 19:53:35] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:35] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-07 19:53:35] [INFO ] Invariant cache hit.
[2023-03-07 19:53:35] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 38/38 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 p0 (NOT p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 6 states, 7 edges and 4 AP (stutter sensitive) to 6 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p2) p3 p0 (NOT p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND p0 (NOT p3))), (F (AND p0 (NOT p1) (NOT p3))), (F p2), (F (AND p0 (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 1 factoid took 377 ms. Reduced automaton from 6 states, 7 edges and 4 AP (stutter sensitive) to 6 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 393 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) p0)]
Stuttering acceptance computed with spot in 378 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) p0)]
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) p0)]
Product exploration explored 100000 steps with 25722 reset in 246 ms.
Product exploration explored 100000 steps with 25717 reset in 281 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 378 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) p0)]
Support contains 29 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:38] [INFO ] Invariant cache hit.
[2023-03-07 19:53:38] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54 ms. Remains : 38/38 places, 45/45 transitions.
Support contains 29 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:38] [INFO ] Invariant cache hit.
[2023-03-07 19:53:38] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-07 19:53:38] [INFO ] Invariant cache hit.
[2023-03-07 19:53:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:38] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-07 19:53:38] [INFO ] Invariant cache hit.
[2023-03-07 19:53:38] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 38/38 places, 45/45 transitions.
Treatment of property CSRepetitions-COL-03-LTLFireability-13 finished in 7294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:38] [INFO ] Invariant cache hit.
[2023-03-07 19:53:38] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-07 19:53:38] [INFO ] Invariant cache hit.
[2023-03-07 19:53:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:38] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-07 19:53:38] [INFO ] Invariant cache hit.
[2023-03-07 19:53:39] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s0 1) (LT s5 1)) (OR (LT s0 1) (LT s4 1)) (OR (LT s0 1) (LT s7 1)) (OR (LT s0 1) (LT s6 1)) (OR (LT s0 1) (LT s1 1)) (OR (LT s0 1) (LT s3 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8753 reset in 421 ms.
Product exploration explored 100000 steps with 8776 reset in 536 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 363 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Finished random walk after 144 steps, including 5 resets, run visited all 4 properties in 3 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 423 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 8 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:41] [INFO ] Invariant cache hit.
[2023-03-07 19:53:41] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-07 19:53:41] [INFO ] Invariant cache hit.
[2023-03-07 19:53:41] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:41] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-07 19:53:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:53:41] [INFO ] Invariant cache hit.
[2023-03-07 19:53:41] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 38/38 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 425 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Finished random walk after 468 steps, including 18 resets, run visited all 4 properties in 7 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 583 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 14827 reset in 227 ms.
Product exploration explored 100000 steps with 14946 reset in 393 ms.
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:43] [INFO ] Invariant cache hit.
[2023-03-07 19:53:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-07 19:53:43] [INFO ] Invariant cache hit.
[2023-03-07 19:53:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:43] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-07 19:53:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:43] [INFO ] Invariant cache hit.
[2023-03-07 19:53:43] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 38/38 places, 45/45 transitions.
Treatment of property CSRepetitions-COL-03-LTLFireability-14 finished in 5141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(F(p1)))) U p1))'
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)||X((G(F(p2))||p1)))))'
Found a Lengthening insensitive property : CSRepetitions-COL-03-LTLFireability-09
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Support contains 28 out of 38 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:44] [INFO ] Invariant cache hit.
[2023-03-07 19:53:44] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-07 19:53:44] [INFO ] Invariant cache hit.
[2023-03-07 19:53:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:44] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-07 19:53:44] [INFO ] Invariant cache hit.
[2023-03-07 19:53:44] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 178 ms. Remains : 38/38 places, 45/45 transitions.
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s15 1)), p1:(OR (AND (GEQ s0 1) (GEQ s5 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33197 reset in 323 ms.
Product exploration explored 100000 steps with 33353 reset in 334 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 9 factoid took 805 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Finished random walk after 45 steps, including 1 resets, run visited all 10 properties in 5 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND p0 (NOT p1))), (F p0), (F p1), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 1138 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Support contains 28 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:48] [INFO ] Invariant cache hit.
[2023-03-07 19:53:48] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-07 19:53:48] [INFO ] Invariant cache hit.
[2023-03-07 19:53:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:48] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-07 19:53:48] [INFO ] Invariant cache hit.
[2023-03-07 19:53:48] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 38/38 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 9 factoid took 513 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Finished random walk after 23 steps, including 0 resets, run visited all 10 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND p0 (NOT p1))), (F p0), (F p1), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 1075 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Product exploration explored 100000 steps with 33050 reset in 312 ms.
Product exploration explored 100000 steps with 33117 reset in 305 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Support contains 28 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:52] [INFO ] Invariant cache hit.
[2023-03-07 19:53:52] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53 ms. Remains : 38/38 places, 45/45 transitions.
Support contains 28 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:52] [INFO ] Invariant cache hit.
[2023-03-07 19:53:52] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-07 19:53:52] [INFO ] Invariant cache hit.
[2023-03-07 19:53:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:52] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-07 19:53:52] [INFO ] Invariant cache hit.
[2023-03-07 19:53:52] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 38/38 places, 45/45 transitions.
Treatment of property CSRepetitions-COL-03-LTLFireability-09 finished in 8340 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((G(!p1)||p0))))))'
Found a Shortening insensitive property : CSRepetitions-COL-03-LTLFireability-10
Stuttering acceptance computed with spot in 204 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:52] [INFO ] Invariant cache hit.
[2023-03-07 19:53:52] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-07 19:53:52] [INFO ] Invariant cache hit.
[2023-03-07 19:53:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:52] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-07 19:53:52] [INFO ] Invariant cache hit.
[2023-03-07 19:53:53] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 233 ms. Remains : 38/38 places, 45/45 transitions.
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1)), p0:(OR (AND (GEQ s12 1) (GEQ s19 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 17686 reset in 253 ms.
Product exploration explored 100000 steps with 17735 reset in 278 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-07 19:53:54] [INFO ] Invariant cache hit.
[2023-03-07 19:53:54] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-07 19:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:54] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-07 19:53:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:54] [INFO ] [Real]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-07 19:53:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-07 19:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:54] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-07 19:53:54] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2023-03-07 19:53:54] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-07 19:53:54] [INFO ] Added : 4 causal constraints over 1 iterations in 23 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:54] [INFO ] Invariant cache hit.
[2023-03-07 19:53:54] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-07 19:53:54] [INFO ] Invariant cache hit.
[2023-03-07 19:53:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:54] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-07 19:53:54] [INFO ] Invariant cache hit.
[2023-03-07 19:53:55] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 38/38 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 41 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-07 19:53:55] [INFO ] Invariant cache hit.
[2023-03-07 19:53:56] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-07 19:53:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:56] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-07 19:53:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:56] [INFO ] [Real]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-07 19:53:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-07 19:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:56] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-07 19:53:56] [INFO ] [Nat]Added 9 Read/Feed constraints in 5 ms returned sat
[2023-03-07 19:53:56] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-07 19:53:56] [INFO ] Added : 4 causal constraints over 1 iterations in 26 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 17715 reset in 277 ms.
Product exploration explored 100000 steps with 17746 reset in 305 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:57] [INFO ] Invariant cache hit.
[2023-03-07 19:53:57] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 38/38 places, 45/45 transitions.
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:57] [INFO ] Invariant cache hit.
[2023-03-07 19:53:57] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-07 19:53:57] [INFO ] Invariant cache hit.
[2023-03-07 19:53:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:57] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-07 19:53:57] [INFO ] Invariant cache hit.
[2023-03-07 19:53:57] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 38/38 places, 45/45 transitions.
Treatment of property CSRepetitions-COL-03-LTLFireability-10 finished in 5249 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 (F(G(!p1)) U (F(!p2) U p1))))'
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)||X(p1)) U p2)||X(X(F(p3))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Found a Shortening insensitive property : CSRepetitions-COL-03-LTLFireability-14
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:58] [INFO ] Invariant cache hit.
[2023-03-07 19:53:58] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-07 19:53:58] [INFO ] Invariant cache hit.
[2023-03-07 19:53:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:58] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-07 19:53:58] [INFO ] Invariant cache hit.
[2023-03-07 19:53:58] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 199 ms. Remains : 38/38 places, 45/45 transitions.
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s0 1) (LT s5 1)) (OR (LT s0 1) (LT s4 1)) (OR (LT s0 1) (LT s7 1)) (OR (LT s0 1) (LT s6 1)) (OR (LT s0 1) (LT s1 1)) (OR (LT s0 1) (LT s3 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8718 reset in 329 ms.
Product exploration explored 100000 steps with 8756 reset in 361 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 490 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Finished random walk after 1024 steps, including 36 resets, run visited all 4 properties in 8 ms. (steps per millisecond=128 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 556 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:54:00] [INFO ] Invariant cache hit.
[2023-03-07 19:54:00] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-07 19:54:00] [INFO ] Invariant cache hit.
[2023-03-07 19:54:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:54:00] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-07 19:54:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:54:00] [INFO ] Invariant cache hit.
[2023-03-07 19:54:00] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 38/38 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 409 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Finished random walk after 1041 steps, including 40 resets, run visited all 4 properties in 9 ms. (steps per millisecond=115 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 425 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 15027 reset in 350 ms.
Product exploration explored 100000 steps with 14773 reset in 374 ms.
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:54:03] [INFO ] Invariant cache hit.
[2023-03-07 19:54:03] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-07 19:54:03] [INFO ] Invariant cache hit.
[2023-03-07 19:54:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:54:03] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-07 19:54:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:54:03] [INFO ] Invariant cache hit.
[2023-03-07 19:54:03] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 38/38 places, 45/45 transitions.
Treatment of property CSRepetitions-COL-03-LTLFireability-14 finished in 5251 ms.
[2023-03-07 19:54:03] [INFO ] Flatten gal took : 13 ms
[2023-03-07 19:54:03] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2023-03-07 19:54:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 38 places, 45 transitions and 135 arcs took 1 ms.
Total runtime 64140 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3370/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3370/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3370/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3370/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3370/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3370/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CSRepetitions-COL-03-LTLFireability-06
Could not compute solution for formula : CSRepetitions-COL-03-LTLFireability-09
Could not compute solution for formula : CSRepetitions-COL-03-LTLFireability-10
Could not compute solution for formula : CSRepetitions-COL-03-LTLFireability-11
Could not compute solution for formula : CSRepetitions-COL-03-LTLFireability-13
Could not compute solution for formula : CSRepetitions-COL-03-LTLFireability-14

BK_STOP 1678218846857

--------------------
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
mcc2023
ltl formula name CSRepetitions-COL-03-LTLFireability-06
ltl formula formula --ltl=/tmp/3370/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 38 places, 45 transitions and 135 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3370/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3370/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3370/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3370/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name CSRepetitions-COL-03-LTLFireability-09
ltl formula formula --ltl=/tmp/3370/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 38 places, 45 transitions and 135 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3370/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3370/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3370/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3370/ltl_1_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
double free or corruption (fasttop)
ltl formula name CSRepetitions-COL-03-LTLFireability-10
ltl formula formula --ltl=/tmp/3370/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 38 places, 45 transitions and 135 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3370/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3370/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3370/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3370/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name CSRepetitions-COL-03-LTLFireability-11
ltl formula formula --ltl=/tmp/3370/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 38 places, 45 transitions and 135 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3370/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3370/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3370/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3370/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name CSRepetitions-COL-03-LTLFireability-13
ltl formula formula --ltl=/tmp/3370/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 38 places, 45 transitions and 135 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3370/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3370/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3370/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3370/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name CSRepetitions-COL-03-LTLFireability-14
ltl formula formula --ltl=/tmp/3370/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 38 places, 45 transitions and 135 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3370/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3370/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3370/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3370/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CSRepetitions-COL-03, 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 r073-smll-167814399000012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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