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.r327-tall-167889199500380.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 Railroad-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199500380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 8.7K Feb 25 22:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 22:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 22:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 22:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 22:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 25 22:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 255K Mar 5 18:23 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 Railroad-PT-020-LTLFireability-00
FORMULA_NAME Railroad-PT-020-LTLFireability-01
FORMULA_NAME Railroad-PT-020-LTLFireability-02
FORMULA_NAME Railroad-PT-020-LTLFireability-03
FORMULA_NAME Railroad-PT-020-LTLFireability-04
FORMULA_NAME Railroad-PT-020-LTLFireability-05
FORMULA_NAME Railroad-PT-020-LTLFireability-06
FORMULA_NAME Railroad-PT-020-LTLFireability-07
FORMULA_NAME Railroad-PT-020-LTLFireability-08
FORMULA_NAME Railroad-PT-020-LTLFireability-09
FORMULA_NAME Railroad-PT-020-LTLFireability-10
FORMULA_NAME Railroad-PT-020-LTLFireability-11
FORMULA_NAME Railroad-PT-020-LTLFireability-12
FORMULA_NAME Railroad-PT-020-LTLFireability-13
FORMULA_NAME Railroad-PT-020-LTLFireability-14
FORMULA_NAME Railroad-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679044845747

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=Railroad-PT-020
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 09:20:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 09:20:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 09:20:47] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-17 09:20:47] [INFO ] Transformed 218 places.
[2023-03-17 09:20:47] [INFO ] Transformed 506 transitions.
[2023-03-17 09:20:47] [INFO ] Found NUPN structural information;
[2023-03-17 09:20:47] [INFO ] Parsed PT model containing 218 places and 506 transitions and 2968 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 20 transitions.
FORMULA Railroad-PT-020-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 486/486 transitions.
Ensure Unique test removed 19 places
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 138 transition count 486
Applied a total of 19 rules in 20 ms. Remains 138 /157 variables (removed 19) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 138 cols
[2023-03-17 09:20:47] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-17 09:20:47] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 486 rows 138 cols
[2023-03-17 09:20:47] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-17 09:20:48] [INFO ] Implicit Places using invariants and state equation in 382 ms returned [0, 1, 6, 9, 11, 15, 17, 39, 60, 62, 63, 66, 74, 75, 79, 82, 108, 113, 117, 123, 127, 131, 136]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 608 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/157 places, 486/486 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 632 ms. Remains : 115/157 places, 486/486 transitions.
Support contains 42 out of 115 places after structural reductions.
[2023-03-17 09:20:48] [INFO ] Flatten gal took : 68 ms
[2023-03-17 09:20:48] [INFO ] Flatten gal took : 37 ms
[2023-03-17 09:20:48] [INFO ] Input system was already deterministic with 486 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 32) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 486 rows 115 cols
[2023-03-17 09:20:49] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:20:49] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-17 09:20:49] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-17 09:20:49] [INFO ] After 310ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-17 09:20:50] [INFO ] After 507ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Parikh walk visited 5 properties in 8 ms.
FORMULA Railroad-PT-020-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 110 transition count 464
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 45 place count 89 transition count 464
Applied a total of 45 rules in 71 ms. Remains 89 /115 variables (removed 26) and now considering 464/486 (removed 22) transitions.
// Phase 1: matrix 464 rows 89 cols
[2023-03-17 09:20:50] [INFO ] Computed 25 place invariants in 7 ms
[2023-03-17 09:20:50] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-17 09:20:50] [INFO ] Invariant cache hit.
[2023-03-17 09:20:50] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-17 09:20:50] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-17 09:20:50] [INFO ] Invariant cache hit.
[2023-03-17 09:20:51] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/115 places, 464/486 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 723 ms. Remains : 89/115 places, 464/486 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-00 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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s28 1) (EQ s32 1) (EQ s36 1)), p1:(AND (EQ s1 1) (EQ s52 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 91 reset in 571 ms.
Stack based approach found an accepted trace after 88 steps with 0 reset with depth 89 and stack size 89 in 1 ms.
FORMULA Railroad-PT-020-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-00 finished in 1555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X((!p1||G(p2))))) U X(p0)))'
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 486
Applied a total of 3 rules in 10 ms. Remains 112 /115 variables (removed 3) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2023-03-17 09:20:51] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-17 09:20:52] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 486 rows 112 cols
[2023-03-17 09:20:52] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:20:52] [INFO ] Implicit Places using invariants and state equation in 292 ms returned [64, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 374 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 486/486 transitions.
Applied a total of 0 rules in 7 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 391 ms. Remains : 110/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (AND (NOT p2) (NOT p0) p1), (NOT p0), true, (NOT p2), (AND (NOT p2) p1), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 5}, { cond=(NOT p0), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s48 1) (EQ s56 1)), p1:(AND (EQ s24 1) (EQ s32 1) (EQ s56 1)), p2:(AND (EQ s5 1) (EQ s19 1) (EQ s56 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30928 reset in 301 ms.
Product exploration explored 100000 steps with 30789 reset in 323 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 344 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), true, (NOT p2), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 486 rows 110 cols
[2023-03-17 09:20:53] [INFO ] Computed 24 place invariants in 5 ms
[2023-03-17 09:20:54] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-17 09:20:54] [INFO ] [Real]Absence check using 22 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 09:20:54] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-17 09:20:54] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-17 09:20:54] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-17 09:20:54] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-17 09:20:54] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-17 09:20:54] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 7 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 486/486 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 108 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 108 transition count 464
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 44 place count 88 transition count 464
Applied a total of 44 rules in 40 ms. Remains 88 /110 variables (removed 22) and now considering 464/486 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 88/110 places, 464/486 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 626799 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 626799 steps, saw 422134 distinct states, run finished after 3002 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 464 rows 88 cols
[2023-03-17 09:20:57] [INFO ] Computed 24 place invariants in 8 ms
[2023-03-17 09:20:57] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-17 09:20:57] [INFO ] [Real]Absence check using 22 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-17 09:20:57] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 09:20:57] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-17 09:20:57] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 09:20:57] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 09:20:57] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-17 09:20:57] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 7 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 18 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 88/88 places, 464/464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 18 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2023-03-17 09:20:58] [INFO ] Invariant cache hit.
[2023-03-17 09:20:58] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-17 09:20:58] [INFO ] Invariant cache hit.
[2023-03-17 09:20:58] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2023-03-17 09:20:58] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-17 09:20:58] [INFO ] Invariant cache hit.
[2023-03-17 09:20:58] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 611 ms. Remains : 88/88 places, 464/464 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 88 transition count 444
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 68 transition count 444
Applied a total of 40 rules in 17 ms. Remains 68 /88 variables (removed 20) and now considering 444/464 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 444 rows 68 cols
[2023-03-17 09:20:58] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-17 09:20:58] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 09:20:58] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 09:20:58] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-17 09:20:58] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 10 factoid took 429 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), true, p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), true, p1, (AND (NOT p0) p1)]
// Phase 1: matrix 486 rows 110 cols
[2023-03-17 09:20:59] [INFO ] Computed 24 place invariants in 8 ms
[2023-03-17 09:20:59] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-17 09:20:59] [INFO ] [Real]Absence check using 22 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-17 09:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:20:59] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2023-03-17 09:21:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 09:21:00] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-17 09:21:00] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-17 09:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 09:21:00] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-17 09:21:00] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2023-03-17 09:21:00] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2023-03-17 09:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 129 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(F p2), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 10 factoid took 135 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-020-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-020-LTLFireability-01 finished in 8585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 486
Applied a total of 3 rules in 7 ms. Remains 112 /115 variables (removed 3) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2023-03-17 09:21:00] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:00] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 486 rows 112 cols
[2023-03-17 09:21:00] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:01] [INFO ] Implicit Places using invariants and state equation in 424 ms returned [64, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 503 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 486/486 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 513 ms. Remains : 110/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-02 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 s13 1) (EQ s50 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-020-LTLFireability-02 finished in 590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 486
Applied a total of 3 rules in 31 ms. Remains 112 /115 variables (removed 3) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2023-03-17 09:21:01] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-17 09:21:01] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 486 rows 112 cols
[2023-03-17 09:21:01] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:01] [INFO ] Implicit Places using invariants and state equation in 400 ms returned [64, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 481 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 486/486 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 516 ms. Remains : 110/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-04 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 s17 1) (EQ s40 1) (EQ s56 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 98 reset in 320 ms.
Stack based approach found an accepted trace after 45151 steps with 48 reset with depth 59 and stack size 59 in 153 ms.
FORMULA Railroad-PT-020-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-04 finished in 1108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 110 transition count 464
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 45 place count 89 transition count 464
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 2 with 2 rules applied. Total rules applied 47 place count 88 transition count 463
Applied a total of 47 rules in 29 ms. Remains 88 /115 variables (removed 27) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 88 cols
[2023-03-17 09:21:02] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-17 09:21:02] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2023-03-17 09:21:02] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:02] [INFO ] Implicit Places using invariants and state equation in 214 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 300 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/115 places, 463/486 transitions.
Applied a total of 0 rules in 20 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 350 ms. Remains : 87/115 places, 463/486 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s32 1) (EQ s36 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 456 reset in 356 ms.
Stack based approach found an accepted trace after 5606 steps with 23 reset with depth 155 and stack size 155 in 20 ms.
FORMULA Railroad-PT-020-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-05 finished in 781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 110 transition count 464
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 45 place count 89 transition count 464
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 2 with 2 rules applied. Total rules applied 47 place count 88 transition count 463
Applied a total of 47 rules in 34 ms. Remains 88 /115 variables (removed 27) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 88 cols
[2023-03-17 09:21:03] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-17 09:21:03] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2023-03-17 09:21:03] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:03] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 260 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/115 places, 463/486 transitions.
Applied a total of 0 rules in 20 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 314 ms. Remains : 87/115 places, 463/486 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s32 1) (EQ s36 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 402 reset in 353 ms.
Stack based approach found an accepted trace after 162 steps with 1 reset with depth 11 and stack size 11 in 1 ms.
FORMULA Railroad-PT-020-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-06 finished in 729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(X(F(p1))||((p1||G(p3))&&p2))))))'
Support contains 9 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 486
Applied a total of 2 rules in 2 ms. Remains 113 /115 variables (removed 2) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 113 cols
[2023-03-17 09:21:03] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-17 09:21:03] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 486 rows 113 cols
[2023-03-17 09:21:03] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-17 09:21:04] [INFO ] Implicit Places using invariants and state equation in 393 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 471 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/115 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 474 ms. Remains : 112/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p2) (AND (NOT p1) (NOT p3))), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s64 1) (EQ s67 1)), p2:(AND (EQ s11 1) (EQ s49 1) (EQ s56 1)), p1:(AND (EQ s65 1) (EQ s92 1)), p3:(AND (EQ s20 1) (EQ s37 1) (EQ s56 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2105 reset in 301 ms.
Stack based approach found an accepted trace after 21631 steps with 488 reset with depth 108 and stack size 108 in 70 ms.
FORMULA Railroad-PT-020-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-07 finished in 1155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 110 transition count 464
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 45 place count 89 transition count 464
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 2 with 2 rules applied. Total rules applied 47 place count 88 transition count 463
Applied a total of 47 rules in 33 ms. Remains 88 /115 variables (removed 27) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 88 cols
[2023-03-17 09:21:04] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-17 09:21:04] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2023-03-17 09:21:04] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:05] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 288 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/115 places, 463/486 transitions.
Applied a total of 0 rules in 19 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 342 ms. Remains : 87/115 places, 463/486 transitions.
Stuttering acceptance computed with spot in 55 ms :[p0, p0]
Running random walk in product with property : Railroad-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s32 1) (EQ s36 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 0 reset in 357 ms.
Product exploration explored 100000 steps with 0 reset in 393 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 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 64 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1499041 steps, run timeout after 3001 ms. (steps per millisecond=499 ) properties seen :{}
Probabilistic random walk after 1499041 steps, saw 941818 distinct states, run finished after 3002 ms. (steps per millisecond=499 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 87 cols
[2023-03-17 09:21:09] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-17 09:21:09] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:21:09] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:21:09] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-17 09:21:09] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 20 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 87/87 places, 463/463 transitions.
Finished random walk after 2343 steps, including 0 resets, run visited all 1 properties in 30 ms. (steps per millisecond=78 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 122 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 66 ms :[p0, p0]
Stuttering acceptance computed with spot in 57 ms :[p0, p0]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 20 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 87 cols
[2023-03-17 09:21:09] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-17 09:21:09] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-17 09:21:09] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:10] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-17 09:21:10] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-17 09:21:10] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:10] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 463 ms. Remains : 87/87 places, 463/463 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 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 55 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1502990 steps, run timeout after 3001 ms. (steps per millisecond=500 ) properties seen :{}
Probabilistic random walk after 1502990 steps, saw 943961 distinct states, run finished after 3001 ms. (steps per millisecond=500 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 87 cols
[2023-03-17 09:21:13] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-17 09:21:13] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:21:13] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:21:13] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-17 09:21:13] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 19 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 87/87 places, 463/463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1507798 steps, run timeout after 3001 ms. (steps per millisecond=502 ) properties seen :{}
Probabilistic random walk after 1507798 steps, saw 946744 distinct states, run finished after 3001 ms. (steps per millisecond=502 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 87 cols
[2023-03-17 09:21:16] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-17 09:21:16] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:21:17] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:21:17] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-17 09:21:17] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 21 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 87/87 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 18 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 87 cols
[2023-03-17 09:21:17] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-17 09:21:17] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-17 09:21:17] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:17] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-17 09:21:17] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-17 09:21:17] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:17] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 454 ms. Remains : 87/87 places, 463/463 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 87 transition count 443
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 67 transition count 443
Applied a total of 40 rules in 14 ms. Remains 67 /87 variables (removed 20) and now considering 443/463 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 443 rows 67 cols
[2023-03-17 09:21:17] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:17] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:21:17] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:21:17] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-17 09:21:17] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 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 61 ms :[p0, p0]
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Product exploration explored 100000 steps with 0 reset in 369 ms.
Product exploration explored 100000 steps with 0 reset in 446 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 21 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 87 cols
[2023-03-17 09:21:19] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-17 09:21:19] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-17 09:21:19] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-17 09:21:19] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-17 09:21:19] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-17 09:21:19] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:19] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 448 ms. Remains : 87/87 places, 463/463 transitions.
Treatment of property Railroad-PT-020-LTLFireability-09 finished in 14693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(((p1 U X(p2))&&p0))||G(p3))))'
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 486
Applied a total of 3 rules in 2 ms. Remains 112 /115 variables (removed 3) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2023-03-17 09:21:19] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:19] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 486 rows 112 cols
[2023-03-17 09:21:19] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-17 09:21:19] [INFO ] Implicit Places using invariants and state equation in 292 ms returned [64, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 407 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 410 ms. Remains : 110/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=1 dest: 2}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p3 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p3 p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s1 1) (EQ s4 1)), p0:(AND (EQ s1 1) (EQ s4 1)), p1:(AND (EQ s22 1) (EQ s45 1) (EQ s56 1)), p2:(AND (EQ s24 1) (EQ s49 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 345 ms.
Stack based approach found an accepted trace after 16021 steps with 0 reset with depth 16022 and stack size 16022 in 59 ms.
FORMULA Railroad-PT-020-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-10 finished in 1006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 110 transition count 464
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 45 place count 89 transition count 464
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 2 with 2 rules applied. Total rules applied 47 place count 88 transition count 463
Applied a total of 47 rules in 29 ms. Remains 88 /115 variables (removed 27) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 88 cols
[2023-03-17 09:21:20] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-17 09:21:20] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2023-03-17 09:21:20] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:20] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 285 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/115 places, 463/486 transitions.
Applied a total of 0 rules in 18 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 334 ms. Remains : 87/115 places, 463/486 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s32 1) (EQ s36 1)), p1:(OR (EQ s16 0) (EQ s32 0) (EQ s36 0))], nbAcceptance=2, 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 389 ms.
Stack based approach found an accepted trace after 9842 steps with 0 reset with depth 9843 and stack size 9829 in 38 ms.
FORMULA Railroad-PT-020-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-11 finished in 815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (X((G((p2 U p0)) U p3))&&p1)))'
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 486
Applied a total of 2 rules in 1 ms. Remains 113 /115 variables (removed 2) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 113 cols
[2023-03-17 09:21:21] [INFO ] Computed 27 place invariants in 6 ms
[2023-03-17 09:21:21] [INFO ] Implicit Places using invariants in 147 ms returned [64, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 148 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 111/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3)) (AND (NOT p3) p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=3 dest: 4}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) (NOT p3) p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p2)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=5 dest: 6}, { cond=(OR (AND p1 p0) (AND p1 p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=7 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=7 dest: 4}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) (NOT p3) p2)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0} source=7 dest: 6}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p1 (NOT p3) p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s64 1) (EQ s89 1)), p0:(AND (EQ s23 1) (EQ s35 1) (EQ s56 1)), p3:(AND (EQ s28 1) (EQ s45 1) (EQ s56 1)), p2:(AND (EQ s64 1) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 284 ms.
Stack based approach found an accepted trace after 14659 steps with 0 reset with depth 14660 and stack size 14660 in 45 ms.
FORMULA Railroad-PT-020-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-12 finished in 1020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (F(G(!p1)) U p2)))'
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 4 place count 110 transition count 466
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 41 place count 91 transition count 466
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 90 transition count 465
Applied a total of 43 rules in 32 ms. Remains 90 /115 variables (removed 25) and now considering 465/486 (removed 21) transitions.
// Phase 1: matrix 465 rows 90 cols
[2023-03-17 09:21:22] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-17 09:21:22] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 465 rows 90 cols
[2023-03-17 09:21:22] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:22] [INFO ] Implicit Places using invariants and state equation in 235 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 308 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/115 places, 465/486 transitions.
Applied a total of 0 rules in 22 ms. Remains 89 /89 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 362 ms. Remains : 89/115 places, 465/486 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s30 1) (EQ s33 1) (EQ s38 1)), p1:(AND (EQ s27 1) (EQ s32 1) (EQ s38 1)), p0:(AND (EQ s30 1) (EQ s34 1) (EQ s38 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 11 reset in 339 ms.
Product exploration explored 100000 steps with 16 reset in 368 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 p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 357 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 4) seen :2
Finished Best-First random walk after 2578 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=286 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 540 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1)]
// Phase 1: matrix 465 rows 89 cols
[2023-03-17 09:21:25] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-17 09:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:21:25] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-17 09:21:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 09:21:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 09:21:25] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-17 09:21:25] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-03-17 09:21:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 81 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p0) p1)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 10 factoid took 189 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-020-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-020-LTLFireability-13 finished in 3526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 4 place count 110 transition count 465
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 43 place count 90 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 89 transition count 464
Applied a total of 45 rules in 33 ms. Remains 89 /115 variables (removed 26) and now considering 464/486 (removed 22) transitions.
// Phase 1: matrix 464 rows 89 cols
[2023-03-17 09:21:25] [INFO ] Computed 25 place invariants in 6 ms
[2023-03-17 09:21:26] [INFO ] Implicit Places using invariants in 132 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/115 places, 464/486 transitions.
Applied a total of 0 rules in 18 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 88/115 places, 464/486 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s24 0) (EQ s33 0) (EQ s37 0)), p1:(OR (EQ s14 0) (EQ s32 0) (EQ s37 0))], nbAcceptance=2, 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 372 ms.
Product exploration explored 100000 steps with 0 reset in 395 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 (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 393 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 464 rows 88 cols
[2023-03-17 09:21:27] [INFO ] Computed 24 place invariants in 7 ms
[2023-03-17 09:21:27] [INFO ] [Real]Absence check using 22 positive place invariants in 13 ms returned sat
[2023-03-17 09:21:27] [INFO ] [Real]Absence check using 22 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 09:21:27] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-17 09:21:27] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-17 09:21:27] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 09:21:27] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-17 09:21:27] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-17 09:21:27] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 19 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 88/88 places, 464/464 transitions.
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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1507552 steps, run timeout after 3001 ms. (steps per millisecond=502 ) properties seen :{}
Probabilistic random walk after 1507552 steps, saw 968951 distinct states, run finished after 3002 ms. (steps per millisecond=502 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 09:21:30] [INFO ] Invariant cache hit.
[2023-03-17 09:21:30] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:21:30] [INFO ] [Nat]Absence check using 22 positive place invariants in 2 ms returned sat
[2023-03-17 09:21:30] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 09:21:31] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:21:31] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-17 09:21:31] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 18 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 88/88 places, 464/464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 16 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2023-03-17 09:21:31] [INFO ] Invariant cache hit.
[2023-03-17 09:21:31] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-17 09:21:31] [INFO ] Invariant cache hit.
[2023-03-17 09:21:31] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-17 09:21:31] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 09:21:31] [INFO ] Invariant cache hit.
[2023-03-17 09:21:31] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 506 ms. Remains : 88/88 places, 464/464 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 88 transition count 444
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 68 transition count 444
Applied a total of 40 rules in 8 ms. Remains 68 /88 variables (removed 20) and now considering 444/464 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 444 rows 68 cols
[2023-03-17 09:21:31] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-17 09:21:31] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:21:31] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:21:31] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-17 09:21:31] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 460 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 24 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2023-03-17 09:21:32] [INFO ] Invariant cache hit.
[2023-03-17 09:21:32] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-17 09:21:32] [INFO ] Invariant cache hit.
[2023-03-17 09:21:32] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-17 09:21:32] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-17 09:21:32] [INFO ] Invariant cache hit.
[2023-03-17 09:21:32] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 531 ms. Remains : 88/88 places, 464/464 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 231 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 09:21:33] [INFO ] Invariant cache hit.
[2023-03-17 09:21:33] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned sat
[2023-03-17 09:21:33] [INFO ] [Real]Absence check using 22 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 09:21:33] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-17 09:21:33] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-17 09:21:33] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 09:21:33] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-17 09:21:33] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-17 09:21:33] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 21 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 88/88 places, 464/464 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1413753 steps, run timeout after 3001 ms. (steps per millisecond=471 ) properties seen :{}
Probabilistic random walk after 1413753 steps, saw 913424 distinct states, run finished after 3001 ms. (steps per millisecond=471 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 09:21:36] [INFO ] Invariant cache hit.
[2023-03-17 09:21:36] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:21:36] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-17 09:21:36] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-17 09:21:36] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:21:36] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-17 09:21:36] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 20 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 88/88 places, 464/464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 16 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2023-03-17 09:21:36] [INFO ] Invariant cache hit.
[2023-03-17 09:21:36] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-17 09:21:36] [INFO ] Invariant cache hit.
[2023-03-17 09:21:37] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-17 09:21:37] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-17 09:21:37] [INFO ] Invariant cache hit.
[2023-03-17 09:21:37] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 550 ms. Remains : 88/88 places, 464/464 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 88 transition count 444
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 68 transition count 444
Applied a total of 40 rules in 12 ms. Remains 68 /88 variables (removed 20) and now considering 444/464 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 444 rows 68 cols
[2023-03-17 09:21:37] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-17 09:21:37] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:21:37] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:21:37] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-17 09:21:37] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 396 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 394 ms.
Product exploration explored 100000 steps with 0 reset in 411 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 17 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2023-03-17 09:21:38] [INFO ] Invariant cache hit.
[2023-03-17 09:21:39] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-17 09:21:39] [INFO ] Invariant cache hit.
[2023-03-17 09:21:39] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-17 09:21:39] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-17 09:21:39] [INFO ] Invariant cache hit.
[2023-03-17 09:21:39] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 518 ms. Remains : 88/88 places, 464/464 transitions.
Treatment of property Railroad-PT-020-LTLFireability-14 finished in 13577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 486
Applied a total of 2 rules in 3 ms. Remains 113 /115 variables (removed 2) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 113 cols
[2023-03-17 09:21:39] [INFO ] Computed 27 place invariants in 3 ms
[2023-03-17 09:21:39] [INFO ] Implicit Places using invariants in 151 ms returned [65, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 152 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 111/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s23 0) (EQ s51 0) (EQ s57 0)), p0:(OR (EQ s2 0) (EQ s4 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 65171 steps with 0 reset in 226 ms.
FORMULA Railroad-PT-020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-020-LTLFireability-15 finished in 514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
[2023-03-17 09:21:40] [INFO ] Flatten gal took : 28 ms
[2023-03-17 09:21:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-17 09:21:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 115 places, 486 transitions and 2742 arcs took 4 ms.
Total runtime 53166 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Railroad-PT-020
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
LTLFireability

BK_STOP 1679044996409

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Railroad-PT-020-LTLFireability-09
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
Railroad-PT-020-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 4/32 Railroad-PT-020-LTLFireability-09 580696 m, 116139 m/sec, 1468003 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
Railroad-PT-020-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 8/32 Railroad-PT-020-LTLFireability-09 1114522 m, 106765 m/sec, 2910597 t fired, .

Time elapsed: 10 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
Railroad-PT-020-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1800 11/32 Railroad-PT-020-LTLFireability-09 1642137 m, 105523 m/sec, 4405650 t fired, .

Time elapsed: 15 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
Railroad-PT-020-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1800 15/32 Railroad-PT-020-LTLFireability-09 2163316 m, 104235 m/sec, 5857122 t fired, .

Time elapsed: 20 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
Railroad-PT-020-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1800 18/32 Railroad-PT-020-LTLFireability-09 2679900 m, 103316 m/sec, 7172330 t fired, .

Time elapsed: 25 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
Railroad-PT-020-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1800 21/32 Railroad-PT-020-LTLFireability-09 3180795 m, 100179 m/sec, 8626739 t fired, .

Time elapsed: 30 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
Railroad-PT-020-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1800 24/32 Railroad-PT-020-LTLFireability-09 3676795 m, 99200 m/sec, 10090305 t fired, .

Time elapsed: 35 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
Railroad-PT-020-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1800 28/32 Railroad-PT-020-LTLFireability-09 4186457 m, 101932 m/sec, 11617773 t fired, .

Time elapsed: 40 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
Railroad-PT-020-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/1800 31/32 Railroad-PT-020-LTLFireability-09 4672592 m, 97227 m/sec, 13053896 t fired, .

Time elapsed: 45 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for Railroad-PT-020-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Railroad-PT-020-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 Railroad-PT-020-LTLFireability-14
lola: time limit : 3550 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Railroad-PT-020-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3550 4/32 Railroad-PT-020-LTLFireability-14 601839 m, 120367 m/sec, 1479435 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Railroad-PT-020-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3550 8/32 Railroad-PT-020-LTLFireability-14 1158940 m, 111420 m/sec, 2956977 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Railroad-PT-020-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3550 12/32 Railroad-PT-020-LTLFireability-14 1723376 m, 112887 m/sec, 4357760 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Railroad-PT-020-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3550 15/32 Railroad-PT-020-LTLFireability-14 2268314 m, 108987 m/sec, 5775490 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Railroad-PT-020-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3550 19/32 Railroad-PT-020-LTLFireability-14 2779731 m, 102283 m/sec, 7177884 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Railroad-PT-020-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3550 22/32 Railroad-PT-020-LTLFireability-14 3324372 m, 108928 m/sec, 8711528 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Railroad-PT-020-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3550 26/32 Railroad-PT-020-LTLFireability-14 3882421 m, 111609 m/sec, 10211259 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Railroad-PT-020-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3550 30/32 Railroad-PT-020-LTLFireability-14 4443963 m, 112308 m/sec, 11570730 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for Railroad-PT-020-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Railroad-PT-020-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
Railroad-PT-020-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Railroad-PT-020-LTLFireability-09: LTL unknown AGGR
Railroad-PT-020-LTLFireability-14: LTL unknown AGGR


Time elapsed: 95 secs. Pages in use: 32

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="Railroad-PT-020"
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 Railroad-PT-020, 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 r327-tall-167889199500380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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