Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572100308.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Railroad-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572100308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.3K Apr 29 13:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 13:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 13:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 13:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 255K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Railroad-PT-020-LTLFireability-00
FORMULA_NAME Railroad-PT-020-LTLFireability-01
FORMULA_NAME Railroad-PT-020-LTLFireability-02
FORMULA_NAME Railroad-PT-020-LTLFireability-03
FORMULA_NAME Railroad-PT-020-LTLFireability-04
FORMULA_NAME Railroad-PT-020-LTLFireability-05
FORMULA_NAME Railroad-PT-020-LTLFireability-06
FORMULA_NAME Railroad-PT-020-LTLFireability-07
FORMULA_NAME Railroad-PT-020-LTLFireability-08
FORMULA_NAME Railroad-PT-020-LTLFireability-09
FORMULA_NAME Railroad-PT-020-LTLFireability-10
FORMULA_NAME Railroad-PT-020-LTLFireability-11
FORMULA_NAME Railroad-PT-020-LTLFireability-12
FORMULA_NAME Railroad-PT-020-LTLFireability-13
FORMULA_NAME Railroad-PT-020-LTLFireability-14
FORMULA_NAME Railroad-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653082527642

Running Version 202205111006
[2022-05-20 21:35:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 21:35:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:35:29] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2022-05-20 21:35:29] [INFO ] Transformed 218 places.
[2022-05-20 21:35:29] [INFO ] Transformed 506 transitions.
[2022-05-20 21:35:29] [INFO ] Found NUPN structural information;
[2022-05-20 21:35:29] [INFO ] Parsed PT model containing 218 places and 506 transitions in 361 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 5 formulas.
Deduced a syphon composed of 61 places in 6 ms
Reduce places removed 61 places and 20 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Railroad-PT-020-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA Railroad-PT-020-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 486/486 transitions.
Ensure Unique test removed 21 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 136 transition count 486
Applied a total of 21 rules in 37 ms. Remains 136 /157 variables (removed 21) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 136 cols
[2022-05-20 21:35:30] [INFO ] Invariants computation overflowed in 20 ms
[2022-05-20 21:35:30] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 486 rows 136 cols
[2022-05-20 21:35:30] [INFO ] Invariants computation overflowed in 7 ms
[2022-05-20 21:35:30] [INFO ] Implicit Places using invariants and state equation in 411 ms returned [0, 1, 5, 8, 10, 14, 16, 38, 59, 61, 62, 73, 74, 78, 79, 81, 106, 111, 115, 121, 125, 129, 132, 134]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 720 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/157 places, 486/486 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 112/157 places, 486/486 transitions.
Support contains 36 out of 112 places after structural reductions.
[2022-05-20 21:35:31] [INFO ] Flatten gal took : 79 ms
[2022-05-20 21:35:31] [INFO ] Flatten gal took : 36 ms
[2022-05-20 21:35:31] [INFO ] Input system was already deterministic with 486 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 24) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 486 rows 112 cols
[2022-05-20 21:35:32] [INFO ] Computed 26 place invariants in 8 ms
[2022-05-20 21:35:32] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2022-05-20 21:35:32] [INFO ] [Real]Absence check using 23 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-20 21:35:32] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2022-05-20 21:35:32] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2022-05-20 21:35:32] [INFO ] [Nat]Absence check using 23 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-20 21:35:32] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2022-05-20 21:35:32] [INFO ] After 241ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-05-20 21:35:32] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 20 ms.
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 112/112 places, 486/486 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 109 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 5 place count 109 transition count 464
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 45 place count 89 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 88 transition count 463
Applied a total of 47 rules in 67 ms. Remains 88 /112 variables (removed 24) and now considering 463/486 (removed 23) transitions.
Finished structural reductions, in 1 iterations. Remains : 88/112 places, 463/486 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1182347 steps, run timeout after 3001 ms. (steps per millisecond=393 ) properties seen :{}
Probabilistic random walk after 1182347 steps, saw 752856 distinct states, run finished after 3002 ms. (steps per millisecond=393 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 88 cols
[2022-05-20 21:35:35] [INFO ] Invariants computation overflowed in 9 ms
[2022-05-20 21:35:36] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:35:36] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:35:36] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-20 21:35:36] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 88/88 places, 463/463 transitions.
Applied a total of 0 rules in 37 ms. Remains 88 /88 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 88/88 places, 463/463 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 88/88 places, 463/463 transitions.
Applied a total of 0 rules in 53 ms. Remains 88 /88 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 88 cols
[2022-05-20 21:35:36] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:35:36] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2022-05-20 21:35:36] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-20 21:35:36] [INFO ] Implicit Places using invariants and state equation in 405 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 557 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 87/88 places, 463/463 transitions.
Applied a total of 0 rules in 43 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 87/88 places, 463/463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1424914 steps, run timeout after 3001 ms. (steps per millisecond=474 ) properties seen :{}
Probabilistic random walk after 1424914 steps, saw 902717 distinct states, run finished after 3003 ms. (steps per millisecond=474 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 87 cols
[2022-05-20 21:35:40] [INFO ] Invariants computation overflowed in 6 ms
[2022-05-20 21:35:40] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:35:40] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:35:40] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-20 21:35:40] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 23 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 463/463 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 20 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 87 cols
[2022-05-20 21:35:40] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-20 21:35:40] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2022-05-20 21:35:40] [INFO ] Invariants computation overflowed in 3 ms
[2022-05-20 21:35:40] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2022-05-20 21:35:40] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2022-05-20 21:35:40] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-20 21:35:40] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 463/463 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 87 transition count 443
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 67 transition count 443
Applied a total of 40 rules in 12 ms. Remains 67 /87 variables (removed 20) and now considering 443/463 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 443 rows 67 cols
[2022-05-20 21:35:41] [INFO ] Invariants computation overflowed in 3 ms
[2022-05-20 21:35:41] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:35:41] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:35:41] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-20 21:35:41] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 21:35:41] [INFO ] Flatten gal took : 23 ms
[2022-05-20 21:35:41] [INFO ] Flatten gal took : 20 ms
[2022-05-20 21:35:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7574598512363080326.gal : 11 ms
[2022-05-20 21:35:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18372404704766979939.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3037308526866755431;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7574598512363080326.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18372404704766979939.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality18372404704766979939.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 39
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :39 after 265
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :265 after 3842
Reachability property AtomicPropp13 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,12186,0.122214,7524,2,815,12,8997,6,0,714,4994,0
Total reachable state count : 12186

Verifying 1 reachability properties.
Reachability property AtomicPropp13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp13,1,0.1335,7764,2,68,12,8997,7,0,723,4994,0
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
FORMULA Railroad-PT-020-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(X(X(G(X(G(p0))))))))))'
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 486/486 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 109 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 109 transition count 464
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 44 place count 89 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 88 transition count 463
Applied a total of 46 rules in 74 ms. Remains 88 /112 variables (removed 24) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 88 cols
[2022-05-20 21:35:41] [INFO ] Invariants computation overflowed in 12 ms
[2022-05-20 21:35:42] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2022-05-20 21:35:42] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-20 21:35:42] [INFO ] Implicit Places using invariants and state equation in 458 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 596 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/112 places, 463/486 transitions.
Applied a total of 0 rules in 28 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 87/112 places, 463/486 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s26 0) (EQ s31 0) (EQ s35 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 749 ms.
Stack based approach found an accepted trace after 9462 steps with 0 reset with depth 9463 and stack size 9455 in 55 ms.
FORMULA Railroad-PT-020-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-04 finished in 1777 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(G(X(p0)))&&(!p1 U p0)))'
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 486/486 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 486
Applied a total of 1 rules in 3 ms. Remains 111 /112 variables (removed 1) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 111 cols
[2022-05-20 21:35:43] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-20 21:35:43] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 486 rows 111 cols
[2022-05-20 21:35:43] [INFO ] Invariants computation overflowed in 3 ms
[2022-05-20 21:35:44] [INFO ] Implicit Places using invariants and state equation in 499 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 616 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/112 places, 486/486 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 110/112 places, 486/486 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s14 1) (EQ s41 1) (EQ s56 1)), p1:(AND (EQ s17 1) (EQ s49 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Railroad-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-020-LTLFireability-05 finished in 810 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 486/486 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 109 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 109 transition count 464
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 44 place count 89 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 88 transition count 463
Applied a total of 46 rules in 59 ms. Remains 88 /112 variables (removed 24) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 88 cols
[2022-05-20 21:35:44] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:35:44] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2022-05-20 21:35:44] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-20 21:35:45] [INFO ] Implicit Places using invariants and state equation in 417 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 537 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/112 places, 463/486 transitions.
Applied a total of 0 rules in 28 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 87/112 places, 463/486 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s31 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 533 ms.
Stack based approach found an accepted trace after 3901 steps with 0 reset with depth 3902 and stack size 3902 in 19 ms.
FORMULA Railroad-PT-020-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-07 finished in 1241 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(!(X((X(p0)||p1)) U p0))))))'
Support contains 3 out of 112 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 : 112/112 places, 486/486 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 109 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 109 transition count 464
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 44 place count 89 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 88 transition count 463
Applied a total of 46 rules in 60 ms. Remains 88 /112 variables (removed 24) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 88 cols
[2022-05-20 21:35:45] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:35:45] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2022-05-20 21:35:45] [INFO ] Invariants computation overflowed in 3 ms
[2022-05-20 21:35:46] [INFO ] Implicit Places using invariants and state equation in 414 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 516 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/112 places, 463/486 transitions.
Applied a total of 0 rules in 29 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 87/112 places, 463/486 transitions.
Stuttering acceptance computed with spot in 51 ms :[p0]
Running random walk in product with property : Railroad-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s31 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 502 ms.
Stack based approach found an accepted trace after 2473 steps with 0 reset with depth 2474 and stack size 2470 in 14 ms.
FORMULA Railroad-PT-020-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-09 finished in 1205 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(X(X((G(p1)||p0)))))&&G(p2))))'
Support contains 7 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 486/486 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 109 transition count 484
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 4 place count 109 transition count 465
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 42 place count 90 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 89 transition count 464
Applied a total of 44 rules in 65 ms. Remains 89 /112 variables (removed 23) and now considering 464/486 (removed 22) transitions.
// Phase 1: matrix 464 rows 89 cols
[2022-05-20 21:35:46] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:35:47] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 464 rows 89 cols
[2022-05-20 21:35:47] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-20 21:35:47] [INFO ] Implicit Places using invariants and state equation in 286 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 389 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/112 places, 464/486 transitions.
Applied a total of 0 rules in 32 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 88/112 places, 464/486 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s22 0) (EQ s30 0) (EQ s36 0)), p1:(AND (EQ s22 1) (EQ s30 1) (EQ s36 1)), p0:(OR (AND (EQ s5 1) (EQ s11 1) (EQ s36 1)) (AND (EQ s14 1) (EQ s31 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2282 reset in 553 ms.
Stack based approach found an accepted trace after 1955 steps with 44 reset with depth 27 and stack size 27 in 9 ms.
FORMULA Railroad-PT-020-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-10 finished in 1208 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(F(p0))))&&X(!(!p1 U p2))))'
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 486/486 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 486
Applied a total of 1 rules in 2 ms. Remains 111 /112 variables (removed 1) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 111 cols
[2022-05-20 21:35:48] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-20 21:35:48] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 486 rows 111 cols
[2022-05-20 21:35:48] [INFO ] Invariants computation overflowed in 3 ms
[2022-05-20 21:35:48] [INFO ] Implicit Places using invariants and state equation in 488 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 612 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/112 places, 486/486 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 110/112 places, 486/486 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s30 1) (EQ s48 1) (EQ s56 1)), p1:(AND (EQ s21 1) (EQ s44 1) (EQ s56 1)), p0:(OR (EQ s30 0) (EQ s48 0) (EQ s56 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 254 steps with 0 reset in 3 ms.
FORMULA Railroad-PT-020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-020-LTLFireability-11 finished in 893 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U p1)))||!(F(p2) U p2)))'
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 486/486 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 486
Applied a total of 1 rules in 4 ms. Remains 111 /112 variables (removed 1) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 111 cols
[2022-05-20 21:35:48] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:35:49] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 486 rows 111 cols
[2022-05-20 21:35:49] [INFO ] Invariants computation overflowed in 7 ms
[2022-05-20 21:35:49] [INFO ] Implicit Places using invariants and state equation in 490 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 604 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/112 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 110/112 places, 486/486 transitions.
Stuttering acceptance computed with spot in 346 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), true, (AND (NOT p1) p2), p2]
Running random walk in product with property : Railroad-PT-020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 3}], [{ cond=p2, acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=5, aps=[p1:(AND (EQ s23 1) (EQ s40 1) (EQ s56 1)), p0:(AND (EQ s20 1) (EQ s31 1) (EQ s56 1)), p2:(AND (EQ s20 1) (EQ s43 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20157 steps with 0 reset in 95 ms.
FORMULA Railroad-PT-020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-020-LTLFireability-12 finished in 1073 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||X((X((F(p1)||p2))||X(p3))))))'
Support contains 7 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 486/486 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2022-05-20 21:35:50] [INFO ] Computed 26 place invariants in 7 ms
[2022-05-20 21:35:50] [INFO ] Implicit Places using invariants in 192 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 194 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 486/486 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 111/112 places, 486/486 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=3, aps=[p0:(OR (EQ s17 0) (EQ s36 0) (EQ s56 0)), p1:(AND (EQ s17 1) (EQ s36 1) (EQ s56 1)), p3:(AND (EQ s30 1) (EQ s40 1) (EQ s56 1)), p2:(AND (EQ s64 1) (EQ s89...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 281 ms.
Product exploration explored 100000 steps with 33333 reset in 293 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 p1) (NOT p3) (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 5 states, 5 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA Railroad-PT-020-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-020-LTLFireability-15 finished in 1099 ms.
All properties solved by simple procedures.
Total runtime 21670 ms.

BK_STOP 1653082551220

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Railroad-PT-020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="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-4028"
echo " Executing tool itstools"
echo " Input is Railroad-PT-020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-tajo-165281572100308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Railroad-PT-020.tgz
mv Railroad-PT-020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;