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.r175-smll-171636279900093.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 EisenbergMcGuire-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636279900093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 12 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Apr 12 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 121K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716538363291

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=EisenbergMcGuire-PT-03
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 08:12:46] [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-24 08:12:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 08:12:46] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-24 08:12:46] [INFO ] Transformed 117 places.
[2024-05-24 08:12:46] [INFO ] Transformed 216 transitions.
[2024-05-24 08:12:46] [INFO ] Found NUPN structural information;
[2024-05-24 08:12:46] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 32 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
[2024-05-24 08:12:46] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-05-24 08:12:46] [INFO ] Computed 10 invariants in 10 ms
[2024-05-24 08:12:46] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-24 08:12:46] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:12:46] [INFO ] Invariant cache hit.
[2024-05-24 08:12:47] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:12:47] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2024-05-24 08:12:47] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:12:47] [INFO ] Invariant cache hit.
[2024-05-24 08:12:47] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 198/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 816 ms. Remains : 111/117 places, 198/216 transitions.
Support contains 31 out of 111 places after structural reductions.
[2024-05-24 08:12:47] [INFO ] Flatten gal took : 58 ms
[2024-05-24 08:12:47] [INFO ] Flatten gal took : 26 ms
[2024-05-24 08:12:47] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 30 out of 111 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 719 ms. (steps per millisecond=13 ) properties (out of 23) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2024-05-24 08:12:49] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:12:49] [INFO ] Invariant cache hit.
[2024-05-24 08:12:49] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-24 08:12:49] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-24 08:12:49] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-24 08:12:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-24 08:12:49] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-24 08:12:49] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2024-05-24 08:12:49] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:12:50] [INFO ] After 103ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :2 sat :9
[2024-05-24 08:12:50] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 8 ms to minimize.
[2024-05-24 08:12:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-05-24 08:12:50] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:12:50] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:12:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2024-05-24 08:12:50] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-05-24 08:12:50] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-24 08:12:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2024-05-24 08:12:50] [INFO ] After 620ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-05-24 08:12:50] [INFO ] After 1064ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 2 properties in 82 ms.
Support contains 14 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 198/198 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 110 transition count 197
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 2 place count 110 transition count 168
Deduced a syphon composed of 29 places in 4 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 60 place count 81 transition count 168
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 75 transition count 162
Applied a total of 72 rules in 44 ms. Remains 75 /111 variables (removed 36) and now considering 162/198 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 75/111 places, 162/198 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-24 08:12:51] [INFO ] Flow matrix only has 99 transitions (discarded 63 similar events)
// Phase 1: matrix 99 rows 75 cols
[2024-05-24 08:12:51] [INFO ] Computed 10 invariants in 3 ms
[2024-05-24 08:12:51] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-24 08:12:51] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-24 08:12:51] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 08:12:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-24 08:12:51] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-24 08:12:51] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 08:12:51] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:12:51] [INFO ] After 54ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 08:12:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-24 08:12:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-24 08:12:51] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-24 08:12:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-24 08:12:51] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:12:52] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:12:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2024-05-24 08:12:52] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-24 08:12:52] [INFO ] After 549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 13 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 162/162 transitions.
Applied a total of 0 rules in 10 ms. Remains 75 /75 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 75/75 places, 162/162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Finished probabilistic random walk after 17150 steps, run visited all 6 properties in 107 ms. (steps per millisecond=160 )
Probabilistic random walk after 17150 steps, saw 4560 distinct states, run finished after 108 ms. (steps per millisecond=158 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)||F(p1)))'
Support contains 7 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 109 transition count 196
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 4 place count 109 transition count 167
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 62 place count 80 transition count 167
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 74 place count 74 transition count 161
Applied a total of 74 rules in 25 ms. Remains 74 /111 variables (removed 37) and now considering 161/198 (removed 37) transitions.
[2024-05-24 08:12:53] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
// Phase 1: matrix 98 rows 74 cols
[2024-05-24 08:12:53] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 08:12:53] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-24 08:12:53] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 08:12:53] [INFO ] Invariant cache hit.
[2024-05-24 08:12:53] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:12:53] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-24 08:12:53] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 08:12:53] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 08:12:53] [INFO ] Invariant cache hit.
[2024-05-24 08:12:53] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/111 places, 161/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 444 ms. Remains : 74/111 places, 161/198 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 230 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-00 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:(AND (EQ s11 1) (EQ s36 1)), p0:(OR (EQ s9 0) (EQ s57 0) (AND (EQ s0 1) (EQ s5 1) (EQ s52 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 29 reset in 351 ms.
Product exploration explored 100000 steps with 21 reset in 224 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), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :2
Finished Best-First random walk after 172 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=86 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 7 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 161/161 transitions.
Applied a total of 0 rules in 9 ms. Remains 74 /74 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2024-05-24 08:12:55] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 08:12:55] [INFO ] Invariant cache hit.
[2024-05-24 08:12:55] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-24 08:12:55] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 08:12:55] [INFO ] Invariant cache hit.
[2024-05-24 08:12:55] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:12:55] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-05-24 08:12:55] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-24 08:12:55] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 08:12:55] [INFO ] Invariant cache hit.
[2024-05-24 08:12:55] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 593 ms. Remains : 74/74 places, 161/161 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 (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :2
Finished Best-First random walk after 140 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=140 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 34 reset in 166 ms.
Product exploration explored 100000 steps with 28 reset in 318 ms.
Built C files in :
/tmp/ltsmin11909791788214660165
[2024-05-24 08:12:57] [INFO ] Computing symmetric may disable matrix : 161 transitions.
[2024-05-24 08:12:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:12:57] [INFO ] Computing symmetric may enable matrix : 161 transitions.
[2024-05-24 08:12:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:12:57] [INFO ] Computing Do-Not-Accords matrix : 161 transitions.
[2024-05-24 08:12:57] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:12:57] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11909791788214660165
Running compilation step : cd /tmp/ltsmin11909791788214660165;'/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 819 ms.
Running link step : cd /tmp/ltsmin11909791788214660165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin11909791788214660165;'/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/stateBased132408643911967601.hoa' '--buchi-type=spotba'
LTSmin run took 361 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-00 finished in 5573 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 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-24 08:12:58] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-05-24 08:12:58] [INFO ] Computed 10 invariants in 3 ms
[2024-05-24 08:12:58] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-24 08:12:58] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:12:58] [INFO ] Invariant cache hit.
[2024-05-24 08:12:58] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:12:58] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-05-24 08:12:59] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:12:59] [INFO ] Invariant cache hit.
[2024-05-24 08:12:59] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 573 ms. Remains : 111/111 places, 198/198 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-01 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 (EQ s8 1) (EQ s52 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 143 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 EisenbergMcGuire-PT-03-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-01 finished in 811 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(((X(G(!p1)) U (!p2&&X(G(!p1))))||p0))))'
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 109 transition count 196
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 4 place count 109 transition count 166
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 64 place count 79 transition count 166
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 76 place count 73 transition count 160
Applied a total of 76 rules in 20 ms. Remains 73 /111 variables (removed 38) and now considering 160/198 (removed 38) transitions.
[2024-05-24 08:12:59] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
// Phase 1: matrix 97 rows 73 cols
[2024-05-24 08:12:59] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 08:12:59] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-24 08:12:59] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 08:12:59] [INFO ] Invariant cache hit.
[2024-05-24 08:12:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:12:59] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-05-24 08:12:59] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 08:12:59] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 08:12:59] [INFO ] Invariant cache hit.
[2024-05-24 08:12:59] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/111 places, 160/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 411 ms. Remains : 73/111 places, 160/198 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s2 1) (EQ s10 1) (EQ s47 1)), p0:(OR (NEQ s2 1) (NEQ s10 1) (NEQ s47 1)), p1:(AND (EQ s1 1) (EQ s7 1) (EQ s51 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 219 ms.
Product exploration explored 100000 steps with 0 reset in 219 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 p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 152 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Probably explored full state space saw : 5747 states, properties seen :2
Probabilistic random walk after 22988 steps, saw 5747 distinct states, run finished after 128 ms. (steps per millisecond=179 ) properties seen :2
Explored full state space saw : 5747 states, properties seen :0
Exhaustive walk after 22988 steps, saw 5747 distinct states, run finished after 116 ms. (steps per millisecond=198 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 14 factoid took 318 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 73 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 : 73/73 places, 160/160 transitions.
Applied a total of 0 rules in 8 ms. Remains 73 /73 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-24 08:13:01] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 08:13:01] [INFO ] Invariant cache hit.
[2024-05-24 08:13:01] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-24 08:13:01] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 08:13:01] [INFO ] Invariant cache hit.
[2024-05-24 08:13:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:13:02] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-05-24 08:13:02] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 08:13:02] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 08:13:02] [INFO ] Invariant cache hit.
[2024-05-24 08:13:02] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 402 ms. Remains : 73/73 places, 160/160 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4950 steps, run visited all 1 properties in 14 ms. (steps per millisecond=353 )
Probabilistic random walk after 4950 steps, saw 1533 distinct states, run finished after 14 ms. (steps per millisecond=353 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 127 ms.
Product exploration explored 100000 steps with 0 reset in 144 ms.
Built C files in :
/tmp/ltsmin7313696532812080070
[2024-05-24 08:13:03] [INFO ] Computing symmetric may disable matrix : 160 transitions.
[2024-05-24 08:13:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:13:03] [INFO ] Computing symmetric may enable matrix : 160 transitions.
[2024-05-24 08:13:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:13:03] [INFO ] Computing Do-Not-Accords matrix : 160 transitions.
[2024-05-24 08:13:03] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 08:13:03] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7313696532812080070
Running compilation step : cd /tmp/ltsmin7313696532812080070;'/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 477 ms.
Running link step : cd /tmp/ltsmin7313696532812080070;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7313696532812080070;'/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/stateBased13136503720996640459.hoa' '--buchi-type=spotba'
LTSmin run took 275 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-02 finished in 4584 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((G(p0)||F(p1)))))'
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-24 08:13:03] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-05-24 08:13:03] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 08:13:04] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-24 08:13:04] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:13:04] [INFO ] Invariant cache hit.
[2024-05-24 08:13:04] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:13:04] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-24 08:13:04] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:13:04] [INFO ] Invariant cache hit.
[2024-05-24 08:13:04] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 111/111 places, 198/198 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-03-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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s21 1), p0:(EQ s48 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 14385 reset in 193 ms.
Stack based approach found an accepted trace after 48 steps with 7 reset with depth 10 and stack size 10 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-03 finished in 829 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 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 196
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 109 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 108 transition count 195
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 6 place count 108 transition count 166
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 64 place count 79 transition count 166
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 3 with 12 rules applied. Total rules applied 76 place count 73 transition count 160
Applied a total of 76 rules in 18 ms. Remains 73 /111 variables (removed 38) and now considering 160/198 (removed 38) transitions.
[2024-05-24 08:13:04] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
// Phase 1: matrix 97 rows 73 cols
[2024-05-24 08:13:04] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 08:13:04] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-24 08:13:04] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 08:13:04] [INFO ] Invariant cache hit.
[2024-05-24 08:13:04] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:13:05] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2024-05-24 08:13:05] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 08:13:05] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 08:13:05] [INFO ] Invariant cache hit.
[2024-05-24 08:13:05] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/111 places, 160/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 402 ms. Remains : 73/111 places, 160/198 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s41 1), p0:(AND (EQ s2 1) (EQ s11 1) (EQ s51 1))], 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 45 reset in 130 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-04 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' '!(F(p0))'
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 195
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 108 transition count 195
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 108 transition count 166
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 79 transition count 166
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 74 place count 74 transition count 161
Applied a total of 74 rules in 19 ms. Remains 74 /111 variables (removed 37) and now considering 161/198 (removed 37) transitions.
[2024-05-24 08:13:05] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
// Phase 1: matrix 98 rows 74 cols
[2024-05-24 08:13:05] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 08:13:05] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-24 08:13:05] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 08:13:05] [INFO ] Invariant cache hit.
[2024-05-24 08:13:05] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:13:05] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-05-24 08:13:05] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 08:13:05] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 08:13:05] [INFO ] Invariant cache hit.
[2024-05-24 08:13:05] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/111 places, 161/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 524 ms. Remains : 74/111 places, 161/198 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2874 reset in 120 ms.
Stack based approach found an accepted trace after 16 steps with 1 reset with depth 9 and stack size 9 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-05 finished in 696 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 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-24 08:13:06] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-05-24 08:13:06] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 08:13:06] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-24 08:13:06] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:13:06] [INFO ] Invariant cache hit.
[2024-05-24 08:13:06] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:13:06] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-24 08:13:06] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:13:06] [INFO ] Invariant cache hit.
[2024-05-24 08:13:06] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 111/111 places, 198/198 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT 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:(OR (NEQ s0 1) (NEQ s4 1) (NEQ s75 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 33333 reset in 182 ms.
Product exploration explored 100000 steps with 33333 reset in 200 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-03-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-07 finished in 1007 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(G((F(p1) U p2)))))))'
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-24 08:13:07] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:13:07] [INFO ] Invariant cache hit.
[2024-05-24 08:13:07] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-24 08:13:07] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:13:07] [INFO ] Invariant cache hit.
[2024-05-24 08:13:07] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:13:07] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-24 08:13:07] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:13:07] [INFO ] Invariant cache hit.
[2024-05-24 08:13:07] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 497 ms. Remains : 111/111 places, 198/198 transitions.
Stuttering acceptance computed with spot in 545 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}, { cond=(NOT p2), acceptance={} source=6 dest: 5}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 11}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 8}], [{ cond=(NOT p2), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=10 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 9}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=11 dest: 11}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=12 dest: 10}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=12 dest: 11}, { cond=(AND p0 (NOT p2)), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p0:(EQ s58 1), p2:(AND (EQ s10 1) (EQ s47 1)), p1:(AND (NOT (AND (EQ s1 1) (EQ s99 1))) (EQ s10 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 846 reset in 137 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 1 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-09 finished in 1204 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||X(F(p1))))))'
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-24 08:13:08] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:13:08] [INFO ] Invariant cache hit.
[2024-05-24 08:13:08] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-24 08:13:08] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:13:08] [INFO ] Invariant cache hit.
[2024-05-24 08:13:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:13:08] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-24 08:13:08] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:13:08] [INFO ] Invariant cache hit.
[2024-05-24 08:13:08] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 478 ms. Remains : 111/111 places, 198/198 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s59 1)), p1:(AND (EQ s11 1) (EQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 612 reset in 110 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 EisenbergMcGuire-PT-03-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-10 finished in 724 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)||X(F((!p1 U (p2||G(!p1)))))))'
Support contains 8 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-24 08:13:09] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:13:09] [INFO ] Invariant cache hit.
[2024-05-24 08:13:09] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-24 08:13:09] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:13:09] [INFO ] Invariant cache hit.
[2024-05-24 08:13:09] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:13:09] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-24 08:13:09] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 08:13:09] [INFO ] Invariant cache hit.
[2024-05-24 08:13:09] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 111/111 places, 198/198 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s9 1) (EQ s77 1)), p2:(AND (NOT (AND (EQ s1 1) (EQ s7 1) (EQ s74 1))) (NOT (AND (EQ s10 1) (EQ s53 1)))), p1:(AND (EQ s10 1) (EQ s53...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Product exploration explored 100000 steps with 50000 reset in 248 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 p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-03-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-11 finished in 1104 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 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 195
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 108 transition count 195
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 108 transition count 165
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 78 transition count 165
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 76 place count 73 transition count 160
Applied a total of 76 rules in 13 ms. Remains 73 /111 variables (removed 38) and now considering 160/198 (removed 38) transitions.
[2024-05-24 08:13:10] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
// Phase 1: matrix 97 rows 73 cols
[2024-05-24 08:13:10] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 08:13:10] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-24 08:13:10] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 08:13:10] [INFO ] Invariant cache hit.
[2024-05-24 08:13:10] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 08:13:10] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-05-24 08:13:10] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 08:13:10] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 08:13:10] [INFO ] Invariant cache hit.
[2024-05-24 08:13:10] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/111 places, 160/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 393 ms. Remains : 73/111 places, 160/198 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s27 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 118 ms.
Stack based approach found an accepted trace after 1122 steps with 0 reset with depth 1123 and stack size 245 in 1 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-15 finished in 565 ms.
All properties solved by simple procedures.
Total runtime 24682 ms.

BK_STOP 1716538391779

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is EisenbergMcGuire-PT-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-smll-171636279900093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-03.tgz
mv EisenbergMcGuire-PT-03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;