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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
397.728 9144.00 14781.00 360.20 FTFTFFFFFFFTFFFF 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-167889199500364.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-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199500364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.5K Feb 25 22:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 22:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 22:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 22:34 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.3K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 22:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 22:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 22:36 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 32K 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-005-LTLFireability-00
FORMULA_NAME Railroad-PT-005-LTLFireability-01
FORMULA_NAME Railroad-PT-005-LTLFireability-02
FORMULA_NAME Railroad-PT-005-LTLFireability-03
FORMULA_NAME Railroad-PT-005-LTLFireability-04
FORMULA_NAME Railroad-PT-005-LTLFireability-05
FORMULA_NAME Railroad-PT-005-LTLFireability-06
FORMULA_NAME Railroad-PT-005-LTLFireability-07
FORMULA_NAME Railroad-PT-005-LTLFireability-08
FORMULA_NAME Railroad-PT-005-LTLFireability-09
FORMULA_NAME Railroad-PT-005-LTLFireability-10
FORMULA_NAME Railroad-PT-005-LTLFireability-11
FORMULA_NAME Railroad-PT-005-LTLFireability-12
FORMULA_NAME Railroad-PT-005-LTLFireability-13
FORMULA_NAME Railroad-PT-005-LTLFireability-14
FORMULA_NAME Railroad-PT-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679044662132

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-005
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 09:17:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 09:17:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 09:17:43] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-17 09:17:43] [INFO ] Transformed 68 places.
[2023-03-17 09:17:43] [INFO ] Transformed 56 transitions.
[2023-03-17 09:17:43] [INFO ] Found NUPN structural information;
[2023-03-17 09:17:43] [INFO ] Parsed PT model containing 68 places and 56 transitions and 313 arcs in 92 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 5 transitions.
FORMULA Railroad-PT-005-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 51/51 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 46 transition count 51
Applied a total of 6 rules in 11 ms. Remains 46 /52 variables (removed 6) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 46 cols
[2023-03-17 09:17:43] [INFO ] Computed 20 place invariants in 8 ms
[2023-03-17 09:17:44] [INFO ] Implicit Places using invariants in 341 ms returned [15, 16, 21, 22, 31, 42]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 364 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/52 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 376 ms. Remains : 40/52 places, 51/51 transitions.
Support contains 25 out of 40 places after structural reductions.
[2023-03-17 09:17:44] [INFO ] Flatten gal took : 21 ms
[2023-03-17 09:17:44] [INFO ] Flatten gal took : 9 ms
[2023-03-17 09:17:44] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 40 cols
[2023-03-17 09:17:44] [INFO ] Computed 14 place invariants in 8 ms
[2023-03-17 09:17:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-17 09:17:44] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-17 09:17:44] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Railroad-PT-005-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(F(p1))&&p0)))'
Support contains 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 51/51 transitions.
Ensure Unique test removed 1 places
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 39 transition count 48
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 6 place count 36 transition count 48
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 34 transition count 46
Applied a total of 10 rules in 12 ms. Remains 34 /40 variables (removed 6) and now considering 46/51 (removed 5) transitions.
// Phase 1: matrix 46 rows 34 cols
[2023-03-17 09:17:44] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-17 09:17:44] [INFO ] Implicit Places using invariants in 65 ms returned [14, 15, 17, 31]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/40 places, 46/51 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 30 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 29 transition count 45
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 29 transition count 43
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 27 transition count 43
Applied a total of 6 rules in 4 ms. Remains 27 /30 variables (removed 3) and now considering 43/46 (removed 3) transitions.
// Phase 1: matrix 43 rows 27 cols
[2023-03-17 09:17:44] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-17 09:17:44] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-17 09:17:44] [INFO ] Invariant cache hit.
[2023-03-17 09:17:44] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/40 places, 43/51 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 27/40 places, 43/51 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Railroad-PT-005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s12 0) (EQ s17 0) (EQ s22 0) (AND (EQ s12 1) (EQ s15 1) (EQ s25 1))), p0:(AND (EQ s12 1) (EQ s17 1) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1529 reset in 280 ms.
Stack based approach found an accepted trace after 243 steps with 3 reset with depth 27 and stack size 27 in 1 ms.
FORMULA Railroad-PT-005-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-005-LTLFireability-00 finished in 750 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)))'
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 51/51 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 51
Applied a total of 1 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 39 cols
[2023-03-17 09:17:45] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-17 09:17:45] [INFO ] Implicit Places using invariants in 85 ms returned [14, 15, 17, 35]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 87 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/40 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 35/40 places, 51/51 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s17 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 288 reset in 152 ms.
Stack based approach found an accepted trace after 153 steps with 0 reset with depth 154 and stack size 154 in 0 ms.
FORMULA Railroad-PT-005-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-005-LTLFireability-02 finished in 335 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((p0||G(F(p1)))))'
Support contains 6 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 40 cols
[2023-03-17 09:17:45] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 09:17:45] [INFO ] Implicit Places using invariants in 53 ms returned [15, 18, 36]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 53 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 37/40 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 37/40 places, 51/51 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Railroad-PT-005-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s15 1) (EQ s24 1)), p1:(OR (EQ s13 0) (EQ s21 0) (EQ s28 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1584 reset in 145 ms.
Product exploration explored 100000 steps with 1576 reset in 191 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p1)), true]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p1)), true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 186 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 56 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 37 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 : 37/37 places, 51/51 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 37 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 36 transition count 50
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 36 transition count 45
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 31 transition count 45
Applied a total of 12 rules in 9 ms. Remains 31 /37 variables (removed 6) and now considering 45/51 (removed 6) transitions.
// Phase 1: matrix 45 rows 31 cols
[2023-03-17 09:17:47] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-17 09:17:47] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-17 09:17:47] [INFO ] Invariant cache hit.
[2023-03-17 09:17:47] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-17 09:17:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 09:17:47] [INFO ] Invariant cache hit.
[2023-03-17 09:17:47] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/37 places, 45/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 31/37 places, 45/51 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 112 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 :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1769 reset in 134 ms.
Product exploration explored 100000 steps with 1753 reset in 159 ms.
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Ensure Unique test removed 1 places
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 30 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 43
Applied a total of 4 rules in 4 ms. Remains 28 /31 variables (removed 3) and now considering 43/45 (removed 2) transitions.
// Phase 1: matrix 43 rows 28 cols
[2023-03-17 09:17:47] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-17 09:17:47] [INFO ] Implicit Places using invariants in 41 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/31 places, 43/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48 ms. Remains : 27/31 places, 43/45 transitions.
Treatment of property Railroad-PT-005-LTLFireability-03 finished in 2272 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||X(p1)))))'
Support contains 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 51/51 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 51
Applied a total of 1 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 39 cols
[2023-03-17 09:17:48] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-17 09:17:48] [INFO ] Implicit Places using invariants in 46 ms returned [14, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 37/40 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 37/40 places, 51/51 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s15 1) (EQ s34 1)), p0:(AND (EQ s4 1) (EQ s14 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Railroad-PT-005-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-005-LTLFireability-04 finished in 202 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)||X(X(p1)))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 51/51 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 51
Applied a total of 1 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 51/51 (removed 0) transitions.
[2023-03-17 09:17:48] [INFO ] Invariant cache hit.
[2023-03-17 09:17:48] [INFO ] Implicit Places using invariants in 52 ms returned [14, 15, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 53 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/40 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 36/40 places, 51/51 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-005-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s14 1) (OR (EQ s4 0) (EQ s14 0) (EQ s32 0))), p1:(AND (EQ s7 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7269 reset in 144 ms.
Stack based approach found an accepted trace after 1648 steps with 125 reset with depth 18 and stack size 18 in 2 ms.
FORMULA Railroad-PT-005-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-005-LTLFireability-07 finished in 324 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 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 51/51 transitions.
Ensure Unique test removed 1 places
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 39 transition count 48
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 36 transition count 48
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 34 transition count 46
Applied a total of 10 rules in 5 ms. Remains 34 /40 variables (removed 6) and now considering 46/51 (removed 5) transitions.
// Phase 1: matrix 46 rows 34 cols
[2023-03-17 09:17:48] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-17 09:17:48] [INFO ] Implicit Places using invariants in 43 ms returned [14, 15, 17, 31]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/40 places, 46/51 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 30 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 29 transition count 45
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 29 transition count 43
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 27 transition count 43
Applied a total of 6 rules in 4 ms. Remains 27 /30 variables (removed 3) and now considering 43/46 (removed 3) transitions.
// Phase 1: matrix 43 rows 27 cols
[2023-03-17 09:17:48] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-17 09:17:48] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-17 09:17:48] [INFO ] Invariant cache hit.
[2023-03-17 09:17:48] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/40 places, 43/51 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 154 ms. Remains : 27/40 places, 43/51 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-005-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s16 1) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 578 reset in 136 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 1 ms.
FORMULA Railroad-PT-005-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-005-LTLFireability-09 finished in 336 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)||G(p2))))'
Support contains 7 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 51/51 transitions.
Ensure Unique test removed 1 places
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 39 transition count 48
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 6 place count 36 transition count 48
Applied a total of 6 rules in 10 ms. Remains 36 /40 variables (removed 4) and now considering 48/51 (removed 3) transitions.
// Phase 1: matrix 48 rows 36 cols
[2023-03-17 09:17:48] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-17 09:17:48] [INFO ] Implicit Places using invariants in 44 ms returned [15, 17, 32]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/40 places, 48/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64 ms. Remains : 33/40 places, 48/51 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Railroad-PT-005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s14 1)), p1:(AND (EQ s13 1) (EQ s21 1) (EQ s25 1)), p2:(AND (EQ s13 1) (EQ s22 1) (EQ s26 1))], nbAcceptance=3, 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 231 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 1 ms.
FORMULA Railroad-PT-005-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-005-LTLFireability-12 finished in 358 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)&&F(G(p1)))))'
Support contains 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 51/51 transitions.
Ensure Unique test removed 1 places
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 39 transition count 48
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 6 place count 36 transition count 48
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 0 with 2 rules applied. Total rules applied 8 place count 35 transition count 47
Applied a total of 8 rules in 13 ms. Remains 35 /40 variables (removed 5) and now considering 47/51 (removed 4) transitions.
// Phase 1: matrix 47 rows 35 cols
[2023-03-17 09:17:49] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-17 09:17:49] [INFO ] Implicit Places using invariants in 50 ms returned [14, 15, 17, 31]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 52 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/40 places, 47/51 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 31 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 46
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 30 transition count 44
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 28 transition count 44
Applied a total of 6 rules in 5 ms. Remains 28 /31 variables (removed 3) and now considering 44/47 (removed 3) transitions.
// Phase 1: matrix 44 rows 28 cols
[2023-03-17 09:17:49] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-17 09:17:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-17 09:17:49] [INFO ] Invariant cache hit.
[2023-03-17 09:17:49] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/40 places, 44/51 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 28/40 places, 44/51 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-005-LTLFireability-13 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s17 0) (EQ s23 0)), p1:(OR (EQ s12 0) (EQ s16 0) (EQ s22 0))], 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 2 reset in 136 ms.
Stack based approach found an accepted trace after 1252 steps with 11 reset with depth 273 and stack size 242 in 2 ms.
FORMULA Railroad-PT-005-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-005-LTLFireability-13 finished in 458 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(G(p1))||p0)))'
Support contains 6 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 51/51 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 51
Applied a total of 1 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 39 cols
[2023-03-17 09:17:49] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-17 09:17:49] [INFO ] Implicit Places using invariants in 48 ms returned [14, 15, 17, 35]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/40 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 35/40 places, 51/51 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (AND (EQ s13 1) (EQ s21 1) (EQ s28 1)) (AND (EQ s13 1) (EQ s19 1) (EQ s28 1))), p1:(AND (EQ s13 1) (EQ s20 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 130 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 3 ms.
FORMULA Railroad-PT-005-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-005-LTLFireability-15 finished in 317 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((p0||G(F(p1)))))'
[2023-03-17 09:17:50] [INFO ] Flatten gal took : 7 ms
[2023-03-17 09:17:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-17 09:17:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 51 transitions and 254 arcs took 0 ms.
Total runtime 6680 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Railroad-PT-005
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA Railroad-PT-005-LTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679044671276

--------------------
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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Railroad-PT-005-LTLFireability-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Railroad-PT-005-LTLFireability-03
lola: result : true
lola: markings : 2216
lola: fired transitions : 8763
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-005-LTLFireability-03: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Railroad-PT-005"
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-005, 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-167889199500364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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