Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415700421.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415700421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 10:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 10:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 82K May 5 16:51 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-00
FORMULA_NAME Railroad-PT-010-01
FORMULA_NAME Railroad-PT-010-02
FORMULA_NAME Railroad-PT-010-03
FORMULA_NAME Railroad-PT-010-04
FORMULA_NAME Railroad-PT-010-05
FORMULA_NAME Railroad-PT-010-06
FORMULA_NAME Railroad-PT-010-07
FORMULA_NAME Railroad-PT-010-08
FORMULA_NAME Railroad-PT-010-09
FORMULA_NAME Railroad-PT-010-10
FORMULA_NAME Railroad-PT-010-11
FORMULA_NAME Railroad-PT-010-12
FORMULA_NAME Railroad-PT-010-13
FORMULA_NAME Railroad-PT-010-14
FORMULA_NAME Railroad-PT-010-15

=== Now, execution of the tool begins

BK_START 1621257732046

Running Version 0
[2021-05-17 13:22:13] [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]
[2021-05-17 13:22:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 13:22:13] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2021-05-17 13:22:13] [INFO ] Transformed 118 places.
[2021-05-17 13:22:13] [INFO ] Transformed 156 transitions.
[2021-05-17 13:22:13] [INFO ] Found NUPN structural information;
[2021-05-17 13:22:13] [INFO ] Parsed PT model containing 118 places and 156 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 13:22:13] [INFO ] Initial state test concluded for 3 properties.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 10 transitions.
FORMULA Railroad-PT-010-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 87 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 87/87 places, 146/146 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 79 transition count 146
Applied a total of 8 rules in 11 ms. Remains 79 /87 variables (removed 8) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 79 cols
[2021-05-17 13:22:13] [INFO ] Computed 33 place invariants in 10 ms
[2021-05-17 13:22:13] [INFO ] Implicit Places using invariants in 150 ms returned [37, 38, 45, 46, 56, 60, 64, 68, 76]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 174 ms to find 9 implicit places.
// Phase 1: matrix 146 rows 70 cols
[2021-05-17 13:22:13] [INFO ] Computed 24 place invariants in 5 ms
[2021-05-17 13:22:14] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Starting structural reductions, iteration 1 : 70/87 places, 146/146 transitions.
Applied a total of 0 rules in 7 ms. Remains 70 /70 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 70 cols
[2021-05-17 13:22:14] [INFO ] Computed 24 place invariants in 2 ms
[2021-05-17 13:22:14] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 2 iterations. Remains : 70/87 places, 146/146 transitions.
[2021-05-17 13:22:14] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-05-17 13:22:14] [INFO ] Flatten gal took : 34 ms
FORMULA Railroad-PT-010-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:22:14] [INFO ] Flatten gal took : 15 ms
[2021-05-17 13:22:14] [INFO ] Input system was already deterministic with 146 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=396 ) properties (out of 22) seen :21
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 70 cols
[2021-05-17 13:22:14] [INFO ] Computed 24 place invariants in 3 ms
[2021-05-17 13:22:14] [INFO ] [Real]Absence check using 18 positive place invariants in 2 ms returned sat
[2021-05-17 13:22:14] [INFO ] [Real]Absence check using 18 positive and 6 generalized place invariants in 1 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2021-05-17 13:22:14] [INFO ] Initial state test concluded for 1 properties.
FORMULA Railroad-PT-010-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||(p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 146/146 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 66 transition count 146
Applied a total of 4 rules in 6 ms. Remains 66 /70 variables (removed 4) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 66 cols
[2021-05-17 13:22:14] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 13:22:14] [INFO ] Implicit Places using invariants in 97 ms returned [32, 33, 34, 36, 40, 59]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 101 ms to find 6 implicit places.
// Phase 1: matrix 146 rows 60 cols
[2021-05-17 13:22:14] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 13:22:14] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Starting structural reductions, iteration 1 : 60/70 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 60 cols
[2021-05-17 13:22:14] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 13:22:15] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/70 places, 146/146 transitions.
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Railroad-PT-010-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (NEQ s6 1) (NEQ s34 1) (NEQ s54 1)), p0:(OR (NEQ s11 1) (NEQ s14 1) (NEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Applying partial POR strategy [true, true, false, true, true]
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 60/60 places, 146/146 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 60 transition count 146
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 2 place count 60 transition count 227
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 13 place count 60 transition count 227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 58 transition count 225
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 58 transition count 225
Deduced a syphon composed of 11 places in 1 ms
Applied a total of 17 rules in 41 ms. Remains 58 /60 variables (removed 2) and now considering 225/146 (removed -79) transitions.
[2021-05-17 13:22:16] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 225 rows 58 cols
[2021-05-17 13:22:16] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-17 13:22:16] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/60 places, 225/146 transitions.
Product exploration explored 100000 steps with 50000 reset in 718 ms.
Product exploration explored 100000 steps with 50000 reset in 465 ms.
[2021-05-17 13:22:18] [INFO ] Flatten gal took : 23 ms
[2021-05-17 13:22:18] [INFO ] Flatten gal took : 18 ms
[2021-05-17 13:22:18] [INFO ] Time to serialize gal into /tmp/LTL3923293513483844055.gal : 10 ms
[2021-05-17 13:22:18] [INFO ] Time to serialize properties into /tmp/LTL2548744184962095943.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3923293513483844055.gal, -t, CGAL, -LTL, /tmp/LTL2548744184962095943.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3923293513483844055.gal -t CGAL -LTL /tmp/LTL2548744184962095943.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("(((pl_P14_9==0)||(pl_P15_2==0))||(pl_P26_1==0))"))||((F("(((pl_P14_4==0)||(pl_P26_1==0))||(pl_P61_1==0))"))&&("(((pl_P14_9==0)||(pl_P15_2==0))||(pl_P26_1==0))")))))
Formula 0 simplified : !X(G"(((pl_P14_9==0)||(pl_P15_2==0))||(pl_P26_1==0))" | ("(((pl_P14_9==0)||(pl_P15_2==0))||(pl_P26_1==0))" & F"(((pl_P14_4==0)||(pl_P26_1==0))||(pl_P61_1==0))"))
Reverse transition relation is NOT exact ! Due to transitions t29, t128, t129, t130, t131, t132, t133, t134, t135, t136, t140, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/135/11/146
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1183 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.8646,288060,1,0,310,1.24188e+06,317,149,3783,918992,305
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Railroad-PT-010-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Railroad-PT-010-02 finished in 16225 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)&&(p1 U (p2||G(p3)||F(p4))))))], workingDir=/home/mcc/execution]
Support contains 10 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 146/146 transitions.
Ensure Unique test removed 4 places
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 66 transition count 144
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 64 transition count 144
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 16 place count 58 transition count 138
Applied a total of 16 rules in 26 ms. Remains 58 /70 variables (removed 12) and now considering 138/146 (removed 8) transitions.
// Phase 1: matrix 138 rows 58 cols
[2021-05-17 13:22:30] [INFO ] Computed 20 place invariants in 7 ms
[2021-05-17 13:22:31] [INFO ] Implicit Places using invariants in 65 ms returned [30, 31, 32, 34, 38, 53]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 66 ms to find 6 implicit places.
[2021-05-17 13:22:31] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 138 rows 52 cols
[2021-05-17 13:22:31] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 13:22:31] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Starting structural reductions, iteration 1 : 52/70 places, 138/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 136
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 136
Applied a total of 4 rules in 10 ms. Remains 50 /52 variables (removed 2) and now considering 136/138 (removed 2) transitions.
// Phase 1: matrix 136 rows 50 cols
[2021-05-17 13:22:31] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 13:22:31] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 136 rows 50 cols
[2021-05-17 13:22:31] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 13:22:31] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 50/70 places, 136/146 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3) (NOT p4))), (NOT p0), (AND (NOT p2) (NOT p3) (NOT p4)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4))), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p4))]
Running random walk in product with property : Railroad-PT-010-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p4) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) p3 (NOT p4) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p4) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p4) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p4) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p4) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p4) (NOT p1)), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p3) (NOT p4) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p3 (NOT p4) p1), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p1))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4) (NOT p1))), acceptance={0, 1} source=3 dest: 4}, { cond=(OR (AND p0 p2 p3 (NOT p4)) (AND p0 p3 (NOT p4) p1)), acceptance={} source=3 dest: 5}, { cond=(OR (AND p0 p2 (NOT p3) (NOT p4)) (AND p0 (NOT p3) (NOT p4) p1)), acceptance={1} source=3 dest: 6}], [{ cond=(AND p0 (NOT p2) (NOT p3) (NOT p4) p1), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p3 (NOT p4) p1), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p3 (NOT p4) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4) (NOT p1))), acceptance={0, 1} source=4 dest: 4}, { cond=(OR (AND p0 p2 (NOT p4)) (AND p0 p3 (NOT p4)) (AND p0 (NOT p4) p1)), acceptance={1} source=4 dest: 6}], [{ cond=(AND (NOT p0) p3 (NOT p4)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p4)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 p3 (NOT p4)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p4)), acceptance={1} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p4)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p0 (NOT p4)), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s47 1)), p2:(AND (EQ s3 1) (EQ s17 1) (EQ s32 1)), p4:(AND (EQ s3 1) (EQ s14 1) (EQ s32 1)), p1:(AND (EQ s11 1) (EQ s18 1) (EQ s32 1)), p3:(AND (EQ s8 1) (EQ s19 1) (EQ s32 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 18 reset in 327 ms.
Stack based approach found an accepted trace after 286 steps with 0 reset with depth 287 and stack size 287 in 2 ms.
FORMULA Railroad-PT-010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-04 finished in 1065 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(!p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 146/146 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 66 transition count 146
Applied a total of 4 rules in 5 ms. Remains 66 /70 variables (removed 4) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 66 cols
[2021-05-17 13:22:32] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 13:22:32] [INFO ] Implicit Places using invariants in 101 ms returned [32, 33, 34, 36, 40, 59]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 103 ms to find 6 implicit places.
// Phase 1: matrix 146 rows 60 cols
[2021-05-17 13:22:32] [INFO ] Computed 14 place invariants in 5 ms
[2021-05-17 13:22:32] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Starting structural reductions, iteration 1 : 60/70 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 60 cols
[2021-05-17 13:22:32] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-17 13:22:32] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/70 places, 146/146 transitions.
Stuttering acceptance computed with spot in 102 ms :[p1, true, p1, p1]
Running random walk in product with property : Railroad-PT-010-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s17 1) (EQ s34 1)), p1:(OR (NEQ s6 1) (NEQ s34 1) (NEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-05 finished in 397 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 146/146 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 66 transition count 146
Applied a total of 4 rules in 2 ms. Remains 66 /70 variables (removed 4) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 66 cols
[2021-05-17 13:22:32] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 13:22:32] [INFO ] Implicit Places using invariants in 63 ms returned [32, 33, 34, 36, 40, 59]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 76 ms to find 6 implicit places.
// Phase 1: matrix 146 rows 60 cols
[2021-05-17 13:22:32] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 13:22:32] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Starting structural reductions, iteration 1 : 60/70 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 60 cols
[2021-05-17 13:22:32] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 13:22:32] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/70 places, 146/146 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-010-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s16 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 526 reset in 213 ms.
Stack based approach found an accepted trace after 949 steps with 8 reset with depth 92 and stack size 92 in 3 ms.
FORMULA Railroad-PT-010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-06 finished in 544 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U (p1||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 146/146 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 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 66 transition count 145
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 66 transition count 141
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 62 transition count 141
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 57 transition count 136
Applied a total of 20 rules in 17 ms. Remains 57 /70 variables (removed 13) and now considering 136/146 (removed 10) transitions.
// Phase 1: matrix 136 rows 57 cols
[2021-05-17 13:22:32] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 13:22:33] [INFO ] Implicit Places using invariants in 75 ms returned [29, 31, 33, 37]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 76 ms to find 4 implicit places.
[2021-05-17 13:22:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 136 rows 53 cols
[2021-05-17 13:22:33] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 13:22:33] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Starting structural reductions, iteration 1 : 53/70 places, 136/146 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 53 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 134
Applied a total of 4 rules in 12 ms. Remains 51 /53 variables (removed 2) and now considering 134/136 (removed 2) transitions.
// Phase 1: matrix 134 rows 51 cols
[2021-05-17 13:22:33] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 13:22:33] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 134 rows 51 cols
[2021-05-17 13:22:33] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-17 13:22:33] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 51/70 places, 134/146 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Railroad-PT-010-07 automaton TGBA [mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s20 1) (EQ s29 1) (EQ s47 1)), p0:(AND (EQ s23 1) (EQ s45 1) (EQ s47 1)), p2:(OR (EQ s0 0) (EQ s50 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-07 finished in 505 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))||G((X(p2)||p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 146/146 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 66 transition count 146
Applied a total of 4 rules in 3 ms. Remains 66 /70 variables (removed 4) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 66 cols
[2021-05-17 13:22:33] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 13:22:33] [INFO ] Implicit Places using invariants in 48 ms returned [32, 33, 34, 36, 59]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 49 ms to find 5 implicit places.
// Phase 1: matrix 146 rows 61 cols
[2021-05-17 13:22:33] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 13:22:33] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Starting structural reductions, iteration 1 : 61/70 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.
// Phase 1: matrix 146 rows 61 cols
[2021-05-17 13:22:33] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 13:22:33] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 2 iterations. Remains : 61/70 places, 146/146 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : Railroad-PT-010-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s6 0) (EQ s12 0) (EQ s34 0)), p0:(AND (EQ s27 1) (EQ s36 1) (EQ s56 1)), p2:(OR (NEQ s6 1) (NEQ s12 1) (NEQ s34 1) (AND (NEQ s10 0) (NEQ s18 0) (NEQ s34 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11152 reset in 207 ms.
Product exploration explored 100000 steps with 11048 reset in 238 ms.
Knowledge obtained : [p1, p0, p2]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 11219 reset in 233 ms.
Product exploration explored 100000 steps with 10967 reset in 230 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 8 out of 61 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 61/61 places, 146/146 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 146
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 2 place count 61 transition count 209
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 11 place count 61 transition count 209
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 59 transition count 207
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 59 transition count 207
Deduced a syphon composed of 9 places in 1 ms
Applied a total of 15 rules in 14 ms. Remains 59 /61 variables (removed 2) and now considering 207/146 (removed -61) transitions.
[2021-05-17 13:22:35] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 207 rows 59 cols
[2021-05-17 13:22:35] [INFO ] Computed 15 place invariants in 4 ms
[2021-05-17 13:22:35] [INFO ] Dead Transitions using invariants and state equation in 247 ms returned []
Finished structural reductions, in 1 iterations. Remains : 59/61 places, 207/146 transitions.
Product exploration explored 100000 steps with 11166 reset in 269 ms.
Product exploration explored 100000 steps with 11038 reset in 170 ms.
[2021-05-17 13:22:35] [INFO ] Flatten gal took : 9 ms
[2021-05-17 13:22:35] [INFO ] Flatten gal took : 8 ms
[2021-05-17 13:22:35] [INFO ] Time to serialize gal into /tmp/LTL7159547560329723392.gal : 2 ms
[2021-05-17 13:22:35] [INFO ] Time to serialize properties into /tmp/LTL9579120168127535779.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7159547560329723392.gal, -t, CGAL, -LTL, /tmp/LTL9579120168127535779.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7159547560329723392.gal -t CGAL -LTL /tmp/LTL9579120168127535779.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F("(((pl_P16_5==1)&&(pl_P34_1==1))&&(pl_P62_1==1))")))||(G(("(((pl_P14_4==0)||(pl_P15_1==0))||(pl_P26_1==0))")||(X("((((pl_P14_4==0)||(pl_P15_1==0))||(pl_P26_1==0))||(((pl_P14_8==1)&&(pl_P15_6==1))&&(pl_P26_1==1)))"))))))
Formula 0 simplified : !(XF"(((pl_P16_5==1)&&(pl_P34_1==1))&&(pl_P62_1==1))" | G("(((pl_P14_4==0)||(pl_P15_1==0))||(pl_P26_1==0))" | X"((((pl_P14_4==0)||(pl_P15_1==0))||(pl_P26_1==0))||(((pl_P14_8==1)&&(pl_P15_6==1))&&(pl_P26_1==1)))"))
Reverse transition relation is NOT exact ! Due to transitions t29, t128, t129, t130, t131, t132, t133, t134, t135, t136, t140, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/135/11/146
Detected timeout of ITS tools.
[2021-05-17 13:22:50] [INFO ] Flatten gal took : 24 ms
[2021-05-17 13:22:50] [INFO ] Applying decomposition
[2021-05-17 13:22:50] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12406883945186301453.txt, -o, /tmp/graph12406883945186301453.bin, -w, /tmp/graph12406883945186301453.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12406883945186301453.bin, -l, -1, -v, -w, /tmp/graph12406883945186301453.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 13:22:51] [INFO ] Decomposing Gal with order
[2021-05-17 13:22:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 13:22:51] [INFO ] Removed a total of 276 redundant transitions.
[2021-05-17 13:22:51] [INFO ] Flatten gal took : 91 ms
[2021-05-17 13:22:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 8 ms.
[2021-05-17 13:22:51] [INFO ] Time to serialize gal into /tmp/LTL2072794860864487960.gal : 3 ms
[2021-05-17 13:22:51] [INFO ] Time to serialize properties into /tmp/LTL2280334357559554069.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2072794860864487960.gal, -t, CGAL, -LTL, /tmp/LTL2280334357559554069.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2072794860864487960.gal -t CGAL -LTL /tmp/LTL2280334357559554069.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(F("(((i0.u6.pl_P16_5==1)&&(i12.u14.pl_P34_1==1))&&(i12.u15.pl_P62_1==1))")))||(G(("(((i0.u2.pl_P14_4==0)||(u9.pl_P15_1==0))||(i0.u2.pl_P26_1==0))")||(X("((((i0.u2.pl_P14_4==0)||(u9.pl_P15_1==0))||(i0.u2.pl_P26_1==0))||(((i0.u2.pl_P14_8==1)&&(u7.pl_P15_6==1))&&(i0.u2.pl_P26_1==1)))"))))))
Formula 0 simplified : !(XF"(((i0.u6.pl_P16_5==1)&&(i12.u14.pl_P34_1==1))&&(i12.u15.pl_P62_1==1))" | G("(((i0.u2.pl_P14_4==0)||(u9.pl_P15_1==0))||(i0.u2.pl_P26_1==0))" | X"((((i0.u2.pl_P14_4==0)||(u9.pl_P15_1==0))||(i0.u2.pl_P26_1==0))||(((i0.u2.pl_P14_8==1)&&(u7.pl_P15_6==1))&&(i0.u2.pl_P26_1==1)))"))
Reverse transition relation is NOT exact ! Due to transitions t29, t128, t129, t130, t133, t135, t140, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/95/7/102
9 unique states visited
8 strongly connected components in search stack
11 transitions explored
9 items max in DFS search stack
64 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.652487,52692,1,0,77546,265,1334,94632,232,782,189359
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Railroad-PT-010-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Railroad-PT-010-08 finished in 18576 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 146/146 transitions.
Ensure Unique test removed 3 places
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 67 transition count 141
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 62 transition count 141
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 57 transition count 136
Applied a total of 20 rules in 24 ms. Remains 57 /70 variables (removed 13) and now considering 136/146 (removed 10) transitions.
// Phase 1: matrix 136 rows 57 cols
[2021-05-17 13:22:52] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 13:22:52] [INFO ] Implicit Places using invariants in 92 ms returned [28, 29, 30, 32, 36, 51]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 119 ms to find 6 implicit places.
[2021-05-17 13:22:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 136 rows 51 cols
[2021-05-17 13:22:52] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 13:22:52] [INFO ] Dead Transitions using invariants and state equation in 252 ms returned []
Starting structural reductions, iteration 1 : 51/70 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 51 transition count 134
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 49 transition count 134
Applied a total of 4 rules in 8 ms. Remains 49 /51 variables (removed 2) and now considering 134/136 (removed 2) transitions.
// Phase 1: matrix 134 rows 49 cols
[2021-05-17 13:22:52] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-17 13:22:52] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 134 rows 49 cols
[2021-05-17 13:22:52] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 13:22:52] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 49/70 places, 134/146 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-010-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s12 0) (NEQ s17 0) (NEQ s30 0)), p1:(OR (EQ s12 0) (EQ s17 0) (EQ s30 0) (AND (EQ s1 1) (EQ s47 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 363 reset in 260 ms.
Stack based approach found an accepted trace after 306 steps with 1 reset with depth 184 and stack size 184 in 1 ms.
FORMULA Railroad-PT-010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-10 finished in 1032 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 67 transition count 146
Applied a total of 3 rules in 5 ms. Remains 67 /70 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 67 cols
[2021-05-17 13:22:53] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-17 13:22:53] [INFO ] Implicit Places using invariants in 86 ms returned [34, 35, 37, 41, 60]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 87 ms to find 5 implicit places.
// Phase 1: matrix 146 rows 62 cols
[2021-05-17 13:22:53] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 13:22:53] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Starting structural reductions, iteration 1 : 62/70 places, 146/146 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 62 cols
[2021-05-17 13:22:53] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 13:22:53] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 2 iterations. Remains : 62/70 places, 146/146 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Railroad-PT-010-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (NEQ s1 1) (NEQ s59 1)), p0:(AND (EQ s29 1) (EQ s33 1) (EQ s57 1) (EQ s3 1) (EQ s16 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 16 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-12 finished in 388 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621257773651

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-4028"
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 r178-tajo-162089415700421"
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 ;