fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r327-tall-167889199500372
Last Updated
May 14, 2023

About the Execution of LoLa+red for Railroad-PT-010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
464.283 19234.00 31012.00 510.60 FTFFFTFFFTFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 9.0K Feb 25 22:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 22:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 22:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 22:25 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.2K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 22:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 22:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 22:27 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 82K 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-010-LTLFireability-00
FORMULA_NAME Railroad-PT-010-LTLFireability-01
FORMULA_NAME Railroad-PT-010-LTLFireability-02
FORMULA_NAME Railroad-PT-010-LTLFireability-03
FORMULA_NAME Railroad-PT-010-LTLFireability-04
FORMULA_NAME Railroad-PT-010-LTLFireability-05
FORMULA_NAME Railroad-PT-010-LTLFireability-06
FORMULA_NAME Railroad-PT-010-LTLFireability-07
FORMULA_NAME Railroad-PT-010-LTLFireability-08
FORMULA_NAME Railroad-PT-010-LTLFireability-09
FORMULA_NAME Railroad-PT-010-LTLFireability-10
FORMULA_NAME Railroad-PT-010-LTLFireability-11
FORMULA_NAME Railroad-PT-010-LTLFireability-12
FORMULA_NAME Railroad-PT-010-LTLFireability-13
FORMULA_NAME Railroad-PT-010-LTLFireability-14
FORMULA_NAME Railroad-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679044709046

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-010
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 09:18:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 09:18:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 09:18:30] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-17 09:18:30] [INFO ] Transformed 118 places.
[2023-03-17 09:18:30] [INFO ] Transformed 156 transitions.
[2023-03-17 09:18:30] [INFO ] Found NUPN structural information;
[2023-03-17 09:18:30] [INFO ] Parsed PT model containing 118 places and 156 transitions and 898 arcs in 103 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 3 formulas.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 10 transitions.
FORMULA Railroad-PT-010-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 146/146 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 78 transition count 146
Applied a total of 9 rules in 18 ms. Remains 78 /87 variables (removed 9) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 78 cols
[2023-03-17 09:18:30] [INFO ] Computed 32 place invariants in 22 ms
[2023-03-17 09:18:31] [INFO ] Implicit Places using invariants in 405 ms returned [34, 35, 38, 44, 45, 46, 59, 63, 67, 70]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 429 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/87 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 449 ms. Remains : 68/87 places, 146/146 transitions.
Support contains 34 out of 68 places after structural reductions.
[2023-03-17 09:18:31] [INFO ] Flatten gal took : 38 ms
[2023-03-17 09:18:31] [INFO ] Flatten gal took : 17 ms
[2023-03-17 09:18:31] [INFO ] Input system was already deterministic with 146 transitions.
Finished random walk after 4829 steps, including 1 resets, run visited all 21 properties in 176 ms. (steps per millisecond=27 )
FORMULA Railroad-PT-010-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Railroad-PT-010-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(((F(G(F((F(p1)&&p0))))&&X(p2)) U p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 146/146 transitions.
Ensure Unique test removed 3 places
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 65 transition count 140
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 59 transition count 140
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 56 transition count 137
Applied a total of 18 rules in 29 ms. Remains 56 /68 variables (removed 12) and now considering 137/146 (removed 9) transitions.
// Phase 1: matrix 137 rows 56 cols
[2023-03-17 09:18:31] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-17 09:18:31] [INFO ] Implicit Places using invariants in 73 ms returned [27, 29, 41, 55]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 74 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/68 places, 137/146 transitions.
Applied a total of 0 rules in 9 ms. Remains 52 /52 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 52/68 places, 137/146 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s14 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1032 reset in 374 ms.
Stack based approach found an accepted trace after 420 steps with 6 reset with depth 41 and stack size 41 in 2 ms.
FORMULA Railroad-PT-010-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-00 finished in 707 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)||F((p1&&X(F(p0))))))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 65 transition count 146
Applied a total of 3 rules in 2 ms. Remains 65 /68 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 65 cols
[2023-03-17 09:18:32] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-17 09:18:32] [INFO ] Implicit Places using invariants in 74 ms returned [33, 35, 47, 62]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 75 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/68 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 61/68 places, 146/146 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s32 0) (EQ s57 0)), p1:(OR (EQ s10 0) (EQ s15 0) (EQ s35 0))], 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 50000 reset in 213 ms.
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 9 factoid took 154 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-010-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-010-LTLFireability-01 finished in 884 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 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 146/146 transitions.
Ensure Unique test removed 3 places
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 65 transition count 140
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 59 transition count 140
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 55 transition count 136
Applied a total of 20 rules in 18 ms. Remains 55 /68 variables (removed 13) and now considering 136/146 (removed 10) transitions.
// Phase 1: matrix 136 rows 55 cols
[2023-03-17 09:18:33] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-17 09:18:33] [INFO ] Implicit Places using invariants in 66 ms returned [26, 27, 29, 41, 54]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 68 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/68 places, 136/146 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 50 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 49 transition count 135
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 49 transition count 133
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 47 transition count 133
Applied a total of 6 rules in 9 ms. Remains 47 /50 variables (removed 3) and now considering 133/136 (removed 3) transitions.
// Phase 1: matrix 133 rows 47 cols
[2023-03-17 09:18:33] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 09:18:33] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-17 09:18:33] [INFO ] Invariant cache hit.
[2023-03-17 09:18:33] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/68 places, 133/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 47/68 places, 133/146 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s12 1) (EQ s28 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 107 reset in 207 ms.
Stack based approach found an accepted trace after 353 steps with 0 reset with depth 354 and stack size 354 in 1 ms.
FORMULA Railroad-PT-010-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-02 finished in 485 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 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 146/146 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 65 transition count 145
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2 place count 65 transition count 138
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 58 transition count 138
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 54 transition count 134
Applied a total of 24 rules in 15 ms. Remains 54 /68 variables (removed 14) and now considering 134/146 (removed 12) transitions.
// Phase 1: matrix 134 rows 54 cols
[2023-03-17 09:18:33] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-17 09:18:33] [INFO ] Implicit Places using invariants in 71 ms returned [25, 26, 28, 38, 53]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 73 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/68 places, 134/146 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 48 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7 place count 45 transition count 131
Applied a total of 7 rules in 6 ms. Remains 45 /49 variables (removed 4) and now considering 131/134 (removed 3) transitions.
// Phase 1: matrix 131 rows 45 cols
[2023-03-17 09:18:34] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-17 09:18:34] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-17 09:18:34] [INFO ] Invariant cache hit.
[2023-03-17 09:18:34] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/68 places, 131/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 223 ms. Remains : 45/68 places, 131/146 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s39 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2101 reset in 201 ms.
Stack based approach found an accepted trace after 11452 steps with 231 reset with depth 42 and stack size 42 in 22 ms.
FORMULA Railroad-PT-010-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-06 finished in 526 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 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 146/146 transitions.
Ensure Unique test removed 2 places
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 66 transition count 140
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 60 transition count 140
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 56 transition count 136
Applied a total of 20 rules in 20 ms. Remains 56 /68 variables (removed 12) and now considering 136/146 (removed 10) transitions.
// Phase 1: matrix 136 rows 56 cols
[2023-03-17 09:18:34] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-17 09:18:34] [INFO ] Implicit Places using invariants in 61 ms returned [27, 28, 30, 41]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 62 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/68 places, 136/146 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 135
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 51 transition count 134
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 4 place count 50 transition count 134
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 6 place count 49 transition count 133
Applied a total of 6 rules in 8 ms. Remains 49 /52 variables (removed 3) and now considering 133/136 (removed 3) transitions.
// Phase 1: matrix 133 rows 49 cols
[2023-03-17 09:18:34] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-17 09:18:34] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-17 09:18:34] [INFO ] Invariant cache hit.
[2023-03-17 09:18:34] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/68 places, 133/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 238 ms. Remains : 49/68 places, 133/146 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s1 1) (EQ s46 1)) (AND (EQ s25 1) (EQ s45 1) (EQ s47 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 13129 reset in 233 ms.
Stack based approach found an accepted trace after 600 steps with 77 reset with depth 30 and stack size 30 in 2 ms.
FORMULA Railroad-PT-010-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-08 finished in 550 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((G(p1)||p0))))'
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 146/146 transitions.
Ensure Unique test removed 3 places
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 65 transition count 139
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 58 transition count 139
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 56 transition count 137
Applied a total of 18 rules in 13 ms. Remains 56 /68 variables (removed 12) and now considering 137/146 (removed 9) transitions.
// Phase 1: matrix 137 rows 56 cols
[2023-03-17 09:18:35] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-17 09:18:35] [INFO ] Implicit Places using invariants in 67 ms returned [25, 26, 28, 54]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 68 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/68 places, 137/146 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 136
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 51 transition count 134
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 49 transition count 134
Applied a total of 6 rules in 6 ms. Remains 49 /52 variables (removed 3) and now considering 134/137 (removed 3) transitions.
// Phase 1: matrix 134 rows 49 cols
[2023-03-17 09:18:35] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-17 09:18:35] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-17 09:18:35] [INFO ] Invariant cache hit.
[2023-03-17 09:18:35] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/68 places, 134/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 49/68 places, 134/146 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Railroad-PT-010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s14 1) (EQ s27 1)), p0:(OR (EQ s18 0) (EQ s35 0) (EQ s46 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13869 reset in 234 ms.
Product exploration explored 100000 steps with 13818 reset in 283 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 316 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=105 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-17 09:18:36] [INFO ] Invariant cache hit.
[2023-03-17 09:18:36] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-17 09:18:36] [INFO ] [Real]Absence check using 13 positive and 2 generalized place invariants in 15 ms returned sat
[2023-03-17 09:18:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:18:36] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-17 09:18:36] [INFO ] Computed and/alt/rep : 23/33/23 causal constraints (skipped 101 transitions) in 9 ms.
[2023-03-17 09:18:36] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2023-03-17 09:18:36] [INFO ] Invariant cache hit.
[2023-03-17 09:18:36] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-17 09:18:36] [INFO ] Invariant cache hit.
[2023-03-17 09:18:36] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-17 09:18:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 09:18:36] [INFO ] Invariant cache hit.
[2023-03-17 09:18:36] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 49/49 places, 134/134 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 143 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 249 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-17 09:18:37] [INFO ] Invariant cache hit.
[2023-03-17 09:18:37] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-17 09:18:37] [INFO ] [Real]Absence check using 13 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-17 09:18:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:18:37] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-17 09:18:37] [INFO ] Computed and/alt/rep : 23/33/23 causal constraints (skipped 101 transitions) in 10 ms.
[2023-03-17 09:18:37] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13636 reset in 231 ms.
Product exploration explored 100000 steps with 13277 reset in 220 ms.
Support contains 6 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2023-03-17 09:18:38] [INFO ] Invariant cache hit.
[2023-03-17 09:18:38] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-17 09:18:38] [INFO ] Invariant cache hit.
[2023-03-17 09:18:38] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-17 09:18:38] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-17 09:18:38] [INFO ] Invariant cache hit.
[2023-03-17 09:18:38] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 49/49 places, 134/134 transitions.
Treatment of property Railroad-PT-010-LTLFireability-09 finished in 3497 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' '!((!p0 U X(G(!p0))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 65 transition count 146
Applied a total of 3 rules in 2 ms. Remains 65 /68 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 65 cols
[2023-03-17 09:18:38] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-17 09:18:38] [INFO ] Implicit Places using invariants in 50 ms returned [32, 33, 35, 47, 62]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 51 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/68 places, 146/146 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 60/68 places, 146/146 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, p0, p0]
Running random walk in product with property : Railroad-PT-010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(AND (EQ s5 1) (EQ s21 1) (EQ s34 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 9798 steps with 0 reset in 23 ms.
FORMULA Railroad-PT-010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-10 finished in 153 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)||(!p0&&F((p1||X(X(p2)))))))'
Support contains 7 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 146/146 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 146
Applied a total of 2 rules in 4 ms. Remains 66 /68 variables (removed 2) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 66 cols
[2023-03-17 09:18:38] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-17 09:18:38] [INFO ] Implicit Places using invariants in 70 ms returned [32, 33, 35, 47, 63]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 71 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/68 places, 146/146 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 61/68 places, 146/146 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p1) (NOT p2)), p0, (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s49 1) (EQ s52 1)), p2:(AND (EQ s8 1) (EQ s21 1) (EQ s34 1)), p0:(AND (EQ s11 1) (EQ s19 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2804 reset in 213 ms.
Product exploration explored 100000 steps with 2841 reset in 213 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Finished random walk after 706 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=100 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 321 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Support contains 7 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 61 cols
[2023-03-17 09:18:40] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-17 09:18:40] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-17 09:18:40] [INFO ] Invariant cache hit.
[2023-03-17 09:18:40] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-17 09:18:40] [INFO ] Invariant cache hit.
[2023-03-17 09:18:40] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 61/61 places, 146/146 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 2756 reset in 213 ms.
Product exploration explored 100000 steps with 2763 reset in 235 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Support contains 7 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 146/146 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 61 transition count 146
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 61 transition count 146
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 59 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 59 transition count 144
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 59 transition count 144
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 15 rules in 19 ms. Remains 59 /61 variables (removed 2) and now considering 144/146 (removed 2) transitions.
[2023-03-17 09:18:42] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 144 rows 59 cols
[2023-03-17 09:18:42] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-17 09:18:42] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/61 places, 144/146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 59/61 places, 144/146 transitions.
Support contains 7 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 146/146 transitions.
Applied a total of 0 rules in 0 ms. Remains 61 /61 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 61 cols
[2023-03-17 09:18:42] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-17 09:18:42] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-17 09:18:42] [INFO ] Invariant cache hit.
[2023-03-17 09:18:42] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-17 09:18:42] [INFO ] Invariant cache hit.
[2023-03-17 09:18:42] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 61/61 places, 146/146 transitions.
Treatment of property Railroad-PT-010-LTLFireability-11 finished in 4060 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 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 65 transition count 146
Applied a total of 3 rules in 1 ms. Remains 65 /68 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 65 cols
[2023-03-17 09:18:42] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-17 09:18:42] [INFO ] Implicit Places using invariants in 85 ms returned [32, 33, 35, 47, 62]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 95 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/68 places, 146/146 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 60/68 places, 146/146 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-13 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 s2 1) (EQ s17 1) (EQ s34 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-010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-13 finished in 211 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) U (F(p1) U p2)))'
Support contains 7 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 146/146 transitions.
Ensure Unique test removed 3 places
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 65 transition count 140
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 59 transition count 140
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 56 transition count 137
Applied a total of 18 rules in 5 ms. Remains 56 /68 variables (removed 12) and now considering 137/146 (removed 9) transitions.
// Phase 1: matrix 137 rows 56 cols
[2023-03-17 09:18:42] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-17 09:18:42] [INFO ] Implicit Places using invariants in 48 ms returned [26, 27, 41, 54]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 48 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/68 places, 137/146 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 136
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 51 transition count 134
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 49 transition count 134
Applied a total of 6 rules in 5 ms. Remains 49 /52 variables (removed 3) and now considering 134/137 (removed 3) transitions.
// Phase 1: matrix 134 rows 49 cols
[2023-03-17 09:18:42] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-17 09:18:43] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-17 09:18:43] [INFO ] Invariant cache hit.
[2023-03-17 09:18:43] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/68 places, 134/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 187 ms. Remains : 49/68 places, 134/146 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Railroad-PT-010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s5 1) (EQ s12 1) (EQ s29 1)), p1:(AND (EQ s18 1) (EQ s27 1) (EQ s46 1)), p0:(AND (EQ s33 1) (EQ s46 1))], nbAcceptance=0, 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 14973 reset in 260 ms.
Stack based approach found an accepted trace after 2000 steps with 318 reset with depth 22 and stack size 22 in 5 ms.
FORMULA Railroad-PT-010-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-15 finished in 560 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((G(p1)||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' '!((G(!p0)||(!p0&&F((p1||X(X(p2)))))))'
Found a Shortening insensitive property : Railroad-PT-010-LTLFireability-11
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p1) (NOT p2)), p0, (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Support contains 7 out of 68 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 68/68 places, 146/146 transitions.
Ensure Unique test removed 2 places
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 66 transition count 141
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 61 transition count 141
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 58 transition count 138
Applied a total of 16 rules in 9 ms. Remains 58 /68 variables (removed 10) and now considering 138/146 (removed 8) transitions.
// Phase 1: matrix 138 rows 58 cols
[2023-03-17 09:18:43] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-17 09:18:43] [INFO ] Implicit Places using invariants in 57 ms returned [27, 28, 30, 42, 57]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 58 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 53/68 places, 138/146 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 53 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 52 transition count 137
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 52 transition count 135
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 50 transition count 135
Applied a total of 6 rules in 3 ms. Remains 50 /53 variables (removed 3) and now considering 135/138 (removed 3) transitions.
// Phase 1: matrix 135 rows 50 cols
[2023-03-17 09:18:43] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-17 09:18:43] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-17 09:18:43] [INFO ] Invariant cache hit.
[2023-03-17 09:18:43] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 50/68 places, 135/146 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 184 ms. Remains : 50/68 places, 135/146 transitions.
Running random walk in product with property : Railroad-PT-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s41 1) (EQ s44 1)), p2:(AND (EQ s8 1) (EQ s16 1) (EQ s29 1)), p0:(AND (EQ s11 1) (EQ s14 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3130 reset in 232 ms.
Stack based approach found an accepted trace after 13130 steps with 416 reset with depth 43 and stack size 43 in 34 ms.
Treatment of property Railroad-PT-010-LTLFireability-11 finished in 693 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-17 09:18:44] [INFO ] Flatten gal took : 17 ms
[2023-03-17 09:18:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-17 09:18:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 146 transitions and 790 arcs took 3 ms.
Total runtime 13841 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Railroad-PT-010
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/364
LTLFireability

FORMULA Railroad-PT-010-LTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Railroad-PT-010-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679044728280

--------------------
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/364/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/364/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/364/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-010-LTLFireability-09
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Railroad-PT-010-LTLFireability-09
lola: result : true
lola: markings : 363661
lola: fired transitions : 2801398
lola: time used : 3.000000
lola: memory pages used : 3
lola: LAUNCH task # 4 (type EXCL) for 3 Railroad-PT-010-LTLFireability-11
lola: time limit : 3597 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for Railroad-PT-010-LTLFireability-11
lola: result : false
lola: markings : 52836
lola: fired transitions : 115570
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Railroad-PT-010-LTLFireability-09: LTL true LTL model checker
Railroad-PT-010-LTLFireability-11: LTL false LTL model checker


Time elapsed: 3 secs. Pages in use: 3

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-010"
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-010, 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-167889199500372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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