Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521500118.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r087-tall-171620521500118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.8K Apr 12 09:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 09:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 09:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 09:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 09:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 09:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 09:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 09:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14K May 18 16:42 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 1716243194906

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=gold2023
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 202304061127
[2024-05-20 22:13:16] [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]
[2024-05-20 22:13:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:13:16] [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.
[2024-05-20 22:13:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-20 22:13:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 595 ms
[2024-05-20 22:13:17] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 58 PT places and 81.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-20 22:13:17] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 4 ms.
[2024-05-20 22:13:17] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
Finished random walk after 91 steps, including 4 resets, run visited all 6 properties in 9 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-20 22:13:17] [INFO ] Flatten gal took : 13 ms
[2024-05-20 22:13:17] [INFO ] Flatten gal took : 2 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
[2024-05-20 22:13:17] [INFO ] Unfolded HLPN to a Petri net with 38 places and 45 transitions 135 arcs in 6 ms.
[2024-05-20 22:13:17] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Support contains 38 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 6 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2024-05-20 22:13:17] [INFO ] Computed 10 invariants in 4 ms
[2024-05-20 22:13:17] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-20 22:13:17] [INFO ] Invariant cache hit.
[2024-05-20 22:13:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:17] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-20 22:13:17] [INFO ] Invariant cache hit.
[2024-05-20 22:13:17] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 236 ms. Remains : 38/38 places, 45/45 transitions.
Support contains 38 out of 38 places after structural reductions.
[2024-05-20 22:13:17] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:13:17] [INFO ] Flatten gal took : 9 ms
[2024-05-20 22:13:17] [INFO ] Input system was already deterministic with 45 transitions.
Finished random walk after 67 steps, including 3 resets, run visited all 12 properties in 5 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 27 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 10 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-20 22:13:18] [INFO ] Invariant cache hit.
[2024-05-20 22:13:18] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-20 22:13:18] [INFO ] Invariant cache hit.
[2024-05-20 22:13:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:18] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-20 22:13:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 22:13:18] [INFO ] Invariant cache hit.
[2024-05-20 22:13:18] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 38/38 places, 45/45 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s30 1)) (AND (GEQ s3 1) (GEQ s31 1)) (AND (GEQ s6 1) (GEQ s34 1)) (AND (GEQ s7 1) (GEQ s35 1)) (AND (GEQ s4 1) (GEQ s32 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 3 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-00 finished in 554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!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 4 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-20 22:13:18] [INFO ] Invariant cache hit.
[2024-05-20 22:13:18] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-20 22:13:18] [INFO ] Invariant cache hit.
[2024-05-20 22:13:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:18] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-20 22:13:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 22:13:18] [INFO ] Invariant cache hit.
[2024-05-20 22:13:18] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s12 1) (LT s19 1)) (OR (LT s17 1) (LT s19 1)) (OR (LT s16 1) (LT s19 1)) (OR (LT s18 1) (LT s19 1)) (OR (LT s15 1) (LT s19 1)) (OR (LT s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6836 reset in 319 ms.
Stack based approach found an accepted trace after 1282 steps with 84 reset with depth 15 and stack size 15 in 4 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-01 finished in 582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p1)||p0)&&(G(p2)||X(F(!p3))))))'
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.
[2024-05-20 22:13:19] [INFO ] Invariant cache hit.
[2024-05-20 22:13:19] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-20 22:13:19] [INFO ] Invariant cache hit.
[2024-05-20 22:13:19] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:19] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-20 22:13:19] [INFO ] Invariant cache hit.
[2024-05-20 22:13:19] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) p3)), (NOT p1), p3, (AND p3 (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p3, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 3}, { cond=(AND p2 p3), acceptance={} source=4 dest: 4}]], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11021 steps with 2398 reset in 21 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-02 finished in 401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!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 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-20 22:13:19] [INFO ] Invariant cache hit.
[2024-05-20 22:13:19] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-20 22:13:19] [INFO ] Invariant cache hit.
[2024-05-20 22:13:19] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:19] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-20 22:13:19] [INFO ] Invariant cache hit.
[2024-05-20 22:13:19] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, p0, p0]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s12 1) (LT s19 1)) (OR (LT s17 1) (LT s19 1)) (OR (LT s16 1) (LT s19 1)) (OR (LT s18 1) (LT s19 1)) (OR (LT s15 1) (LT s19 1)) (OR (LT s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-03 finished in 259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 9 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.
[2024-05-20 22:13:19] [INFO ] Invariant cache hit.
[2024-05-20 22:13:20] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-20 22:13:20] [INFO ] Invariant cache hit.
[2024-05-20 22:13:20] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:20] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-20 22:13:20] [INFO ] Invariant cache hit.
[2024-05-20 22:13:20] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], 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))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 18318 reset in 127 ms.
Product exploration explored 100000 steps with 18332 reset in 142 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 p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 134 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-20 22:13:20] [INFO ] Invariant cache hit.
[2024-05-20 22:13:20] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-20 22:13:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 22:13:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-20 22:13:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:13:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-20 22:13:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 22:13:20] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-20 22:13:20] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:20] [INFO ] [Nat]Added 9 Read/Feed constraints in 17 ms returned sat
[2024-05-20 22:13:20] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-20 22:13:20] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 20 transition count 36
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 35 place count 12 transition count 28
Iterating global reduction 0 with 8 rules applied. Total rules applied 43 place count 12 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 10 transition count 27
Applied a total of 46 rules in 7 ms. Remains 10 /38 variables (removed 28) and now considering 27/45 (removed 18) transitions.
// Phase 1: matrix 27 rows 10 cols
[2024-05-20 22:13:20] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 22:13:20] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-20 22:13:20] [INFO ] Invariant cache hit.
[2024-05-20 22:13:20] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-20 22:13:21] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 22:13:21] [INFO ] Invariant cache hit.
[2024-05-20 22:13:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/38 places, 27/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 10/38 places, 27/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 p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 12 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-03-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-03-LTLFireability-04 finished in 1095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(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.
// Phase 1: matrix 45 rows 38 cols
[2024-05-20 22:13:21] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 22:13:21] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-20 22:13:21] [INFO ] Invariant cache hit.
[2024-05-20 22:13:21] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:21] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-20 22:13:21] [INFO ] Invariant cache hit.
[2024-05-20 22:13:21] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s30 1)) (AND (GEQ s3 1) (GEQ s31 1)) (AND (GEQ s6 1) (GEQ s34 1)) (AND (GEQ s7 1) (GEQ s35 1)) (AND (GEQ s4 1) (GEQ s32 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-05 finished in 236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p1)||p0) U (!p1&&X(F(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.
[2024-05-20 22:13:21] [INFO ] Invariant cache hit.
[2024-05-20 22:13:21] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-20 22:13:21] [INFO ] Invariant cache hit.
[2024-05-20 22:13:21] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:21] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-20 22:13:21] [INFO ] Invariant cache hit.
[2024-05-20 22:13:21] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p2) p1), true, (NOT p2)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], 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)), p0:(OR (AND (GEQ s12 1) (GEQ s19 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 50000 reset in 166 ms.
Product exploration explored 100000 steps with 50000 reset in 146 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) (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p2), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-03-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-03-LTLFireability-06 finished in 551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 8 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-20 22:13:21] [INFO ] Invariant cache hit.
[2024-05-20 22:13:21] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-20 22:13:21] [INFO ] Invariant cache hit.
[2024-05-20 22:13:21] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:21] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-20 22:13:21] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 22:13:21] [INFO ] Invariant cache hit.
[2024-05-20 22:13:21] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 32 ms :[p0]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3675 reset in 262 ms.
Stack based approach found an accepted trace after 1426 steps with 52 reset with depth 15 and stack size 15 in 4 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-07 finished in 433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 18 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-20 22:13:22] [INFO ] Invariant cache hit.
[2024-05-20 22:13:22] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-20 22:13:22] [INFO ] Invariant cache hit.
[2024-05-20 22:13:22] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:22] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-20 22:13:22] [INFO ] Invariant cache hit.
[2024-05-20 22:13:22] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-08 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:(OR (AND (GEQ s2 1) (GEQ s30 1)) (AND (GEQ s3 1) (GEQ s31 1)) (AND (GEQ s6 1) (GEQ s34 1)) (AND (GEQ s7 1) (GEQ s35 1)) (AND (GEQ s4 1) (GEQ s32 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-08 finished in 183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(F(G(p2))&&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 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-20 22:13:22] [INFO ] Invariant cache hit.
[2024-05-20 22:13:22] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-20 22:13:22] [INFO ] Invariant cache hit.
[2024-05-20 22:13:22] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:22] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-20 22:13:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 22:13:22] [INFO ] Invariant cache hit.
[2024-05-20 22:13:22] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p2) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (LT s20 1) (LT s21 1) (LT s22 1) (LT s23 1) (LT s24 1) (LT s25 1) (LT s26 1) (LT s27 1) (LT s28 1)), p1:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT ...], nbAcceptance=2, 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 3731 reset in 237 ms.
Stack based approach found an accepted trace after 36 steps with 1 reset with depth 17 and stack size 17 in 0 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-10 finished in 489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0||(p0 U X(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 0 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-20 22:13:22] [INFO ] Invariant cache hit.
[2024-05-20 22:13:22] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-20 22:13:22] [INFO ] Invariant cache hit.
[2024-05-20 22:13:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:23] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-20 22:13:23] [INFO ] Invariant cache hit.
[2024-05-20 22:13:23] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 97 ms :[false, false, false]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s30 1)) (AND (GEQ s3 1) (GEQ s31 1)) (AND (GEQ s6 1) (GEQ s34 1)) (AND (GEQ s7 1) (GEQ s35 1)) (AND (GEQ s4 1) (GEQ s32 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3678 reset in 222 ms.
Stack based approach found an accepted trace after 9871 steps with 362 reset with depth 8 and stack size 8 in 23 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-11 finished in 469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&F((G(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.
[2024-05-20 22:13:23] [INFO ] Invariant cache hit.
[2024-05-20 22:13:23] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-20 22:13:23] [INFO ] Invariant cache hit.
[2024-05-20 22:13:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:23] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-20 22:13:23] [INFO ] Invariant cache hit.
[2024-05-20 22:13:23] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), true, (OR (NOT p2) (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: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s20 1) (LT s21 1) (LT s22 1) (LT s23 1) (LT s24 1) (LT s25 1) (LT s26 1) (LT s27 1) (LT s28 1)), p1:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-12 finished in 305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X((G(!p2)||X(!p0)||p1)))))'
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-20 22:13:23] [INFO ] Invariant cache hit.
[2024-05-20 22:13:23] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-20 22:13:23] [INFO ] Invariant cache hit.
[2024-05-20 22:13:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:23] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-20 22:13:23] [INFO ] Invariant cache hit.
[2024-05-20 22:13:23] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND p0 (NOT p1) p2), p0, (AND p2 p0), true, p2]
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 p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={} source=7 dest: 7}]], 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 (GEQ s16 1) (GEQ s17 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 80 steps with 17 reset in 0 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-13 finished in 393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0)||G(p0)) U (p1&&X(F(!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 0 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-20 22:13:24] [INFO ] Invariant cache hit.
[2024-05-20 22:13:24] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-20 22:13:24] [INFO ] Invariant cache hit.
[2024-05-20 22:13:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:24] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-20 22:13:24] [INFO ] Invariant cache hit.
[2024-05-20 22:13:24] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) p2), p0, (NOT p0), p2, true]
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=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=p1, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], 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)), p0:(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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-14 finished in 294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!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 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-20 22:13:24] [INFO ] Invariant cache hit.
[2024-05-20 22:13:24] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-20 22:13:24] [INFO ] Invariant cache hit.
[2024-05-20 22:13:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:13:24] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-20 22:13:24] [INFO ] Invariant cache hit.
[2024-05-20 22:13:24] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, p0, p0]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s12 1) (LT s19 1)) (OR (LT s17 1) (LT s19 1)) (OR (LT s16 1) (LT s19 1)) (OR (LT s18 1) (LT s19 1)) (OR (LT s15 1) (LT s19 1)) (OR (LT s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-15 finished in 203 ms.
All properties solved by simple procedures.
Total runtime 8229 ms.

BK_STOP 1716243205450

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r087-tall-171620521500118"
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 ;