Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 82K May 18 16:43 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 1716697679123

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 04:28:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 04:28:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 04:28:00] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-26 04:28:00] [INFO ] Transformed 118 places.
[2024-05-26 04:28:00] [INFO ] Transformed 156 transitions.
[2024-05-26 04:28:00] [INFO ] Found NUPN structural information;
[2024-05-26 04:28:00] [INFO ] Parsed PT model containing 118 places and 156 transitions and 898 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 10 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Railroad-PT-010-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 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 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 76 transition count 146
Applied a total of 11 rules in 25 ms. Remains 76 /87 variables (removed 11) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 76 cols
[2024-05-26 04:28:00] [INFO ] Computed 30 invariants in 16 ms
[2024-05-26 04:28:00] [INFO ] Implicit Places using invariants in 209 ms returned [32, 33, 35, 36, 38, 42, 43, 57, 60, 64, 67, 72]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 239 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/87 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 282 ms. Remains : 64/87 places, 146/146 transitions.
Support contains 32 out of 64 places after structural reductions.
[2024-05-26 04:28:01] [INFO ] Flatten gal took : 36 ms
[2024-05-26 04:28:01] [INFO ] Flatten gal took : 18 ms
[2024-05-26 04:28:01] [INFO ] Input system was already deterministic with 146 transitions.
Reduction of identical properties reduced properties to check from 33 to 29
RANDOM walk for 40000 steps (8 resets) in 1821 ms. (21 steps per ms) remains 1/29 properties
BEST_FIRST walk for 12080 steps (2 resets) in 65 ms. (183 steps per ms) remains 0/1 properties
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||X(X(F(p1)))))'
Support contains 3 out of 64 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 63 cols
[2024-05-26 04:28:02] [INFO ] Computed 17 invariants in 6 ms
[2024-05-26 04:28:02] [INFO ] Implicit Places using invariants in 90 ms returned [32, 37, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 92 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/64 places, 146/146 transitions.
Applied a total of 0 rules in 3 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 98 ms. Remains : 60/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-01
Product exploration explored 100000 steps with 802 reset in 353 ms.
Stack based approach found an accepted trace after 1209 steps with 9 reset with depth 84 and stack size 84 in 4 ms.
FORMULA Railroad-PT-010-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-01 finished in 718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 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 63 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 57 transition count 140
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 53 transition count 136
Applied a total of 20 rules in 25 ms. Remains 53 /64 variables (removed 11) and now considering 136/146 (removed 10) transitions.
// Phase 1: matrix 136 rows 53 cols
[2024-05-26 04:28:02] [INFO ] Computed 17 invariants in 1 ms
[2024-05-26 04:28:02] [INFO ] Implicit Places using invariants in 80 ms returned [26, 31, 39]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 81 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/64 places, 136/146 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 50 transition count 134
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 4 place count 48 transition count 134
Applied a total of 4 rules in 14 ms. Remains 48 /50 variables (removed 2) and now considering 134/136 (removed 2) transitions.
// Phase 1: matrix 134 rows 48 cols
[2024-05-26 04:28:03] [INFO ] Computed 14 invariants in 2 ms
[2024-05-26 04:28:03] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-26 04:28:03] [INFO ] Invariant cache hit.
[2024-05-26 04:28:03] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/64 places, 134/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 392 ms. Remains : 48/64 places, 134/146 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 264 ms.
Stack based approach found an accepted trace after 126 steps with 0 reset with depth 127 and stack size 127 in 1 ms.
FORMULA Railroad-PT-010-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-03 finished in 805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&(G(!p1)||F(G((p2||F(p3)))))))))'
Support contains 10 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 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 63 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 57 transition count 140
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 18 place count 54 transition count 137
Applied a total of 18 rules in 21 ms. Remains 54 /64 variables (removed 10) and now considering 137/146 (removed 9) transitions.
// Phase 1: matrix 137 rows 54 cols
[2024-05-26 04:28:03] [INFO ] Computed 17 invariants in 4 ms
[2024-05-26 04:28:03] [INFO ] Implicit Places using invariants in 71 ms returned [26, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 73 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/64 places, 137/146 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 52 transition count 135
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 4 place count 50 transition count 135
Applied a total of 4 rules in 8 ms. Remains 50 /52 variables (removed 2) and now considering 135/137 (removed 2) transitions.
// Phase 1: matrix 135 rows 50 cols
[2024-05-26 04:28:03] [INFO ] Computed 15 invariants in 1 ms
[2024-05-26 04:28:03] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-26 04:28:03] [INFO ] Invariant cache hit.
[2024-05-26 04:28:03] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/64 places, 135/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 242 ms. Remains : 50/64 places, 135/146 transitions.
Stuttering acceptance computed with spot in 283 ms :[p0, true, (AND p0 p1 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p1)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-04
Product exploration explored 100000 steps with 14 reset in 266 ms.
Stack based approach found an accepted trace after 67746 steps with 3 reset with depth 7273 and stack size 6497 in 210 ms.
FORMULA Railroad-PT-010-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-04 finished in 1028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&(X(F(p1))||F(p2))))'
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 64 cols
[2024-05-26 04:28:04] [INFO ] Computed 18 invariants in 2 ms
[2024-05-26 04:28:04] [INFO ] Implicit Places using invariants in 59 ms returned [32, 37, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 71 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/64 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/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Railroad-PT-010-LTLFireability-05
Product exploration explored 100000 steps with 3566 reset in 222 ms.
Stack based approach found an accepted trace after 5849 steps with 211 reset with depth 44 and stack size 44 in 11 ms.
FORMULA Railroad-PT-010-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-05 finished in 488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(G(p0))))&&(X(p2)||p1)))))'
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 63 cols
[2024-05-26 04:28:05] [INFO ] Computed 17 invariants in 1 ms
[2024-05-26 04:28:05] [INFO ] Implicit Places using invariants in 60 ms returned [37, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 62 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/64 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 66 ms. Remains : 61/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 293 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Railroad-PT-010-LTLFireability-07
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-07 finished in 383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 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 63 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 56 transition count 139
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 22 place count 52 transition count 135
Applied a total of 22 rules in 15 ms. Remains 52 /64 variables (removed 12) and now considering 135/146 (removed 11) transitions.
// Phase 1: matrix 135 rows 52 cols
[2024-05-26 04:28:05] [INFO ] Computed 17 invariants in 3 ms
[2024-05-26 04:28:05] [INFO ] Implicit Places using invariants in 56 ms returned [25, 30, 38]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 57 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/64 places, 135/146 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 49 transition count 133
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 4 place count 47 transition count 133
Applied a total of 4 rules in 6 ms. Remains 47 /49 variables (removed 2) and now considering 133/135 (removed 2) transitions.
// Phase 1: matrix 133 rows 47 cols
[2024-05-26 04:28:05] [INFO ] Computed 14 invariants in 1 ms
[2024-05-26 04:28:05] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-26 04:28:05] [INFO ] Invariant cache hit.
[2024-05-26 04:28:05] [INFO ] Implicit Places using invariants and state equation in 77 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 : 47/64 places, 133/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 47/64 places, 133/146 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-08
Product exploration explored 100000 steps with 383 reset in 234 ms.
Stack based approach found an accepted trace after 273 steps with 1 reset with depth 66 and stack size 66 in 1 ms.
FORMULA Railroad-PT-010-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-08 finished in 561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((F(G(!p2))&&p1))))'
Support contains 8 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 63 cols
[2024-05-26 04:28:06] [INFO ] Computed 17 invariants in 1 ms
[2024-05-26 04:28:06] [INFO ] Implicit Places using invariants in 57 ms returned [32, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/64 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 62 ms. Remains : 61/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p0), (AND (NOT p0) p2), p2]
Running random walk in product with property : Railroad-PT-010-LTLFireability-09
Product exploration explored 100000 steps with 47 reset in 199 ms.
Stack based approach found an accepted trace after 986 steps with 0 reset with depth 987 and stack size 987 in 3 ms.
FORMULA Railroad-PT-010-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-09 finished in 542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||((p1 U p2)&&X(p3))))'
Support contains 8 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
[2024-05-26 04:28:06] [INFO ] Invariant cache hit.
[2024-05-26 04:28:06] [INFO ] Implicit Places using invariants in 55 ms returned [32, 37, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/64 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 63 ms. Remains : 60/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), true, (NOT p2)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-10
Entered a terminal (fully accepting) state of product in 212 steps with 0 reset in 2 ms.
FORMULA Railroad-PT-010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-10 finished in 392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (F(!p1)&&X(p2))))'
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
[2024-05-26 04:28:07] [INFO ] Invariant cache hit.
[2024-05-26 04:28:07] [INFO ] Implicit Places using invariants in 54 ms returned [32, 37, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/64 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 59 ms. Remains : 60/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p2) p1), p1, (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-11 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||G(p2)||p0)))'
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 4 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
[2024-05-26 04:28:07] [INFO ] Invariant cache hit.
[2024-05-26 04:28:07] [INFO ] Implicit Places using invariants in 52 ms returned [37, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/64 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 58 ms. Remains : 61/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 207 ms.
Product exploration explored 100000 steps with 0 reset in 276 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 108 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 10 to 8
RANDOM walk for 40000 steps (8 resets) in 453 ms. (88 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 262 ms. (152 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
// Phase 1: matrix 146 rows 61 cols
[2024-05-26 04:28:08] [INFO ] Computed 15 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 10/14 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/34 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 27/61 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 27/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/61 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 146/207 variables, 61/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/207 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 137 constraints, problems are : Problem set: 0 solved, 3 unsolved in 115 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/14 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/34 variables, 2/20 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 20/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-26 04:28:09] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 5 ms to minimize.
[2024-05-26 04:28:09] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem apf4 is UNSAT
After SMT solving in domain Int declared 34/207 variables, and 42 constraints, problems are : Problem set: 3 solved, 0 unsolved in 139 ms.
Refiners :[Domain max(s): 34/61 constraints, Positive P Invariants (semi-flows): 4/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/61 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 278ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1)), (G (OR (NOT p2) p1)), (G (OR p0 p2 (NOT p1))), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND p0 p1))), (F (NOT (OR p2 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2)))), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 314 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 146/146 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 61 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 60 transition count 145
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 2 place count 60 transition count 135
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 22 place count 50 transition count 135
Applied a total of 22 rules in 12 ms. Remains 50 /61 variables (removed 11) and now considering 135/146 (removed 11) transitions.
// Phase 1: matrix 135 rows 50 cols
[2024-05-26 04:28:09] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 04:28:09] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-26 04:28:09] [INFO ] Invariant cache hit.
[2024-05-26 04:28:09] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-26 04:28:09] [INFO ] Redundant transitions in 2 ms returned []
Running 125 sub problems to find dead transitions.
[2024-05-26 04:28:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-26 04:28:10] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
[2024-05-26 04:28:10] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-05-26 04:28:10] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-26 04:28:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 10/50 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 135/185 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-26 04:28:11] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 120 constraints, problems are : Problem set: 0 solved, 125 unsolved in 2876 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 10/50 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 135/185 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 125/245 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 245 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3821 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 5/5 constraints]
After SMT, in 6825ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 6828ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/61 places, 135/146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7021 ms. Remains : 50/61 places, 135/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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 132 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 199 ms. (200 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
[2024-05-26 04:28:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/40 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/49 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/50 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/50 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 135/185 variables, 50/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/40 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 04:28:17] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem apf0 is UNSAT
After SMT solving in domain Int declared 40/185 variables, and 46 constraints, problems are : Problem set: 1 solved, 0 unsolved in 76 ms.
Refiners :[Domain max(s): 40/50 constraints, Positive P Invariants (semi-flows): 5/14 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/50 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 160ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 12 factoid took 403 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 237 ms.
Product exploration explored 100000 steps with 0 reset in 307 ms.
Built C files in :
/tmp/ltsmin15549742697737224935
[2024-05-26 04:28:18] [INFO ] Computing symmetric may disable matrix : 135 transitions.
[2024-05-26 04:28:18] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 04:28:18] [INFO ] Computing symmetric may enable matrix : 135 transitions.
[2024-05-26 04:28:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 04:28:18] [INFO ] Computing Do-Not-Accords matrix : 135 transitions.
[2024-05-26 04:28:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 04:28:18] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15549742697737224935
Running compilation step : cd /tmp/ltsmin15549742697737224935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 474 ms.
Running link step : cd /tmp/ltsmin15549742697737224935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin15549742697737224935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased413546718052784592.hoa' '--buchi-type=spotba'
LTSmin run took 10320 ms.
FORMULA Railroad-PT-010-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Railroad-PT-010-LTLFireability-12 finished in 21898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1) U X(p2))&&F(G(p2))))'
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 63 cols
[2024-05-26 04:28:29] [INFO ] Computed 17 invariants in 2 ms
[2024-05-26 04:28:29] [INFO ] Implicit Places using invariants in 67 ms returned [32, 37, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 68 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/64 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 72 ms. Remains : 60/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Railroad-PT-010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-13 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 2 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
[2024-05-26 04:28:29] [INFO ] Invariant cache hit.
[2024-05-26 04:28:29] [INFO ] Implicit Places using invariants in 57 ms returned [32, 37, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 57 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/64 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 60 ms. Remains : 60/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-010-LTLFireability-14
Product exploration explored 100000 steps with 4494 reset in 212 ms.
Stack based approach found an accepted trace after 3513 steps with 164 reset with depth 28 and stack size 28 in 9 ms.
FORMULA Railroad-PT-010-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-14 finished in 364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 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 63 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 56 transition count 139
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 22 place count 52 transition count 135
Applied a total of 22 rules in 10 ms. Remains 52 /64 variables (removed 12) and now considering 135/146 (removed 11) transitions.
// Phase 1: matrix 135 rows 52 cols
[2024-05-26 04:28:30] [INFO ] Computed 17 invariants in 1 ms
[2024-05-26 04:28:30] [INFO ] Implicit Places using invariants in 55 ms returned [25, 30, 38]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/64 places, 135/146 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 49 transition count 133
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 4 place count 47 transition count 133
Applied a total of 4 rules in 4 ms. Remains 47 /49 variables (removed 2) and now considering 133/135 (removed 2) transitions.
// Phase 1: matrix 133 rows 47 cols
[2024-05-26 04:28:30] [INFO ] Computed 14 invariants in 1 ms
[2024-05-26 04:28:30] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-26 04:28:30] [INFO ] Invariant cache hit.
[2024-05-26 04:28:30] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/64 places, 133/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 208 ms. Remains : 47/64 places, 133/146 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-15
Product exploration explored 100000 steps with 86 reset in 215 ms.
Stack based approach found an accepted trace after 79 steps with 0 reset with depth 80 and stack size 80 in 0 ms.
FORMULA Railroad-PT-010-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-15 finished in 477 ms.
All properties solved by simple procedures.
Total runtime 30222 ms.

BK_STOP 1716697710547

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Railroad-PT-010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
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 r312-tall-171662338600484"
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 ;