Execution Chart

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

Trace from the execution

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

--------------------
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 1678218769765

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-03
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-07 19:52:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-07 19:52:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 19:52:53] [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:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-07 19:52:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 830 ms
[2023-03-07 19:52:54] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 58 PT places and 81.0 transition bindings in 46 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2023-03-07 19:52:54] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 8 ms.
[2023-03-07 19:52:54] [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 10000 steps, including 317 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10000 steps, including 116 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 6 cols
[2023-03-07 19:52:54] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-07 19:52:54] [INFO ] After 161ms 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 1 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:52:54] [INFO ] Flatten gal took : 29 ms
[2023-03-07 19:52:54] [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:52:54] [INFO ] Unfolded HLPN to a Petri net with 38 places and 45 transitions 135 arcs in 15 ms.
[2023-03-07 19:52:54] [INFO ] Unfolded 12 HLPN properties in 1 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 23 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:52:55] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-07 19:52:55] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-07 19:52:55] [INFO ] Invariant cache hit.
[2023-03-07 19:52:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:52:55] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-07 19:52:55] [INFO ] Invariant cache hit.
[2023-03-07 19:52:55] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 38/38 places, 45/45 transitions.
Support contains 38 out of 38 places after structural reductions.
[2023-03-07 19:52:55] [INFO ] Flatten gal took : 18 ms
[2023-03-07 19:52:55] [INFO ] Flatten gal took : 20 ms
[2023-03-07 19:52:55] [INFO ] Input system was already deterministic with 45 transitions.
Finished random walk after 41 steps, including 0 resets, run visited all 13 properties in 6 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 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:52:56] [INFO ] Invariant cache hit.
[2023-03-07 19:52:56] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-07 19:52:56] [INFO ] Invariant cache hit.
[2023-03-07 19:52:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:52:56] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-07 19:52:56] [INFO ] Invariant cache hit.
[2023-03-07 19:52:56] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 422 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 2 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-03 finished in 693 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 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:52:56] [INFO ] Invariant cache hit.
[2023-03-07 19:52:56] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-07 19:52:56] [INFO ] Invariant cache hit.
[2023-03-07 19:52:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:52:56] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-07 19:52:56] [INFO ] Invariant cache hit.
[2023-03-07 19:52:56] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 120 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 0 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-04 finished in 345 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 8 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:52:57] [INFO ] Invariant cache hit.
[2023-03-07 19:52:57] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-07 19:52:57] [INFO ] Invariant cache hit.
[2023-03-07 19:52:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:52:57] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-07 19:52:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:52:57] [INFO ] Invariant cache hit.
[2023-03-07 19:52:57] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 278 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 177 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 23 steps with 0 reset in 5 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-05 finished in 483 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:52:57] [INFO ] Invariant cache hit.
[2023-03-07 19:52:57] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-07 19:52:57] [INFO ] Invariant cache hit.
[2023-03-07 19:52:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:52:57] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-07 19:52:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:52:57] [INFO ] Invariant cache hit.
[2023-03-07 19:52:57] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 38 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 18369 reset in 619 ms.
Product exploration explored 100000 steps with 18322 reset in 462 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 117 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
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 135 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 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
[2023-03-07 19:52:59] [INFO ] Invariant cache hit.
[2023-03-07 19:52:59] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-07 19:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:52:59] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-07 19:52:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:52:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-07 19:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:52:59] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-07 19:52:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:52:59] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2023-03-07 19:52:59] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-07 19:52:59] [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:52:59] [INFO ] Invariant cache hit.
[2023-03-07 19:52:59] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-07 19:52:59] [INFO ] Invariant cache hit.
[2023-03-07 19:52:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:52:59] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-07 19:52:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:52:59] [INFO ] Invariant cache hit.
[2023-03-07 19:52:59] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 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 163 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 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
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 200 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 52 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
[2023-03-07 19:53:00] [INFO ] Invariant cache hit.
[2023-03-07 19:53:00] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-07 19:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:00] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-07 19:53:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-07 19:53:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:00] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-07 19:53:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:00] [INFO ] [Nat]Added 9 Read/Feed constraints in 5 ms returned sat
[2023-03-07 19:53:00] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-07 19:53:00] [INFO ] Added : 0 causal constraints over 0 iterations in 22 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Product exploration explored 100000 steps with 18279 reset in 289 ms.
Product exploration explored 100000 steps with 18344 reset in 364 ms.
Built C files in :
/tmp/ltsmin1518136348919240465
[2023-03-07 19:53:01] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2023-03-07 19:53:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-07 19:53:01] [INFO ] Computing symmetric may enable matrix : 45 transitions.
[2023-03-07 19:53:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-07 19:53:01] [INFO ] Computing Do-Not-Accords matrix : 45 transitions.
[2023-03-07 19:53:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-07 19:53:01] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1518136348919240465
Running compilation step : cd /tmp/ltsmin1518136348919240465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 458 ms.
Running link step : cd /tmp/ltsmin1518136348919240465;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin1518136348919240465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5620862687587292566.hoa' '--buchi-type=spotba'
LTSmin run took 114 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-03-LTLFireability-06 finished in 4505 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.
[2023-03-07 19:53:02] [INFO ] Invariant cache hit.
[2023-03-07 19:53:02] [INFO ] Implicit Places using invariants in 43 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 72 ms returned []
Implicit Place search using SMT with State Equation took 117 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 67 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 245 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 1 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-07 finished in 457 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 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 48 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 84 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-07 19:53:02] [INFO ] Redundant transitions in 1 ms returned []
[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 76 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 85 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 5072 reset in 286 ms.
Stack based approach found an accepted trace after 585 steps with 30 reset with depth 22 and stack size 22 in 3 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-08 finished in 622 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 0 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 36 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 63 ms returned []
Implicit Place search using SMT with State Equation took 101 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 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 351 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 33079 reset in 270 ms.
Product exploration explored 100000 steps with 33152 reset in 297 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 731 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 325 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 116 steps, including 5 resets, run visited all 10 properties in 17 ms. (steps per millisecond=6 )
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 1061 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 399 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 351 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:07] [INFO ] Invariant cache hit.
[2023-03-07 19:53:07] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-07 19:53:07] [INFO ] Invariant cache hit.
[2023-03-07 19:53:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:07] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-07 19:53:07] [INFO ] Invariant cache hit.
[2023-03-07 19:53:07] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 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 824 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 356 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 29 steps, including 0 resets, run visited all 10 properties in 5 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 1152 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)]
Stuttering acceptance computed with spot in 327 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 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)]
Product exploration explored 100000 steps with 33245 reset in 313 ms.
Product exploration explored 100000 steps with 33298 reset in 309 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 225 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 6 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:53:11] [INFO ] Invariant cache hit.
[2023-03-07 19:53:11] [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 62 ms. Remains : 38/38 places, 45/45 transitions.
Built C files in :
/tmp/ltsmin7771034410290655006
[2023-03-07 19:53:11] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7771034410290655006
Running compilation step : cd /tmp/ltsmin7771034410290655006;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 257 ms.
Running link step : cd /tmp/ltsmin7771034410290655006;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7771034410290655006;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10855906072329482438.hoa' '--buchi-type=spotba'
LTSmin run took 803 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-03-LTLFireability-09 finished in 9831 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:13] [INFO ] Invariant cache hit.
[2023-03-07 19:53:13] [INFO ] Implicit Places using invariants in 36 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 52 ms returned []
Implicit Place search using SMT with State Equation took 91 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 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 137 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 17725 reset in 184 ms.
Product exploration explored 100000 steps with 17776 reset in 284 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 135 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 212 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 31 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=15 )
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 387 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 237 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-07 19:53:15] [INFO ] Invariant cache hit.
[2023-03-07 19:53:15] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-07 19:53:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:15] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-07 19:53:15] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:15] [INFO ] [Real]Added 9 Read/Feed constraints in 7 ms returned sat
[2023-03-07 19:53:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-07 19:53:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:16] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-07 19:53:16] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-07 19:53:16] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-07 19:53:16] [INFO ] Added : 4 causal constraints over 1 iterations in 26 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:16] [INFO ] Invariant cache hit.
[2023-03-07 19:53:16] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-07 19:53:16] [INFO ] Invariant cache hit.
[2023-03-07 19:53:16] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:16] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-07 19:53:16] [INFO ] Invariant cache hit.
[2023-03-07 19:53:16] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 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 132 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 198 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 (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 184 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 201 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-07 19:53:17] [INFO ] Invariant cache hit.
[2023-03-07 19:53:17] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-07 19:53:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:17] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-07 19:53:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:17] [INFO ] [Real]Added 9 Read/Feed constraints in 7 ms returned sat
[2023-03-07 19:53:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-07 19:53:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:17] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-07 19:53:17] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2023-03-07 19:53:17] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-07 19:53:17] [INFO ] Added : 4 causal constraints over 1 iterations in 28 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 17709 reset in 278 ms.
Product exploration explored 100000 steps with 17655 reset in 298 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 216 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 6 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:18] [INFO ] Redundant transitions in 1 ms returned []
[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 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 38/38 places, 45/45 transitions.
Built C files in :
/tmp/ltsmin7417987410985593569
[2023-03-07 19:53:18] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7417987410985593569
Running compilation step : cd /tmp/ltsmin7417987410985593569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 246 ms.
Running link step : cd /tmp/ltsmin7417987410985593569;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7417987410985593569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13313590822812807242.hoa' '--buchi-type=spotba'
LTSmin run took 429 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-03-LTLFireability-10 finished in 6621 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:19] [INFO ] Invariant cache hit.
[2023-03-07 19:53:19] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-07 19:53:19] [INFO ] Invariant cache hit.
[2023-03-07 19:53:19] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:19] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-07 19:53:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:19] [INFO ] Invariant cache hit.
[2023-03-07 19:53:19] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 170 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 26669 reset in 567 ms.
Product exploration explored 100000 steps with 26794 reset in 465 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 664 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 160 ms :[(OR (NOT p1) p2), (NOT p1), (AND p1 p2)]
Finished random walk after 10 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=5 )
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 852 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 160 ms :[(OR (NOT p1) p2), (NOT p1), (AND p1 p2)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) p2), (NOT p1), (AND p1 p2)]
[2023-03-07 19:53:23] [INFO ] Invariant cache hit.
[2023-03-07 19:53:23] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-07 19:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:23] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-07 19:53:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-07 19:53:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:23] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-07 19:53:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:23] [INFO ] [Nat]Added 9 Read/Feed constraints in 5 ms returned sat
[2023-03-07 19:53:23] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-07 19:53:23] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-07 19:53:23] [INFO ] Invariant cache hit.
[2023-03-07 19:53:23] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-07 19:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:23] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-07 19:53:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-07 19:53:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:23] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-07 19:53:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:23] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-07 19:53:23] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-07 19:53:23] [INFO ] Added : 4 causal constraints over 1 iterations in 25 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:23] [INFO ] Invariant cache hit.
[2023-03-07 19:53:23] [INFO ] Implicit Places using invariants in 48 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 71 ms returned []
Implicit Place search using SMT with State Equation took 122 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 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 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 408 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 161 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) 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 497 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 162 ms :[(OR (NOT p1) p2), (NOT p1), (AND p1 p2)]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) p2), (NOT p1), (AND p1 p2)]
[2023-03-07 19:53:25] [INFO ] Invariant cache hit.
[2023-03-07 19:53:25] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-07 19:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:25] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-07 19:53:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-07 19:53:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:25] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-07 19:53:25] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:25] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-07 19:53:25] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-07 19:53:25] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-07 19:53:25] [INFO ] Invariant cache hit.
[2023-03-07 19:53:25] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-07 19:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:25] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-07 19:53:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:53:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-07 19:53:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:53:25] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-07 19:53:25] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:25] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-07 19:53:25] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-07 19:53:25] [INFO ] Added : 4 causal constraints over 1 iterations in 25 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) p2), (NOT p1), (AND p1 p2)]
Product exploration explored 100000 steps with 26879 reset in 329 ms.
Product exploration explored 100000 steps with 26774 reset in 356 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 166 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 3 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:53:27] [INFO ] Invariant cache hit.
[2023-03-07 19:53:27] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 38/38 places, 45/45 transitions.
Built C files in :
/tmp/ltsmin10416940012263032203
[2023-03-07 19:53:27] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10416940012263032203
Running compilation step : cd /tmp/ltsmin10416940012263032203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 239 ms.
Running link step : cd /tmp/ltsmin10416940012263032203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10416940012263032203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15556220095356780203.hoa' '--buchi-type=spotba'
LTSmin run took 182 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-03-LTLFireability-11 finished in 7986 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 3 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:27] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-07 19:53:27] [INFO ] Invariant cache hit.
[2023-03-07 19:53:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:27] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-07 19:53:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:27] [INFO ] Invariant cache hit.
[2023-03-07 19:53:27] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 216 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 225 steps with 25 reset in 1 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-12 finished in 438 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 0 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:28] [INFO ] Invariant cache hit.
[2023-03-07 19:53:28] [INFO ] Implicit Places using invariants in 42 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 71 ms returned []
Implicit Place search using SMT with State Equation took 115 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 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 426 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 25712 reset in 418 ms.
Product exploration explored 100000 steps with 25733 reset in 399 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 389 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 240 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 3 ms. (steps per millisecond=5 )
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 433 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 323 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 369 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:31] [INFO ] Invariant cache hit.
[2023-03-07 19:53:31] [INFO ] Implicit Places using invariants in 48 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 72 ms returned []
Implicit Place search using SMT with State Equation took 123 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 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 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 158 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 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 29 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=9 )
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 309 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 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 377 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 375 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 25728 reset in 500 ms.
Product exploration explored 100000 steps with 25722 reset in 371 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 316 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:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:34] [INFO ] Invariant cache hit.
[2023-03-07 19:53:34] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 38/38 places, 45/45 transitions.
Built C files in :
/tmp/ltsmin16849124134508850015
[2023-03-07 19:53:34] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16849124134508850015
Running compilation step : cd /tmp/ltsmin16849124134508850015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 259 ms.
Running link step : cd /tmp/ltsmin16849124134508850015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16849124134508850015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10761877168711018369.hoa' '--buchi-type=spotba'
LTSmin run took 592 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-03-LTLFireability-13 finished in 7787 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:35] [INFO ] Invariant cache hit.
[2023-03-07 19:53:35] [INFO ] Implicit Places using invariants in 44 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 74 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-07 19:53:35] [INFO ] Invariant cache hit.
[2023-03-07 19:53:36] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 148 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 8769 reset in 416 ms.
Product exploration explored 100000 steps with 8714 reset in 410 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 385 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 150 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Finished random walk after 569 steps, including 22 resets, run visited all 4 properties in 4 ms. (steps per millisecond=142 )
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 551 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 150 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 154 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:38] [INFO ] Invariant cache hit.
[2023-03-07 19:53:38] [INFO ] Implicit Places using invariants in 41 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 75 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[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 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 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 486 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 152 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Finished random walk after 164 steps, including 6 resets, run visited all 4 properties in 2 ms. (steps per millisecond=82 )
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 762 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 154 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), false, (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 14845 reset in 359 ms.
Product exploration explored 100000 steps with 14864 reset in 480 ms.
Built C files in :
/tmp/ltsmin4098635177197004627
[2023-03-07 19:53:41] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2023-03-07 19:53:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-07 19:53:41] [INFO ] Computing symmetric may enable matrix : 45 transitions.
[2023-03-07 19:53:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-07 19:53:41] [INFO ] Computing Do-Not-Accords matrix : 45 transitions.
[2023-03-07 19:53:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-07 19:53:41] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4098635177197004627
Running compilation step : cd /tmp/ltsmin4098635177197004627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 162 ms.
Running link step : cd /tmp/ltsmin4098635177197004627;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4098635177197004627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8578838908418061051.hoa' '--buchi-type=spotba'
LTSmin run took 129 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-03-LTLFireability-14 finished in 5902 ms.
All properties solved by simple procedures.
Total runtime 48708 ms.

BK_STOP 1678218823061

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CSRepetitions-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 r069-smll-167814395800012"
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 ;