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.r517-tall-167987243800396.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 PGCD-COL-D02N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243800396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 5.8K Mar 23 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 7 12:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 7 12:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 7 12:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 12:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.5K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 23 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 11K Mar 31 16:48 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 PGCD-COL-D02N100-LTLFireability-00
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-01
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-02
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-03
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-04
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-05
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-06
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-07
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-08
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-09
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-10
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-11
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-12
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-13
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-14
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680939551333

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=PGCD-COL-D02N100
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2023-04-08 07:39:13] [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-04-08 07:39:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:39:13] [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-04-08 07:39:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-08 07:39:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 481 ms
[2023-04-08 07:39:13] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 9 PT places and 9.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-04-08 07:39:14] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 6 ms.
[2023-04-08 07:39:14] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 1 properties that can be checked using skeleton over-approximation.
FORMULA PGCD-COL-D02N100-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2023-04-08 07:39:14] [INFO ] Flatten gal took : 14 ms
[2023-04-08 07:39:14] [INFO ] Flatten gal took : 1 ms
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2023-04-08 07:39:14] [INFO ] Unfolded HLPN to a Petri net with 9 places and 9 transitions 42 arcs in 14 ms.
[2023-04-08 07:39:14] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PGCD-COL-D02N100-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N100-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N100-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 10 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-08 07:39:14] [INFO ] Computed 4 invariants in 5 ms
[2023-04-08 07:39:14] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
[2023-04-08 07:39:14] [INFO ] Invariant cache hit.
[2023-04-08 07:39:14] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:39:14] [INFO ] Invariant cache hit.
[2023-04-08 07:39:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:14] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-08 07:39:14] [INFO ] Invariant cache hit.
[2023-04-08 07:39:14] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 282 ms. Remains : 9/9 places, 9/9 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-04-08 07:39:14] [INFO ] Flatten gal took : 4 ms
[2023-04-08 07:39:14] [INFO ] Flatten gal took : 4 ms
[2023-04-08 07:39:14] [INFO ] Input system was already deterministic with 9 transitions.
Finished random walk after 927 steps, including 0 resets, run visited all 8 properties in 113 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!(F(G(p0)))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 4 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:39:15] [INFO ] Invariant cache hit.
[2023-04-08 07:39:15] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-04-08 07:39:15] [INFO ] Invariant cache hit.
[2023-04-08 07:39:15] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:39:15] [INFO ] Invariant cache hit.
[2023-04-08 07:39:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:15] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-08 07:39:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:39:15] [INFO ] Invariant cache hit.
[2023-04-08 07:39:15] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 9/9 places, 9/9 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 159 ms :[(NOT p0)]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s5 1) (LT s8 1)) (OR (LT s0 1) (LT s3 1) (LT s6 1)) (OR (LT s1 1) (LT s4 1) (LT s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 260 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 1 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-02 finished in 639 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)||G(p1))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:39:15] [INFO ] Invariant cache hit.
[2023-04-08 07:39:15] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:39:15] [INFO ] Invariant cache hit.
[2023-04-08 07:39:15] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-08 07:39:15] [INFO ] Invariant cache hit.
[2023-04-08 07:39:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:15] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-08 07:39:15] [INFO ] Invariant cache hit.
[2023-04-08 07:39:15] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (GEQ s2 1) (GEQ s5 1))), p0:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 167 ms.
Product exploration explored 100000 steps with 0 reset in 264 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 248 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10014 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=527 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:39:16] [INFO ] Invariant cache hit.
[2023-04-08 07:39:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:39:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:39:16] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:39:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:39:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:39:16] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 10 factoid took 355 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PGCD-COL-D02N100-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PGCD-COL-D02N100-LTLFireability-03 finished in 1663 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))||G((p1||G(p2)))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 4 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:39:17] [INFO ] Invariant cache hit.
[2023-04-08 07:39:17] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 07:39:17] [INFO ] Invariant cache hit.
[2023-04-08 07:39:17] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:39:17] [INFO ] Invariant cache hit.
[2023-04-08 07:39:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:17] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-08 07:39:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:39:17] [INFO ] Invariant cache hit.
[2023-04-08 07:39:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR (LT s2 3) (LT s8 1))), p0:(AND (OR (LT s2 1) (LT s5 1) (LT s8 1)) (OR (LT s0 1) (LT s3 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 199 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 292 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10074 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=629 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-08 07:39:18] [INFO ] Invariant cache hit.
[2023-04-08 07:39:18] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (AND p2 (NOT p1))), (F (NOT p2)), (F (NOT p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 16 factoid took 548 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:39:19] [INFO ] Invariant cache hit.
[2023-04-08 07:39:19] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-04-08 07:39:19] [INFO ] Invariant cache hit.
[2023-04-08 07:39:19] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-08 07:39:19] [INFO ] Invariant cache hit.
[2023-04-08 07:39:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:19] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-04-08 07:39:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:39:19] [INFO ] Invariant cache hit.
[2023-04-08 07:39:19] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 9/9 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 317 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10048 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=669 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-08 07:39:20] [INFO ] Invariant cache hit.
[2023-04-08 07:39:20] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (AND p2 (NOT p1))), (F (NOT p2)), (F (NOT p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 16 factoid took 543 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 130 ms.
Product exploration explored 100000 steps with 0 reset in 185 ms.
Built C files in :
/tmp/ltsmin14219417282558952956
[2023-04-08 07:39:21] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2023-04-08 07:39:21] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:39:21] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2023-04-08 07:39:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:39:21] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2023-04-08 07:39:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:39:21] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14219417282558952956
Running compilation step : cd /tmp/ltsmin14219417282558952956;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 192 ms.
Running link step : cd /tmp/ltsmin14219417282558952956;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14219417282558952956;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11386025756269424213.hoa' '--buchi-type=spotba'
LTSmin run took 534 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PGCD-COL-D02N100-LTLFireability-04 finished in 4975 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) U (X(X(F(!p2)))||p1)))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:39:22] [INFO ] Invariant cache hit.
[2023-04-08 07:39:22] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-04-08 07:39:22] [INFO ] Invariant cache hit.
[2023-04-08 07:39:22] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-08 07:39:22] [INFO ] Invariant cache hit.
[2023-04-08 07:39:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:22] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-04-08 07:39:22] [INFO ] Invariant cache hit.
[2023-04-08 07:39:22] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND p0 p2)), (OR (AND (NOT p1) p2) (AND p0 p2)), p2]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s0 3) (GEQ s6 1)) (AND (GEQ s1 3) (GEQ s7 1)) (AND (GEQ s2 3) (GEQ s8 1))), p0:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 136 ms.
Product exploration explored 100000 steps with 33333 reset in 147 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PGCD-COL-D02N100-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PGCD-COL-D02N100-LTLFireability-06 finished in 574 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(X(F(!p0))))'
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:39:22] [INFO ] Invariant cache hit.
[2023-04-08 07:39:22] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-04-08 07:39:22] [INFO ] Invariant cache hit.
[2023-04-08 07:39:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:39:22] [INFO ] Invariant cache hit.
[2023-04-08 07:39:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:22] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-04-08 07:39:22] [INFO ] Invariant cache hit.
[2023-04-08 07:39:22] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR (LT s2 3) (LT s8 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23385 reset in 88 ms.
Stack based approach found an accepted trace after 345 steps with 77 reset with depth 6 and stack size 6 in 1 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-07 finished in 337 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 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:39:23] [INFO ] Invariant cache hit.
[2023-04-08 07:39:23] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
[2023-04-08 07:39:23] [INFO ] Invariant cache hit.
[2023-04-08 07:39:23] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-08 07:39:23] [INFO ] Invariant cache hit.
[2023-04-08 07:39:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:23] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-04-08 07:39:23] [INFO ] Invariant cache hit.
[2023-04-08 07:39:23] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s5 1) (LT s8 1)) (OR (LT s0 1) (LT s3 1) (LT s6 1)) (OR (LT s1 1) (LT s4 1) (LT s7 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 0 reset in 98 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-08 finished in 428 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((F(G(p1))&&p0))&&(F(!p2) U ((p1&&F(!p2))||G(F(!p2))))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:39:23] [INFO ] Invariant cache hit.
[2023-04-08 07:39:23] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-04-08 07:39:23] [INFO ] Invariant cache hit.
[2023-04-08 07:39:23] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-08 07:39:23] [INFO ] Invariant cache hit.
[2023-04-08 07:39:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:23] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-04-08 07:39:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:39:23] [INFO ] Invariant cache hit.
[2023-04-08 07:39:23] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p1), (NOT p0), p2, p2]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s5 1) (LT s8 1)) (OR (LT s0 1) (LT s3 1) (LT s6 1)) (OR (LT s1 1) (LT s4 1) (LT s7 1))), p1:(AND (OR (LT s2 1) (LT s5 1) (LT s8 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 89 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-09 finished in 402 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))&&(G(F(!p1)) U (G(p0)||p2))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:39:23] [INFO ] Invariant cache hit.
[2023-04-08 07:39:24] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-04-08 07:39:24] [INFO ] Invariant cache hit.
[2023-04-08 07:39:24] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-08 07:39:24] [INFO ] Invariant cache hit.
[2023-04-08 07:39:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:24] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-04-08 07:39:24] [INFO ] Invariant cache hit.
[2023-04-08 07:39:24] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), p1, p1, (AND (NOT p0) (NOT p2)), true, (AND p1 (NOT p0))]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (AND (GEQ s2 1) (GEQ s5 1) (GEQ s8 1)) (AND (GEQ s0 1) (GEQ s3 1) (GEQ s6 1)) (AND (GEQ s1 1) (GEQ s4 1) (GEQ s7 1))), p0:(OR (AND (GEQ s0 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 42443 steps with 0 reset in 55 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-10 finished in 420 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 U !p1)) U !p1)&&(X((G(!p1) U (p0&&G(!p1))))||p2))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:39:24] [INFO ] Invariant cache hit.
[2023-04-08 07:39:24] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-04-08 07:39:24] [INFO ] Invariant cache hit.
[2023-04-08 07:39:24] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-08 07:39:24] [INFO ] Invariant cache hit.
[2023-04-08 07:39:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:24] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-04-08 07:39:24] [INFO ] Invariant cache hit.
[2023-04-08 07:39:24] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 394 ms :[(OR p1 (AND (NOT p0) (NOT p2))), (OR p1 (AND (NOT p0) (NOT p2))), true, p1, p1, p1, (OR (NOT p0) p1), p1]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(OR (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 2}, { cond=(NOT p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR (LT s2 3) (LT s8 1))), p0:(OR (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 137 ms.
Product exploration explored 100000 steps with 10 reset in 141 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (AND p1 p0 p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 271 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 244 ms :[p1, true, p1, p1, p1, false, false]
Incomplete random walk after 10062 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=774 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-08 07:39:25] [INFO ] Invariant cache hit.
[2023-04-08 07:39:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:39:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:39:25] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-08 07:39:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 21 ms returned sat
[2023-04-08 07:39:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:39:25] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (AND p1 p0 p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 341 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 125 ms :[p1, p1, p1]
[2023-04-08 07:39:26] [INFO ] Invariant cache hit.
[2023-04-08 07:39:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:39:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:39:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:39:26] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:39:26] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:39:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:39:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:39:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:39:26] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:39:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:39:26] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:39:26] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG p1
Support contains 6 out of 9 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 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:39:26] [INFO ] Invariant cache hit.
[2023-04-08 07:39:26] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 07:39:26] [INFO ] Invariant cache hit.
[2023-04-08 07:39:26] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-08 07:39:26] [INFO ] Invariant cache hit.
[2023-04-08 07:39:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:26] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-04-08 07:39:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:39:26] [INFO ] Invariant cache hit.
[2023-04-08 07:39:26] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 9/9 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), true]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[p1, p1, p1]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), true]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 106 ms :[p1, p1, p1]
[2023-04-08 07:39:27] [INFO ] Invariant cache hit.
[2023-04-08 07:39:27] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:39:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:39:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:39:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:39:27] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:39:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-04-08 07:39:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:39:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:39:27] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:39:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:39:27] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:39:27] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 107 ms :[p1, p1, p1]
Product exploration explored 100000 steps with 2 reset in 93 ms.
Product exploration explored 100000 steps with 0 reset in 110 ms.
Built C files in :
/tmp/ltsmin12482522813219285073
[2023-04-08 07:39:27] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2023-04-08 07:39:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:39:27] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2023-04-08 07:39:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:39:27] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2023-04-08 07:39:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:39:27] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12482522813219285073
Running compilation step : cd /tmp/ltsmin12482522813219285073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin12482522813219285073;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12482522813219285073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15331074846476890498.hoa' '--buchi-type=spotba'
LTSmin run took 60 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PGCD-COL-D02N100-LTLFireability-11 finished in 3466 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(p1))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:39:27] [INFO ] Invariant cache hit.
[2023-04-08 07:39:27] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:39:27] [INFO ] Invariant cache hit.
[2023-04-08 07:39:27] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:39:27] [INFO ] Invariant cache hit.
[2023-04-08 07:39:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:27] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-08 07:39:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:39:27] [INFO ] Invariant cache hit.
[2023-04-08 07:39:27] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-12 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (GEQ s2 1) (GEQ s5 1))), p1:(OR (AND (GEQ s2 1) (GEQ s5 1) (GEQ s8 1)) (AND (GEQ s0 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 0 reset in 122 ms.
Product exploration explored 100000 steps with 0 reset in 133 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 204 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=204 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:39:28] [INFO ] Invariant cache hit.
[2023-04-08 07:39:28] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2023-04-08 07:39:28] [INFO ] Invariant cache hit.
[2023-04-08 07:39:28] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-08 07:39:28] [INFO ] Invariant cache hit.
[2023-04-08 07:39:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:28] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-04-08 07:39:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:39:28] [INFO ] Invariant cache hit.
[2023-04-08 07:39:28] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 9/9 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 517 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=517 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 126 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 113 ms.
Product exploration explored 100000 steps with 0 reset in 123 ms.
Built C files in :
/tmp/ltsmin10987207397306770652
[2023-04-08 07:39:29] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2023-04-08 07:39:29] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:39:29] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2023-04-08 07:39:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:39:29] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2023-04-08 07:39:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:39:29] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10987207397306770652
Running compilation step : cd /tmp/ltsmin10987207397306770652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 85 ms.
Running link step : cd /tmp/ltsmin10987207397306770652;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10987207397306770652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15184800699545087861.hoa' '--buchi-type=spotba'
LTSmin run took 1085 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PGCD-COL-D02N100-LTLFireability-12 finished in 3285 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)||X((p1&&F(!p0)))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:39:31] [INFO ] Invariant cache hit.
[2023-04-08 07:39:31] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2023-04-08 07:39:31] [INFO ] Invariant cache hit.
[2023-04-08 07:39:31] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:39:31] [INFO ] Invariant cache hit.
[2023-04-08 07:39:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:39:31] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-08 07:39:31] [INFO ] Invariant cache hit.
[2023-04-08 07:39:31] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, p0, (OR (NOT p1) p0), p0, p0, p0]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR (LT s2 3) (LT s8 1))), p1:(OR (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23347 reset in 96 ms.
Stack based approach found an accepted trace after 393 steps with 91 reset with depth 5 and stack size 5 in 1 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-13 finished in 371 ms.
All properties solved by simple procedures.
Total runtime 18196 ms.

BK_STOP 1680939572577

--------------------
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.202304061127.jar
+ 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="PGCD-COL-D02N100"
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 PGCD-COL-D02N100, 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 r517-tall-167987243800396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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