fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r285-smll-171654422000128
Last Updated
July 7, 2024

About the Execution of 2023-gold for Peterson-COL-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
401.640 21027.00 37476.00 701.50 FFFTTFFFFTFFFFFT normal

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.r285-smll-171654422000128.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 Peterson-COL-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422000128
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.1K Apr 12 02:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 12 02:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 02:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 02:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 02:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 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 Peterson-COL-2-LTLFireability-00
FORMULA_NAME Peterson-COL-2-LTLFireability-01
FORMULA_NAME Peterson-COL-2-LTLFireability-02
FORMULA_NAME Peterson-COL-2-LTLFireability-03
FORMULA_NAME Peterson-COL-2-LTLFireability-04
FORMULA_NAME Peterson-COL-2-LTLFireability-05
FORMULA_NAME Peterson-COL-2-LTLFireability-06
FORMULA_NAME Peterson-COL-2-LTLFireability-07
FORMULA_NAME Peterson-COL-2-LTLFireability-08
FORMULA_NAME Peterson-COL-2-LTLFireability-09
FORMULA_NAME Peterson-COL-2-LTLFireability-10
FORMULA_NAME Peterson-COL-2-LTLFireability-11
FORMULA_NAME Peterson-COL-2-LTLFireability-12
FORMULA_NAME Peterson-COL-2-LTLFireability-13
FORMULA_NAME Peterson-COL-2-LTLFireability-14
FORMULA_NAME Peterson-COL-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716879265210

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=Peterson-COL-2
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-28 06:54:27] [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-28 06:54:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:54:27] [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-28 06:54:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 06:54:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 746 ms
[2024-05-28 06:54:28] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 06:54:29] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2024-05-28 06:54:29] [INFO ] Skeletonized 15 HLPN properties in 3 ms. Removed 1 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-COL-2-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 1667 steps, including 0 resets, run visited all 10 properties in 54 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-28 06:54:29] [INFO ] Flatten gal took : 22 ms
[2024-05-28 06:54:29] [INFO ] Flatten gal took : 4 ms
Domain [Process(3), Tour(2), Process(3)] of place BeginLoop breaks symmetries in sort Process
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
Arc [2:1*[$i, (MOD (ADD $j 1) 2)]] contains successor/predecessor on variables of sort Tour
[2024-05-28 06:54:29] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 22 ms.
[2024-05-28 06:54:29] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
Support contains 78 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 11 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-28 06:54:29] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-28 06:54:29] [INFO ] Computed 11 invariants in 8 ms
[2024-05-28 06:54:29] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-28 06:54:29] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-28 06:54:29] [INFO ] Invariant cache hit.
[2024-05-28 06:54:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-28 06:54:30] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2024-05-28 06:54:30] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-28 06:54:30] [INFO ] Invariant cache hit.
[2024-05-28 06:54:30] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 880 ms. Remains : 102/102 places, 126/126 transitions.
Support contains 78 out of 102 places after structural reductions.
[2024-05-28 06:54:30] [INFO ] Flatten gal took : 57 ms
[2024-05-28 06:54:30] [INFO ] Flatten gal took : 24 ms
[2024-05-28 06:54:30] [INFO ] Input system was already deterministic with 126 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 06:54:31] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-28 06:54:31] [INFO ] Invariant cache hit.
[2024-05-28 06:54:31] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-28 06:54:31] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 06:54:31] [INFO ] After 93ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-28 06:54:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-28 06:54:31] [INFO ] After 20ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 06:54:31] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 06:54:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 56 ms returned sat
[2024-05-28 06:54:31] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 35 ms returned sat
[2024-05-28 06:54:32] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 06:54:32] [INFO ] After 125ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-28 06:54:32] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 6 ms to minimize.
[2024-05-28 06:54:32] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-28 06:54:32] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 13 ms to minimize.
[2024-05-28 06:54:32] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-28 06:54:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 403 ms
[2024-05-28 06:54:32] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-28 06:54:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2024-05-28 06:54:32] [INFO ] After 696ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-28 06:54:32] [INFO ] After 1287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 24 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 102 transition count 106
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 82 transition count 106
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 40 place count 82 transition count 89
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 74 place count 65 transition count 89
Applied a total of 74 rules in 35 ms. Remains 65 /102 variables (removed 37) and now considering 89/126 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 65/102 places, 89/126 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
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
Finished probabilistic random walk after 14966 steps, run visited all 2 properties in 86 ms. (steps per millisecond=174 )
Probabilistic random walk after 14966 steps, saw 3805 distinct states, run finished after 86 ms. (steps per millisecond=174 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
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' '!((G((p0 U p1))||F(G(p2))))'
Support contains 39 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 102 transition count 110
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 86 transition count 110
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 32 place count 86 transition count 96
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 60 place count 72 transition count 96
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 66 transition count 90
Applied a total of 72 rules in 15 ms. Remains 66 /102 variables (removed 36) and now considering 90/126 (removed 36) transitions.
[2024-05-28 06:54:33] [INFO ] Flow matrix only has 84 transitions (discarded 6 similar events)
// Phase 1: matrix 84 rows 66 cols
[2024-05-28 06:54:33] [INFO ] Computed 11 invariants in 3 ms
[2024-05-28 06:54:33] [INFO ] Implicit Places using invariants in 53 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/102 places, 90/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 63/102 places, 90/126 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 305 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-COL-2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s10 1) (GEQ s15 1)) (AND (GEQ s11 1) (GEQ s15 1)) (AND (GEQ s14 1) (GEQ s18 1)) (AND (GEQ s14 1) (GEQ s16 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 521 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 2 ms.
FORMULA Peterson-COL-2-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-2-LTLFireability-00 finished in 1067 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((p1&&F(G(p2))))))'
Support contains 21 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-28 06:54:34] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-28 06:54:34] [INFO ] Computed 11 invariants in 3 ms
[2024-05-28 06:54:34] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-28 06:54:34] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-28 06:54:34] [INFO ] Invariant cache hit.
[2024-05-28 06:54:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-28 06:54:35] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-05-28 06:54:35] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-28 06:54:35] [INFO ] Invariant cache hit.
[2024-05-28 06:54:35] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 102/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Peterson-COL-2-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s2 1) (GEQ s7 1))), p0:(OR (GEQ s48 1) (GEQ s50 1) (GEQ s46 1)), p2:(OR (AND (OR ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-2-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-LTLFireability-01 finished in 682 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 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 102 transition count 91
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 67 transition count 91
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 70 place count 67 transition count 75
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 102 place count 51 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 48 transition count 72
Applied a total of 108 rules in 11 ms. Remains 48 /102 variables (removed 54) and now considering 72/126 (removed 54) transitions.
[2024-05-28 06:54:35] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
// Phase 1: matrix 66 rows 48 cols
[2024-05-28 06:54:35] [INFO ] Computed 11 invariants in 2 ms
[2024-05-28 06:54:35] [INFO ] Implicit Places using invariants in 117 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 120 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/102 places, 72/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 134 ms. Remains : 45/102 places, 72/126 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-2-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 (LT s34 1) (LT s30 1) (LT s32 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 221 ms.
Stack based approach found an accepted trace after 73 steps with 0 reset with depth 74 and stack size 59 in 0 ms.
FORMULA Peterson-COL-2-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-2-LTLFireability-02 finished in 407 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)||F(p1)))'
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 70 transition count 94
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 64 place count 70 transition count 74
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 104 place count 50 transition count 74
Applied a total of 104 rules in 8 ms. Remains 50 /102 variables (removed 52) and now considering 74/126 (removed 52) transitions.
[2024-05-28 06:54:35] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
// Phase 1: matrix 68 rows 50 cols
[2024-05-28 06:54:35] [INFO ] Computed 11 invariants in 1 ms
[2024-05-28 06:54:35] [INFO ] Implicit Places using invariants in 69 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 70 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/102 places, 74/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82 ms. Remains : 47/102 places, 74/126 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-2-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(OR (AND (GEQ s10 1) (GEQ s17 1)) (AND (GEQ s14 1) (GEQ s20 1)) (AND (GEQ s13 1) (GEQ s18 1)) (AND (GEQ s12 1) (GEQ s16 1)) (AND (GEQ s9 1) (GEQ s15 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 25725 reset in 371 ms.
Product exploration explored 100000 steps with 25734 reset in 378 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) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 253 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 5 factoid took 310 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 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
[2024-05-28 06:54:37] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
// Phase 1: matrix 68 rows 47 cols
[2024-05-28 06:54:37] [INFO ] Computed 8 invariants in 1 ms
[2024-05-28 06:54:37] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-28 06:54:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 06:54:37] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-28 06:54:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:54:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-28 06:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 06:54:37] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-28 06:54:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-28 06:54:37] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2024-05-28 06:54:37] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 6 transitions) in 9 ms.
[2024-05-28 06:54:37] [INFO ] Added : 5 causal constraints over 2 iterations in 49 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 12 out of 47 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 : 47/47 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-28 06:54:37] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
[2024-05-28 06:54:37] [INFO ] Invariant cache hit.
[2024-05-28 06:54:37] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-28 06:54:37] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
[2024-05-28 06:54:37] [INFO ] Invariant cache hit.
[2024-05-28 06:54:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-28 06:54:37] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-28 06:54:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 06:54:37] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
[2024-05-28 06:54:37] [INFO ] Invariant cache hit.
[2024-05-28 06:54:38] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 47/47 places, 74/74 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 : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 118 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 34 ms :[(NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
[2024-05-28 06:54:38] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
[2024-05-28 06:54:38] [INFO ] Invariant cache hit.
[2024-05-28 06:54:38] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-28 06:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 06:54:38] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-28 06:54:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:54:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-28 06:54:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 06:54:38] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-28 06:54:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-28 06:54:38] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2024-05-28 06:54:39] [INFO ] Computed and/alt/rep : 59/142/59 causal constraints (skipped 6 transitions) in 6 ms.
[2024-05-28 06:54:39] [INFO ] Added : 22 causal constraints over 5 iterations in 65 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 187 ms :[(NOT p1)]
Product exploration explored 100000 steps with 25738 reset in 177 ms.
Product exploration explored 100000 steps with 25738 reset in 191 ms.
Built C files in :
/tmp/ltsmin7026488706289735463
[2024-05-28 06:54:39] [INFO ] Computing symmetric may disable matrix : 74 transitions.
[2024-05-28 06:54:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:54:39] [INFO ] Computing symmetric may enable matrix : 74 transitions.
[2024-05-28 06:54:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:54:39] [INFO ] Computing Do-Not-Accords matrix : 74 transitions.
[2024-05-28 06:54:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:54:39] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7026488706289735463
Running compilation step : cd /tmp/ltsmin7026488706289735463;'/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 434 ms.
Running link step : cd /tmp/ltsmin7026488706289735463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin7026488706289735463;'/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/stateBased3151799434586246585.hoa' '--buchi-type=spotba'
LTSmin run took 132 ms.
FORMULA Peterson-COL-2-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-COL-2-LTLFireability-03 finished in 4413 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(p0))'
Support contains 15 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 102 transition count 102
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 78 transition count 102
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 48 place count 78 transition count 84
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 84 place count 60 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 54 transition count 78
Applied a total of 96 rules in 13 ms. Remains 54 /102 variables (removed 48) and now considering 78/126 (removed 48) transitions.
[2024-05-28 06:54:40] [INFO ] Flow matrix only has 72 transitions (discarded 6 similar events)
// Phase 1: matrix 72 rows 54 cols
[2024-05-28 06:54:40] [INFO ] Computed 11 invariants in 1 ms
[2024-05-28 06:54:40] [INFO ] Implicit Places using invariants in 61 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/102 places, 78/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 51/102 places, 78/126 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s44 1)) (AND (GEQ s4 1) (GEQ s40 1)) (AND (GEQ s2 1) (GEQ s42 1)) (AND (GEQ s4 1) (GEQ s34 1)) (AND (GEQ s2 1) (GEQ s35 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2135 reset in 187 ms.
Stack based approach found an accepted trace after 39 steps with 1 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Peterson-COL-2-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-2-LTLFireability-05 finished in 324 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(F((p0&&X(p1))))&&(F(p2)||G(p0)))))'
Support contains 30 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-28 06:54:40] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-28 06:54:40] [INFO ] Computed 11 invariants in 2 ms
[2024-05-28 06:54:40] [INFO ] Implicit Places using invariants in 65 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 67 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p1)]
Running random walk in product with property : Peterson-COL-2-LTLFireability-06 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=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (GEQ s88 1) (GEQ s87 1) (GEQ s90 1) (GEQ s91 1) (GEQ s94 1) (GEQ s93 1) (GEQ s97 1) (GEQ s82 1) (GEQ s81 1) (GEQ s96 1) (GEQ s84 1) (GEQ s85 1)), p...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 191 ms.
Stack based approach found an accepted trace after 146 steps with 0 reset with depth 147 and stack size 147 in 1 ms.
FORMULA Peterson-COL-2-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-2-LTLFireability-06 finished in 577 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 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-28 06:54:41] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-28 06:54:41] [INFO ] Invariant cache hit.
[2024-05-28 06:54:41] [INFO ] Implicit Places using invariants in 62 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 64 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-2-LTLFireability-07 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 s3 1) (LT s49 1)) (OR (LT s1 1) (LT s48 1)) (OR (LT s5 1) (LT s50 1)) (OR (LT s9 1) (LT s15 1)) (OR (LT s9 1) (LT s16 1)) (OR (LT s8 1) (L...], 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 14995 reset in 211 ms.
Stack based approach found an accepted trace after 383 steps with 57 reset with depth 13 and stack size 13 in 0 ms.
FORMULA Peterson-COL-2-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-2-LTLFireability-07 finished in 374 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 U (p2||G(!p1)))||p0)))'
Support contains 30 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 102 transition count 102
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 78 transition count 102
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 48 place count 78 transition count 87
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 78 place count 63 transition count 87
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 90 place count 57 transition count 81
Applied a total of 90 rules in 10 ms. Remains 57 /102 variables (removed 45) and now considering 81/126 (removed 45) transitions.
[2024-05-28 06:54:41] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
// Phase 1: matrix 75 rows 57 cols
[2024-05-28 06:54:41] [INFO ] Computed 11 invariants in 1 ms
[2024-05-28 06:54:41] [INFO ] Implicit Places using invariants in 43 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/102 places, 81/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57 ms. Remains : 54/102 places, 81/126 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : Peterson-COL-2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 p2), acceptance={} source=2 dest: 2}]], initial=2, aps=[p2:(AND (NOT (OR (AND (GEQ s2 1) (GEQ s47 1)) (AND (GEQ s4 1) (GEQ s43 1)) (AND (GEQ s2 1) (GEQ s45 1)) (AND (GEQ s4 1) (GEQ s37 1)) (AND (GEQ s2 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 520 steps with 0 reset in 2 ms.
FORMULA Peterson-COL-2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-LTLFireability-08 finished in 198 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&&(!p1||G(p2))))))'
Support contains 24 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-28 06:54:41] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-28 06:54:41] [INFO ] Computed 11 invariants in 1 ms
[2024-05-28 06:54:41] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 06:54:41] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-28 06:54:41] [INFO ] Invariant cache hit.
[2024-05-28 06:54:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-28 06:54:42] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-05-28 06:54:42] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-28 06:54:42] [INFO ] Invariant cache hit.
[2024-05-28 06:54:42] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 360 ms. Remains : 102/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : Peterson-COL-2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND p1 (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s2 1) (GEQ s7 1))), p1:(OR (GEQ s91 1) (GEQ s90 1) (GEQ s93 1) (GEQ s94 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 263 ms.
Product exploration explored 100000 steps with 50000 reset in 276 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 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 137 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-2-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-2-LTLFireability-09 finished in 1211 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)))))'
Support contains 24 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 102 transition count 110
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 86 transition count 110
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 32 place count 86 transition count 96
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 60 place count 72 transition count 96
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 66 transition count 90
Applied a total of 72 rules in 15 ms. Remains 66 /102 variables (removed 36) and now considering 90/126 (removed 36) transitions.
[2024-05-28 06:54:43] [INFO ] Flow matrix only has 84 transitions (discarded 6 similar events)
// Phase 1: matrix 84 rows 66 cols
[2024-05-28 06:54:43] [INFO ] Computed 11 invariants in 1 ms
[2024-05-28 06:54:43] [INFO ] Implicit Places using invariants in 63 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 78 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/102 places, 90/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 96 ms. Remains : 63/102 places, 90/126 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : Peterson-COL-2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s40 1) (GEQ s42 1) (GEQ s41 1) (GEQ s43 1) (GEQ s33 1) (GEQ s44 1) (GEQ s34 1) (GEQ s36 1) (GEQ s35 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1)), p...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4550 reset in 190 ms.
Stack based approach found an accepted trace after 966 steps with 44 reset with depth 21 and stack size 21 in 2 ms.
FORMULA Peterson-COL-2-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-2-LTLFireability-11 finished in 405 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)) U p1))'
Support contains 15 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-28 06:54:43] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-28 06:54:43] [INFO ] Computed 11 invariants in 1 ms
[2024-05-28 06:54:43] [INFO ] Implicit Places using invariants in 69 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 79 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : Peterson-COL-2-LTLFireability-12 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=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s62 1) (GEQ s64 1) (GEQ s63 1) (GEQ s66 1) (GEQ s52 1) (GEQ s67 1) (GEQ s53 1) (GEQ s56 1) (GEQ s55 1) (GEQ s57 1) (GEQ s60 1) (GEQ s59 1)), p...], 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 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-2-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-LTLFireability-12 finished in 279 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)))'
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 72 place count 66 transition count 75
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 102 place count 51 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 45 transition count 69
Applied a total of 114 rules in 14 ms. Remains 45 /102 variables (removed 57) and now considering 69/126 (removed 57) transitions.
[2024-05-28 06:54:43] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
// Phase 1: matrix 63 rows 45 cols
[2024-05-28 06:54:43] [INFO ] Computed 11 invariants in 1 ms
[2024-05-28 06:54:43] [INFO ] Implicit Places using invariants in 58 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/102 places, 69/126 transitions.
Applied a total of 0 rules in 13 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86 ms. Remains : 42/102 places, 69/126 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s34 1)) (AND (GEQ s1 1) (GEQ s33 1)) (AND (GEQ s5 1) (GEQ s35 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3785 reset in 141 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA Peterson-COL-2-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-2-LTLFireability-13 finished in 321 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 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-28 06:54:44] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-28 06:54:44] [INFO ] Computed 11 invariants in 1 ms
[2024-05-28 06:54:44] [INFO ] Implicit Places using invariants in 77 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 79 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, p0, p0]
Running random walk in product with property : Peterson-COL-2-LTLFireability-14 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:(OR (GEQ s45 1) (GEQ s47 1) (GEQ s43 1))], 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 34 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-LTLFireability-14 finished in 274 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 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-28 06:54:44] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-28 06:54:44] [INFO ] Invariant cache hit.
[2024-05-28 06:54:44] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 06:54:44] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-28 06:54:44] [INFO ] Invariant cache hit.
[2024-05-28 06:54:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-28 06:54:44] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-28 06:54:44] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-28 06:54:44] [INFO ] Invariant cache hit.
[2024-05-28 06:54:44] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 102/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-2-LTLFireability-15 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 (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s2 1) (GEQ 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 50000 reset in 200 ms.
Product exploration explored 100000 steps with 50000 reset in 213 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-2-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-2-LTLFireability-15 finished in 853 ms.
All properties solved by simple procedures.
Total runtime 17327 ms.

BK_STOP 1716879286237

--------------------
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="Peterson-COL-2"
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 Peterson-COL-2, 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 r285-smll-171654422000128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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