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.r021-smll-171620128200203.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 Anderson-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620128200203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 12 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 12 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 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 185K 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 Anderson-PT-05-LTLFireability-00
FORMULA_NAME Anderson-PT-05-LTLFireability-01
FORMULA_NAME Anderson-PT-05-LTLFireability-02
FORMULA_NAME Anderson-PT-05-LTLFireability-03
FORMULA_NAME Anderson-PT-05-LTLFireability-04
FORMULA_NAME Anderson-PT-05-LTLFireability-05
FORMULA_NAME Anderson-PT-05-LTLFireability-06
FORMULA_NAME Anderson-PT-05-LTLFireability-07
FORMULA_NAME Anderson-PT-05-LTLFireability-08
FORMULA_NAME Anderson-PT-05-LTLFireability-09
FORMULA_NAME Anderson-PT-05-LTLFireability-10
FORMULA_NAME Anderson-PT-05-LTLFireability-11
FORMULA_NAME Anderson-PT-05-LTLFireability-12
FORMULA_NAME Anderson-PT-05-LTLFireability-13
FORMULA_NAME Anderson-PT-05-LTLFireability-14
FORMULA_NAME Anderson-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716515292839

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=Anderson-PT-05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 01:48:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 01:48:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 01:48:16] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-24 01:48:16] [INFO ] Transformed 161 places.
[2024-05-24 01:48:16] [INFO ] Transformed 365 transitions.
[2024-05-24 01:48:16] [INFO ] Found NUPN structural information;
[2024-05-24 01:48:16] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 334 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-05-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 365/365 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 141 transition count 297
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 141 transition count 297
Applied a total of 40 rules in 62 ms. Remains 141 /161 variables (removed 20) and now considering 297/365 (removed 68) transitions.
// Phase 1: matrix 297 rows 141 cols
[2024-05-24 01:48:17] [INFO ] Computed 13 invariants in 22 ms
[2024-05-24 01:48:17] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-24 01:48:17] [INFO ] Invariant cache hit.
[2024-05-24 01:48:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 01:48:18] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2024-05-24 01:48:18] [INFO ] Invariant cache hit.
[2024-05-24 01:48:18] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/161 places, 297/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1624 ms. Remains : 141/161 places, 297/365 transitions.
Support contains 38 out of 141 places after structural reductions.
[2024-05-24 01:48:19] [INFO ] Flatten gal took : 105 ms
[2024-05-24 01:48:19] [INFO ] Flatten gal took : 60 ms
[2024-05-24 01:48:19] [INFO ] Input system was already deterministic with 297 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 831 ms. (steps per millisecond=12 ) properties (out of 30) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :7
Running SMT prover for 1 properties.
[2024-05-24 01:48:20] [INFO ] Invariant cache hit.
[2024-05-24 01:48:20] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-24 01:48:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-24 01:48:20] [INFO ] After 338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 01:48:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-24 01:48:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-24 01:48:20] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 01:48:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 01:48:20] [INFO ] After 31ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 01:48:21] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-24 01:48:21] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 141 transition count 277
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 121 transition count 277
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 59 place count 102 transition count 154
Iterating global reduction 0 with 19 rules applied. Total rules applied 78 place count 102 transition count 154
Applied a total of 78 rules in 38 ms. Remains 102 /141 variables (removed 39) and now considering 154/297 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 102/141 places, 154/297 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5175 steps, run visited all 1 properties in 39 ms. (steps per millisecond=132 )
Probabilistic random walk after 5175 steps, saw 3119 distinct states, run finished after 40 ms. (steps per millisecond=129 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Anderson-PT-05-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 121 transition count 165
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 121 transition count 165
Applied a total of 40 rules in 24 ms. Remains 121 /141 variables (removed 20) and now considering 165/297 (removed 132) transitions.
// Phase 1: matrix 165 rows 121 cols
[2024-05-24 01:48:21] [INFO ] Computed 13 invariants in 5 ms
[2024-05-24 01:48:21] [INFO ] Implicit Places using invariants in 198 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 202 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/141 places, 165/297 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 165/165 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 229 ms. Remains : 120/141 places, 165/297 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 326 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-00 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:(AND (EQ s13 1) (EQ s24 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 1 reset in 339 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 1 ms.
FORMULA Anderson-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-00 finished in 987 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 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 141 transition count 278
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 122 transition count 278
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 103 transition count 147
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 103 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 102 transition count 146
Applied a total of 78 rules in 23 ms. Remains 102 /141 variables (removed 39) and now considering 146/297 (removed 151) transitions.
// Phase 1: matrix 146 rows 102 cols
[2024-05-24 01:48:22] [INFO ] Computed 13 invariants in 4 ms
[2024-05-24 01:48:22] [INFO ] Implicit Places using invariants in 157 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/141 places, 146/297 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 101 transition count 121
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 76 transition count 121
Applied a total of 50 rules in 16 ms. Remains 76 /101 variables (removed 25) and now considering 121/146 (removed 25) transitions.
// Phase 1: matrix 121 rows 76 cols
[2024-05-24 01:48:22] [INFO ] Computed 12 invariants in 2 ms
[2024-05-24 01:48:22] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-24 01:48:22] [INFO ] Invariant cache hit.
[2024-05-24 01:48:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 01:48:23] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/141 places, 121/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 575 ms. Remains : 76/141 places, 121/297 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-01 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 s44 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 295 ms.
Stack based approach found an accepted trace after 5136 steps with 0 reset with depth 5137 and stack size 2208 in 15 ms.
FORMULA Anderson-PT-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-01 finished in 953 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) U (G(p2)&&p1))) U (G(p2)||X(!p3))))'
Support contains 7 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 192
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 192
Applied a total of 34 rules in 6 ms. Remains 124 /141 variables (removed 17) and now considering 192/297 (removed 105) transitions.
// Phase 1: matrix 192 rows 124 cols
[2024-05-24 01:48:23] [INFO ] Computed 13 invariants in 4 ms
[2024-05-24 01:48:23] [INFO ] Implicit Places using invariants in 190 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 196 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/141 places, 192/297 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 205 ms. Remains : 123/141 places, 192/297 transitions.
Stuttering acceptance computed with spot in 649 ms :[(AND (NOT p2) p3), (AND p2 (NOT p0) p1 p3), (OR (AND (NOT p2) p3) (AND (NOT p1) p3)), (AND (NOT p2) p3), (AND (NOT p2) p3), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(AND p2 p1 (NOT p0) p3), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p1) (NOT p0) p3)), acceptance={} source=2 dest: 5}, { cond=(OR (AND (NOT p2) p3) (AND (NOT p1) p3)), acceptance={} source=2 dest: 6}, { cond=p3, acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND p2 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 8}, { cond=(AND p2 p3), acceptance={} source=4 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=6 dest: 5}, { cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND p2 p1), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(NOT p2), acceptance={0} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=8 dest: 5}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=true, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(NOT p2), acceptance={} source=9 dest: 6}, { cond=(NOT p2), acceptance={} source=9 dest: 8}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (EQ s10 1) (EQ s20 1)), p0:(AND (EQ s13 1) (EQ s21 1)), p1:(AND (EQ s5 1) (EQ s21 1)), p3:(AND (EQ s8 1) (EQ s19 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][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 384 ms.
Product exploration explored 100000 steps with 50000 reset in 355 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) (NOT p0) p1 (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p0) p3))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 p1 (NOT p0) p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p1) (NOT p0) p3)))), (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p1) p3)))), (X (X (NOT p3))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p1) p3))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p2 p1 (NOT p0) p3)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p1) (NOT p0) p3))))), (X (X (OR (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 22 factoid took 34 ms. Reduced automaton from 10 states, 31 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-05-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLFireability-02 finished in 1690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p1))||p0))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 141 transition count 277
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 121 transition count 277
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 59 place count 102 transition count 154
Iterating global reduction 0 with 19 rules applied. Total rules applied 78 place count 102 transition count 154
Applied a total of 78 rules in 29 ms. Remains 102 /141 variables (removed 39) and now considering 154/297 (removed 143) transitions.
// Phase 1: matrix 154 rows 102 cols
[2024-05-24 01:48:25] [INFO ] Computed 13 invariants in 3 ms
[2024-05-24 01:48:25] [INFO ] Implicit Places using invariants in 661 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 663 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/141 places, 154/297 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 101 transition count 130
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 77 transition count 130
Applied a total of 48 rules in 22 ms. Remains 77 /101 variables (removed 24) and now considering 130/154 (removed 24) transitions.
// Phase 1: matrix 130 rows 77 cols
[2024-05-24 01:48:25] [INFO ] Computed 12 invariants in 3 ms
[2024-05-24 01:48:26] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-24 01:48:26] [INFO ] Invariant cache hit.
[2024-05-24 01:48:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 01:48:26] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/141 places, 130/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1181 ms. Remains : 77/141 places, 130/297 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s20 0)), p1:(OR (EQ s12 0) (EQ s30 0))], 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 0 reset in 120 ms.
Product exploration explored 100000 steps with 0 reset in 231 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 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 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Probably explored full state space saw : 6626 states, properties seen :0
Probabilistic random walk after 22264 steps, saw 6626 distinct states, run finished after 96 ms. (steps per millisecond=231 ) properties seen :0
Explored full state space saw : 6626 states, properties seen :0
Exhaustive walk after 22264 steps, saw 6626 distinct states, run finished after 68 ms. (steps per millisecond=327 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-05-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLFireability-03 finished in 2266 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))))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 122 transition count 174
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 122 transition count 174
Applied a total of 38 rules in 5 ms. Remains 122 /141 variables (removed 19) and now considering 174/297 (removed 123) transitions.
// Phase 1: matrix 174 rows 122 cols
[2024-05-24 01:48:27] [INFO ] Computed 13 invariants in 5 ms
[2024-05-24 01:48:27] [INFO ] Implicit Places using invariants in 148 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 151 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/141 places, 174/297 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 121/141 places, 174/297 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s13 0) (EQ s20 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 118 ms.
Product exploration explored 100000 steps with 0 reset in 137 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 : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished Best-First random walk after 9221 steps, including 2 resets, run visited all 1 properties in 10 ms. (steps per millisecond=922 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 174/174 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 121 cols
[2024-05-24 01:48:28] [INFO ] Computed 12 invariants in 3 ms
[2024-05-24 01:48:29] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-24 01:48:29] [INFO ] Invariant cache hit.
[2024-05-24 01:48:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 01:48:29] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-05-24 01:48:29] [INFO ] Invariant cache hit.
[2024-05-24 01:48:29] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 782 ms. Remains : 121/121 places, 174/174 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 28234 steps, run visited all 1 properties in 78 ms. (steps per millisecond=361 )
Probabilistic random walk after 28234 steps, saw 14270 distinct states, run finished after 79 ms. (steps per millisecond=357 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 111 ms.
Product exploration explored 100000 steps with 0 reset in 136 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 174/174 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 121 transition count 174
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 24 place count 121 transition count 174
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 44 place count 121 transition count 174
Deduced a syphon composed of 44 places in 0 ms
Applied a total of 44 rules in 14 ms. Remains 121 /121 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-24 01:48:31] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 174 rows 121 cols
[2024-05-24 01:48:31] [INFO ] Computed 12 invariants in 2 ms
[2024-05-24 01:48:31] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/121 places, 174/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 121/121 places, 174/174 transitions.
Built C files in :
/tmp/ltsmin2063967654233143536
[2024-05-24 01:48:31] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2063967654233143536
Running compilation step : cd /tmp/ltsmin2063967654233143536;'/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 900 ms.
Running link step : cd /tmp/ltsmin2063967654233143536;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin2063967654233143536;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11320375874103346413.hoa' '--buchi-type=spotba'
LTSmin run took 1230 ms.
FORMULA Anderson-PT-05-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-05-LTLFireability-05 finished in 6216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 184
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 184
Applied a total of 34 rules in 7 ms. Remains 124 /141 variables (removed 17) and now considering 184/297 (removed 113) transitions.
// Phase 1: matrix 184 rows 124 cols
[2024-05-24 01:48:33] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 01:48:33] [INFO ] Implicit Places using invariants in 153 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 156 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/141 places, 184/297 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 123/141 places, 184/297 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s10 0) (EQ s20 0)) (EQ s45 0)), p1:(AND (EQ s5 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 119 ms.
Stack based approach found an accepted trace after 283 steps with 0 reset with depth 284 and stack size 220 in 1 ms.
FORMULA Anderson-PT-05-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-06 finished in 471 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||G(p1))))'
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 141 transition count 278
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 122 transition count 278
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 56 place count 104 transition count 156
Iterating global reduction 0 with 18 rules applied. Total rules applied 74 place count 104 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 103 transition count 155
Applied a total of 76 rules in 19 ms. Remains 103 /141 variables (removed 38) and now considering 155/297 (removed 142) transitions.
// Phase 1: matrix 155 rows 103 cols
[2024-05-24 01:48:34] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 01:48:34] [INFO ] Implicit Places using invariants in 134 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/141 places, 155/297 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 131
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 131
Applied a total of 48 rules in 7 ms. Remains 78 /102 variables (removed 24) and now considering 131/155 (removed 24) transitions.
// Phase 1: matrix 131 rows 78 cols
[2024-05-24 01:48:34] [INFO ] Computed 12 invariants in 1 ms
[2024-05-24 01:48:34] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-24 01:48:34] [INFO ] Invariant cache hit.
[2024-05-24 01:48:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 01:48:34] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/141 places, 131/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 791 ms. Remains : 78/141 places, 131/297 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s25 0), p0:(AND (EQ s6 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 23 reset in 155 ms.
Stack based approach found an accepted trace after 1412 steps with 0 reset with depth 1413 and stack size 736 in 3 ms.
FORMULA Anderson-PT-05-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-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' '!((F(G(!p0)) U p1))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 141 transition count 277
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 121 transition count 277
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 101 transition count 145
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 101 transition count 145
Applied a total of 80 rules in 17 ms. Remains 101 /141 variables (removed 40) and now considering 145/297 (removed 152) transitions.
// Phase 1: matrix 145 rows 101 cols
[2024-05-24 01:48:35] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 01:48:35] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-24 01:48:35] [INFO ] Invariant cache hit.
[2024-05-24 01:48:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 01:48:35] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-05-24 01:48:35] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-24 01:48:35] [INFO ] Invariant cache hit.
[2024-05-24 01:48:35] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/141 places, 145/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 656 ms. Remains : 101/141 places, 145/297 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), p0]
Running random walk in product with property : Anderson-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s12 1) (EQ s40 1)), p0:(AND (EQ s0 1) (EQ s94 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 0 reset in 193 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 72 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-08 finished in 958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 141 transition count 278
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 122 transition count 278
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 103 transition count 155
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 103 transition count 155
Applied a total of 76 rules in 21 ms. Remains 103 /141 variables (removed 38) and now considering 155/297 (removed 142) transitions.
// Phase 1: matrix 155 rows 103 cols
[2024-05-24 01:48:36] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 01:48:36] [INFO ] Implicit Places using invariants in 228 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 230 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/141 places, 155/297 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 102 transition count 141
Reduce places removed 14 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 19 rules applied. Total rules applied 33 place count 88 transition count 136
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 38 place count 83 transition count 136
Applied a total of 38 rules in 16 ms. Remains 83 /102 variables (removed 19) and now considering 136/155 (removed 19) transitions.
// Phase 1: matrix 136 rows 83 cols
[2024-05-24 01:48:36] [INFO ] Computed 12 invariants in 2 ms
[2024-05-24 01:48:36] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-24 01:48:36] [INFO ] Invariant cache hit.
[2024-05-24 01:48:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 01:48:36] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/141 places, 136/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 717 ms. Remains : 83/141 places, 136/297 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s49 1)), p1:(OR (NEQ s9 1) (NEQ s17 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 192 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-09 finished in 1094 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 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 141 transition count 277
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 121 transition count 277
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 59 place count 102 transition count 154
Iterating global reduction 0 with 19 rules applied. Total rules applied 78 place count 102 transition count 154
Applied a total of 78 rules in 16 ms. Remains 102 /141 variables (removed 39) and now considering 154/297 (removed 143) transitions.
// Phase 1: matrix 154 rows 102 cols
[2024-05-24 01:48:37] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 01:48:37] [INFO ] Implicit Places using invariants in 275 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 277 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/141 places, 154/297 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 101 transition count 130
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 77 transition count 130
Applied a total of 48 rules in 9 ms. Remains 77 /101 variables (removed 24) and now considering 130/154 (removed 24) transitions.
// Phase 1: matrix 130 rows 77 cols
[2024-05-24 01:48:37] [INFO ] Computed 12 invariants in 1 ms
[2024-05-24 01:48:37] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-24 01:48:37] [INFO ] Invariant cache hit.
[2024-05-24 01:48:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 01:48:37] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/141 places, 130/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 676 ms. Remains : 77/141 places, 130/297 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s17 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 11 reset in 196 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-12 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(X((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 183
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 183
Applied a total of 36 rules in 5 ms. Remains 123 /141 variables (removed 18) and now considering 183/297 (removed 114) transitions.
// Phase 1: matrix 183 rows 123 cols
[2024-05-24 01:48:38] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 01:48:38] [INFO ] Implicit Places using invariants in 285 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 286 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/141 places, 183/297 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 295 ms. Remains : 122/141 places, 183/297 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s5 1) (EQ s17 1) (NOT (AND (EQ s13 1) (EQ s19 1)))), p0:(AND (EQ s13 1) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 129 ms.
Product exploration explored 100000 steps with 7 reset in 148 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 (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 122 cols
[2024-05-24 01:48:39] [INFO ] Computed 12 invariants in 3 ms
[2024-05-24 01:48:39] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-05-24 01:48:39] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 11 ms returned sat
[2024-05-24 01:48:39] [INFO ] After 108ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 01:48:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 01:48:39] [INFO ] After 50ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 01:48:39] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 01:48:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-05-24 01:48:39] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 7 ms returned sat
[2024-05-24 01:48:39] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 01:48:39] [INFO ] After 57ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 01:48:39] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-24 01:48:39] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 183/183 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2024-05-24 01:48:40] [INFO ] Invariant cache hit.
[2024-05-24 01:48:40] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-24 01:48:40] [INFO ] Invariant cache hit.
[2024-05-24 01:48:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 01:48:40] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2024-05-24 01:48:40] [INFO ] Invariant cache hit.
[2024-05-24 01:48:41] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 725 ms. Remains : 122/122 places, 183/183 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 p0) (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-24 01:48:41] [INFO ] Invariant cache hit.
[2024-05-24 01:48:41] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2024-05-24 01:48:41] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 10 ms returned sat
[2024-05-24 01:48:41] [INFO ] After 111ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 01:48:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 01:48:41] [INFO ] After 26ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 01:48:41] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 01:48:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-05-24 01:48:41] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 9 ms returned sat
[2024-05-24 01:48:41] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 01:48:41] [INFO ] After 38ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 01:48:42] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-24 01:48:42] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 398 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Entered a terminal (fully accepting) state of product in 35521 steps with 1 reset in 72 ms.
FORMULA Anderson-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-05-LTLFireability-13 finished in 4714 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)||(G(p2)&&p1))))'
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 183
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 183
Applied a total of 36 rules in 5 ms. Remains 123 /141 variables (removed 18) and now considering 183/297 (removed 114) transitions.
// Phase 1: matrix 183 rows 123 cols
[2024-05-24 01:48:42] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 01:48:43] [INFO ] Implicit Places using invariants in 215 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 228 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/141 places, 183/297 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 235 ms. Remains : 122/141 places, 183/297 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s9 0) (EQ s18 0)), p1:(AND (EQ s9 1) (EQ s20 1)), p2:(OR (NEQ s14 1) (NEQ s41 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 50000 reset in 503 ms.
Product exploration explored 100000 steps with 50000 reset in 351 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) p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-05-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLFireability-14 finished in 1370 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(((p1 U p2)||p0)))))'
Support contains 6 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 176
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 176
Applied a total of 34 rules in 2 ms. Remains 124 /141 variables (removed 17) and now considering 176/297 (removed 121) transitions.
// Phase 1: matrix 176 rows 124 cols
[2024-05-24 01:48:44] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 01:48:44] [INFO ] Implicit Places using invariants in 250 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 253 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/141 places, 176/297 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 257 ms. Remains : 123/141 places, 176/297 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), 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 (EQ s28 1) (EQ s47 1) (AND (EQ s0 1) (EQ s52 1))), p2:(AND (EQ s12 1) (EQ s18 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 403 reset in 129 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 2 ms.
FORMULA Anderson-PT-05-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-15 finished in 586 ms.
All properties solved by simple procedures.
Total runtime 28572 ms.

BK_STOP 1716515326075

--------------------
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="Anderson-PT-05"
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 Anderson-PT-05, 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 r021-smll-171620128200203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-05.tgz
mv Anderson-PT-05 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 ;