Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.5K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 185K Mar 31 16:48 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1680827202937

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-05
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 00:26:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 00:26:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 00:26:44] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-04-07 00:26:44] [INFO ] Transformed 161 places.
[2023-04-07 00:26:44] [INFO ] Transformed 365 transitions.
[2023-04-07 00:26:44] [INFO ] Found NUPN structural information;
[2023-04-07 00:26:44] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Anderson-PT-05-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 365/365 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 136 transition count 292
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 136 transition count 292
Applied a total of 50 rules in 30 ms. Remains 136 /161 variables (removed 25) and now considering 292/365 (removed 73) transitions.
// Phase 1: matrix 292 rows 136 cols
[2023-04-07 00:26:44] [INFO ] Computed 13 invariants in 24 ms
[2023-04-07 00:26:45] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-04-07 00:26:45] [INFO ] Invariant cache hit.
[2023-04-07 00:26:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 00:26:45] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2023-04-07 00:26:45] [INFO ] Invariant cache hit.
[2023-04-07 00:26:45] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/161 places, 292/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 844 ms. Remains : 136/161 places, 292/365 transitions.
Support contains 30 out of 136 places after structural reductions.
[2023-04-07 00:26:45] [INFO ] Flatten gal took : 50 ms
[2023-04-07 00:26:45] [INFO ] Flatten gal took : 23 ms
[2023-04-07 00:26:45] [INFO ] Input system was already deterministic with 292 transitions.
Support contains 29 out of 136 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 511 ms. (steps per millisecond=19 ) properties (out of 23) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 00:26:46] [INFO ] Invariant cache hit.
[2023-04-07 00:26:46] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-04-07 00:26:46] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 00:26:46] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 00:26:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-04-07 00:26:46] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 00:26:46] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA Anderson-PT-05-LTLFireability-13 TRUE 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' '!(X(G((p0||G(p1)||G(p2)))))'
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 183
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 183
Applied a total of 26 rules in 14 ms. Remains 123 /136 variables (removed 13) and now considering 183/292 (removed 109) transitions.
// Phase 1: matrix 183 rows 123 cols
[2023-04-07 00:26:47] [INFO ] Computed 13 invariants in 6 ms
[2023-04-07 00:26:47] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-04-07 00:26:47] [INFO ] Invariant cache hit.
[2023-04-07 00:26:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 00:26:47] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-04-07 00:26:47] [INFO ] Invariant cache hit.
[2023-04-07 00:26:47] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/136 places, 183/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 123/136 places, 183/292 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 335 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(OR (EQ s11 0) (EQ s22 0)), p2:(OR (NEQ s6 1) (NEQ s18 1)), p0:(AND (EQ s0 1) (EQ s104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10163 steps with 0 reset in 78 ms.
FORMULA Anderson-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-05-LTLFireability-01 finished in 939 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 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 292/292 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 136 transition count 272
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 116 transition count 272
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 102 transition count 154
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 102 transition count 154
Applied a total of 68 rules in 26 ms. Remains 102 /136 variables (removed 34) and now considering 154/292 (removed 138) transitions.
// Phase 1: matrix 154 rows 102 cols
[2023-04-07 00:26:48] [INFO ] Computed 13 invariants in 3 ms
[2023-04-07 00:26:48] [INFO ] Implicit Places using invariants in 82 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/136 places, 154/292 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 6 ms. Remains 77 /101 variables (removed 24) and now considering 130/154 (removed 24) transitions.
// Phase 1: matrix 130 rows 77 cols
[2023-04-07 00:26:48] [INFO ] Computed 12 invariants in 1 ms
[2023-04-07 00:26:48] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-04-07 00:26:48] [INFO ] Invariant cache hit.
[2023-04-07 00:26:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 00:26:48] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/136 places, 130/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 278 ms. Remains : 77/136 places, 130/292 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s20 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 168 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 1 ms.
FORMULA Anderson-PT-05-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-02 finished in 497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 183
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 183
Applied a total of 26 rules in 10 ms. Remains 123 /136 variables (removed 13) and now considering 183/292 (removed 109) transitions.
// Phase 1: matrix 183 rows 123 cols
[2023-04-07 00:26:48] [INFO ] Computed 13 invariants in 3 ms
[2023-04-07 00:26:48] [INFO ] Implicit Places using invariants in 78 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/136 places, 183/292 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 94 ms. Remains : 122/136 places, 183/292 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s11 1) (EQ s20 1) (OR (EQ s6 0) (EQ s18 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-05-LTLFireability-03 finished in 230 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((G((F(p1)&&F(G(p2))))&&p0))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 183
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 183
Applied a total of 26 rules in 9 ms. Remains 123 /136 variables (removed 13) and now considering 183/292 (removed 109) transitions.
// Phase 1: matrix 183 rows 123 cols
[2023-04-07 00:26:48] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 00:26:48] [INFO ] Implicit Places using invariants in 76 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/136 places, 183/292 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 89 ms. Remains : 122/136 places, 183/292 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s9 0) (EQ s20 0)), p2:(AND (EQ s10 1) (EQ s17 1)), p0:(AND (EQ s10 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 111 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-05 finished in 515 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 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 292/292 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 136 transition count 272
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 116 transition count 272
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 102 transition count 154
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 102 transition count 154
Applied a total of 68 rules in 11 ms. Remains 102 /136 variables (removed 34) and now considering 154/292 (removed 138) transitions.
// Phase 1: matrix 154 rows 102 cols
[2023-04-07 00:26:49] [INFO ] Computed 13 invariants in 2 ms
[2023-04-07 00:26:49] [INFO ] Implicit Places using invariants in 376 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 389 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/136 places, 154/292 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 6 ms. Remains 77 /101 variables (removed 24) and now considering 130/154 (removed 24) transitions.
// Phase 1: matrix 130 rows 77 cols
[2023-04-07 00:26:49] [INFO ] Computed 12 invariants in 4 ms
[2023-04-07 00:26:49] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-04-07 00:26:49] [INFO ] Invariant cache hit.
[2023-04-07 00:26:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 00:26:49] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/136 places, 130/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 600 ms. Remains : 77/136 places, 130/292 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s15 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 120 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-07 finished in 765 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 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 175
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 175
Applied a total of 26 rules in 7 ms. Remains 123 /136 variables (removed 13) and now considering 175/292 (removed 117) transitions.
// Phase 1: matrix 175 rows 123 cols
[2023-04-07 00:26:50] [INFO ] Computed 13 invariants in 3 ms
[2023-04-07 00:26:50] [INFO ] Implicit Places using invariants in 82 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/136 places, 175/292 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 122/136 places, 175/292 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s15 1) (EQ 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][false, false]]
Product exploration explored 100000 steps with 0 reset in 95 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-08 finished in 282 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 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 165
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 165
Applied a total of 30 rules in 10 ms. Remains 121 /136 variables (removed 15) and now considering 165/292 (removed 127) transitions.
// Phase 1: matrix 165 rows 121 cols
[2023-04-07 00:26:50] [INFO ] Computed 13 invariants in 3 ms
[2023-04-07 00:26:50] [INFO ] Implicit Places using invariants in 87 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/136 places, 165/292 transitions.
Applied a total of 0 rules in 2 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 101 ms. Remains : 120/136 places, 165/292 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-10 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 s4 1) (EQ s55 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 150 reset in 124 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 1 ms.
FORMULA Anderson-PT-05-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-10 finished in 333 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 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 292/292 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 136 transition count 272
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 116 transition count 272
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 102 transition count 154
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 102 transition count 154
Applied a total of 68 rules in 15 ms. Remains 102 /136 variables (removed 34) and now considering 154/292 (removed 138) transitions.
// Phase 1: matrix 154 rows 102 cols
[2023-04-07 00:26:50] [INFO ] Computed 13 invariants in 2 ms
[2023-04-07 00:26:50] [INFO ] Implicit Places using invariants in 87 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/136 places, 154/292 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 5 ms. Remains 77 /101 variables (removed 24) and now considering 130/154 (removed 24) transitions.
// Phase 1: matrix 130 rows 77 cols
[2023-04-07 00:26:50] [INFO ] Computed 12 invariants in 1 ms
[2023-04-07 00:26:50] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-04-07 00:26:50] [INFO ] Invariant cache hit.
[2023-04-07 00:26:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 00:26:50] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/136 places, 130/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 273 ms. Remains : 77/136 places, 130/292 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s16 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 95 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-11 finished in 423 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 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 174
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 174
Applied a total of 28 rules in 5 ms. Remains 122 /136 variables (removed 14) and now considering 174/292 (removed 118) transitions.
// Phase 1: matrix 174 rows 122 cols
[2023-04-07 00:26:51] [INFO ] Computed 13 invariants in 2 ms
[2023-04-07 00:26:51] [INFO ] Implicit Places using invariants in 77 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/136 places, 174/292 transitions.
Applied a total of 0 rules in 1 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 86 ms. Remains : 121/136 places, 174/292 transitions.
Stuttering acceptance computed with spot in 132 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s12 1) (EQ s16 1)), p0:(AND (EQ s4 1) (EQ s46 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 33333 reset in 155 ms.
Product exploration explored 100000 steps with 33333 reset in 147 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-05-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLFireability-12 finished in 652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 292/292 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 136 transition count 272
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 116 transition count 272
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 103 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 103 transition count 163
Applied a total of 66 rules in 12 ms. Remains 103 /136 variables (removed 33) and now considering 163/292 (removed 129) transitions.
// Phase 1: matrix 163 rows 103 cols
[2023-04-07 00:26:51] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 00:26:51] [INFO ] Implicit Places using invariants in 78 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/136 places, 163/292 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 102 transition count 140
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 79 transition count 140
Applied a total of 46 rules in 4 ms. Remains 79 /102 variables (removed 23) and now considering 140/163 (removed 23) transitions.
// Phase 1: matrix 140 rows 79 cols
[2023-04-07 00:26:51] [INFO ] Computed 12 invariants in 3 ms
[2023-04-07 00:26:51] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-04-07 00:26:51] [INFO ] Invariant cache hit.
[2023-04-07 00:26:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 00:26:51] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/136 places, 140/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 288 ms. Remains : 79/136 places, 140/292 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s16 1)), p1:(AND (OR (AND (EQ s9 1) (EQ s18 1)) (AND (EQ s5 1) (EQ s16 1))) (EQ s9 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 408 reset in 97 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-14 finished in 469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 292/292 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 136 transition count 272
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 116 transition count 272
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 102 transition count 154
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 102 transition count 154
Applied a total of 68 rules in 13 ms. Remains 102 /136 variables (removed 34) and now considering 154/292 (removed 138) transitions.
// Phase 1: matrix 154 rows 102 cols
[2023-04-07 00:26:52] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 00:26:52] [INFO ] Implicit Places using invariants in 81 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/136 places, 154/292 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 4 ms. Remains 77 /101 variables (removed 24) and now considering 130/154 (removed 24) transitions.
// Phase 1: matrix 130 rows 77 cols
[2023-04-07 00:26:52] [INFO ] Computed 12 invariants in 1 ms
[2023-04-07 00:26:52] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-04-07 00:26:52] [INFO ] Invariant cache hit.
[2023-04-07 00:26:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 00:26:52] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/136 places, 130/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 318 ms. Remains : 77/136 places, 130/292 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s18 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 57 reset in 85 ms.
Product exploration explored 100000 steps with 56 reset in 97 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2115 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=235 )
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 99 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2023-04-07 00:26:53] [INFO ] Invariant cache hit.
[2023-04-07 00:26:53] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-04-07 00:26:53] [INFO ] Invariant cache hit.
[2023-04-07 00:26:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 00:26:53] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-04-07 00:26:53] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 00:26:53] [INFO ] Invariant cache hit.
[2023-04-07 00:26:53] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 77/77 places, 130/130 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 75 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 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3319 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=331 )
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 93 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 54 reset in 94 ms.
Product exploration explored 100000 steps with 62 reset in 116 ms.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 130/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2023-04-07 00:26:54] [INFO ] Invariant cache hit.
[2023-04-07 00:26:54] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-04-07 00:26:54] [INFO ] Invariant cache hit.
[2023-04-07 00:26:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 00:26:54] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-04-07 00:26:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 00:26:54] [INFO ] Invariant cache hit.
[2023-04-07 00:26:54] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 77/77 places, 130/130 transitions.
Treatment of property Anderson-PT-05-LTLFireability-15 finished in 2331 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)))'
[2023-04-07 00:26:54] [INFO ] Flatten gal took : 20 ms
[2023-04-07 00:26:54] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 00:26:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 136 places, 292 transitions and 1126 arcs took 2 ms.
Total runtime 10294 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Anderson-PT-05
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA Anderson-PT-05-LTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680827216836

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Anderson-PT-05-LTLFireability-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Anderson-PT-05-LTLFireability-15
lola: result : true
lola: markings : 73411
lola: fired transitions : 214886
lola: time used : 1.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-05-LTLFireability-15: LTL true LTL model checker


Time elapsed: 1 secs. Pages in use: 1

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="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
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 r519-tall-167987244700012"
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 ;