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-162089415700413.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-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415700413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 117K 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.3K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 4.4K Mar 27 10:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 10:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 13:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 13:41 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 32K 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-005-00
FORMULA_NAME Railroad-PT-005-01
FORMULA_NAME Railroad-PT-005-02
FORMULA_NAME Railroad-PT-005-03
FORMULA_NAME Railroad-PT-005-04
FORMULA_NAME Railroad-PT-005-05
FORMULA_NAME Railroad-PT-005-06
FORMULA_NAME Railroad-PT-005-07
FORMULA_NAME Railroad-PT-005-08
FORMULA_NAME Railroad-PT-005-09
FORMULA_NAME Railroad-PT-005-10
FORMULA_NAME Railroad-PT-005-11
FORMULA_NAME Railroad-PT-005-12
FORMULA_NAME Railroad-PT-005-13
FORMULA_NAME Railroad-PT-005-14
FORMULA_NAME Railroad-PT-005-15

=== Now, execution of the tool begins

BK_START 1621257679047

Running Version 0
[2021-05-17 13:21:23] [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:21:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 13:21:23] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2021-05-17 13:21:23] [INFO ] Transformed 68 places.
[2021-05-17 13:21:23] [INFO ] Transformed 56 transitions.
[2021-05-17 13:21:23] [INFO ] Found NUPN structural information;
[2021-05-17 13:21:23] [INFO ] Parsed PT model containing 68 places and 56 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 5 transitions.
FORMULA Railroad-PT-005-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 52 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 52/52 places, 51/51 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 48 transition count 51
Applied a total of 4 rules in 59 ms. Remains 48 /52 variables (removed 4) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 48 cols
[2021-05-17 13:21:23] [INFO ] Computed 22 place invariants in 12 ms
[2021-05-17 13:21:24] [INFO ] Implicit Places using invariants in 268 ms returned [18, 22, 23, 24, 33, 44]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 296 ms to find 6 implicit places.
// Phase 1: matrix 51 rows 42 cols
[2021-05-17 13:21:24] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-17 13:21:24] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Starting structural reductions, iteration 1 : 42/52 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 42 cols
[2021-05-17 13:21:24] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-17 13:21:24] [INFO ] Dead Transitions using invariants and state equation in 213 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/52 places, 51/51 transitions.
[2021-05-17 13:21:24] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 13:21:24] [INFO ] Flatten gal took : 57 ms
FORMULA Railroad-PT-005-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:21:24] [INFO ] Flatten gal took : 23 ms
[2021-05-17 13:21:25] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=203 ) properties (out of 24) seen :23
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 42 cols
[2021-05-17 13:21:25] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-17 13:21:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-17 13:21:25] [INFO ] [Real]Absence check using 8 positive and 8 generalized place invariants in 3 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 51/51 transitions.
Ensure Unique test removed 3 places
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 39 transition count 48
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 36 transition count 48
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 33 transition count 45
Applied a total of 12 rules in 38 ms. Remains 33 /42 variables (removed 9) and now considering 45/51 (removed 6) transitions.
// Phase 1: matrix 45 rows 33 cols
[2021-05-17 13:21:25] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 13:21:26] [INFO ] Implicit Places using invariants in 86 ms returned [14, 15, 16, 30]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 103 ms to find 4 implicit places.
[2021-05-17 13:21:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 29 cols
[2021-05-17 13:21:26] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:26] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Starting structural reductions, iteration 1 : 29/42 places, 45/51 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 29 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 28 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 28 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 26 transition count 42
Applied a total of 6 rules in 12 ms. Remains 26 /29 variables (removed 3) and now considering 42/45 (removed 3) transitions.
// Phase 1: matrix 42 rows 26 cols
[2021-05-17 13:21:26] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:26] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 42 rows 26 cols
[2021-05-17 13:21:26] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:26] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 26/42 places, 42/51 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-005-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s18 1) (EQ s24 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 391 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 1 ms.
FORMULA Railroad-PT-005-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-005-00 finished in 1202 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 51/51 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 39 transition count 51
Applied a total of 3 rules in 1 ms. Remains 39 /42 variables (removed 3) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 39 cols
[2021-05-17 13:21:26] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-17 13:21:27] [INFO ] Implicit Places using invariants in 115 ms returned [14, 16, 35]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 130 ms to find 3 implicit places.
// Phase 1: matrix 51 rows 36 cols
[2021-05-17 13:21:27] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 13:21:27] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Starting structural reductions, iteration 1 : 36/42 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 36 cols
[2021-05-17 13:21:27] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 13:21:27] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 2 iterations. Remains : 36/42 places, 51/51 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : Railroad-PT-005-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s14 1) (EQ s16 1)), p1:(AND (NEQ s13 0) (NEQ s20 0) (NEQ s28 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 1 ms.
FORMULA Railroad-PT-005-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-005-01 finished in 458 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 51/51 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 39 transition count 51
Applied a total of 3 rules in 3 ms. Remains 39 /42 variables (removed 3) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 39 cols
[2021-05-17 13:21:27] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 13:21:27] [INFO ] Implicit Places using invariants in 50 ms returned [14, 16, 35]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
// Phase 1: matrix 51 rows 36 cols
[2021-05-17 13:21:27] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 13:21:27] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Starting structural reductions, iteration 1 : 36/42 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 36 cols
[2021-05-17 13:21:27] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-17 13:21:28] [INFO ] Dead Transitions using invariants and state equation in 804 ms returned []
Finished structural reductions, in 2 iterations. Remains : 36/42 places, 51/51 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-005-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s14 1)), p1:(AND (EQ s13 1) (EQ s19 1) (EQ s29 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 25000 reset in 233 ms.
Product exploration explored 100000 steps with 25000 reset in 212 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 122 ms.
Product exploration explored 100000 steps with 25000 reset in 287 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 36 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 36/36 places, 51/51 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 36 transition count 67
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 36 transition count 67
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 4 rules in 4 ms. Remains 36 /36 variables (removed 0) and now considering 67/51 (removed -16) transitions.
[2021-05-17 13:21:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 67 rows 36 cols
[2021-05-17 13:21:29] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 13:21:29] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Finished structural reductions, in 1 iterations. Remains : 36/36 places, 67/51 transitions.
Product exploration explored 100000 steps with 25000 reset in 321 ms.
Product exploration explored 100000 steps with 25000 reset in 178 ms.
[2021-05-17 13:21:30] [INFO ] Flatten gal took : 7 ms
[2021-05-17 13:21:30] [INFO ] Flatten gal took : 6 ms
[2021-05-17 13:21:30] [INFO ] Time to serialize gal into /tmp/LTL16806890153792049862.gal : 34 ms
[2021-05-17 13:21:30] [INFO ] Time to serialize properties into /tmp/LTL3096102692658421318.ltl : 14 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/LTL16806890153792049862.gal, -t, CGAL, -LTL, /tmp/LTL3096102692658421318.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/LTL16806890153792049862.gal -t CGAL -LTL /tmp/LTL3096102692658421318.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X("(((pl_P23_1==1)&&(pl_P34_3==1))&&(pl_P40_5==1))"))||("((pl_P10_1==1)&&(pl_P29_2==1))"))))
Formula 0 simplified : !F("((pl_P10_1==1)&&(pl_P29_2==1))" | X"(((pl_P23_1==1)&&(pl_P34_3==1))&&(pl_P40_5==1))")
Reverse transition relation is NOT exact ! Due to transitions t9, t35, t36, t37, t38, t40, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/45/6/51
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
16 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.215192,21472,1,0,118,24459,133,57,1575,18825,134
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Railroad-PT-005-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Railroad-PT-005-05 finished in 3381 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((p1 U (p2||G(p1)))||p0))))], workingDir=/home/mcc/execution]
Support contains 8 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 51/51 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 41 transition count 51
Applied a total of 1 rules in 1 ms. Remains 41 /42 variables (removed 1) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 41 cols
[2021-05-17 13:21:30] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 13:21:30] [INFO ] Implicit Places using invariants in 175 ms returned [16, 17, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 193 ms to find 3 implicit places.
// Phase 1: matrix 51 rows 38 cols
[2021-05-17 13:21:31] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 13:21:31] [INFO ] Dead Transitions using invariants and state equation in 188 ms returned []
Starting structural reductions, iteration 1 : 38/42 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 38 cols
[2021-05-17 13:21:31] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 13:21:31] [INFO ] Dead Transitions using invariants and state equation in 227 ms returned []
Finished structural reductions, in 2 iterations. Remains : 38/42 places, 51/51 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Railroad-PT-005-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s14 1) (NEQ s19 1) (NEQ s33 1) (AND (EQ s8 1) (EQ s34 1))), p2:(AND (OR (NEQ s8 1) (NEQ s34 1)) (OR (NEQ s15 1) (NEQ s16 1) (NEQ s25 1))), p1:(OR (NEQ s15 1) (NEQ s16 1) (NEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Product exploration explored 100000 steps with 50000 reset in 221 ms.
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 8 out of 38 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 38/38 places, 51/51 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 51
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 1 place count 38 transition count 67
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 6 place count 38 transition count 67
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 6 rules in 11 ms. Remains 38 /38 variables (removed 0) and now considering 67/51 (removed -16) transitions.
[2021-05-17 13:21:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 67 rows 38 cols
[2021-05-17 13:21:32] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 13:21:32] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 67/51 transitions.
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Product exploration explored 100000 steps with 50000 reset in 266 ms.
[2021-05-17 13:21:33] [INFO ] Flatten gal took : 6 ms
[2021-05-17 13:21:33] [INFO ] Flatten gal took : 5 ms
[2021-05-17 13:21:33] [INFO ] Time to serialize gal into /tmp/LTL940992936088159980.gal : 22 ms
[2021-05-17 13:21:33] [INFO ] Time to serialize properties into /tmp/LTL17345209762130668162.ltl : 11 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/LTL940992936088159980.gal, -t, CGAL, -LTL, /tmp/LTL17345209762130668162.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/LTL940992936088159980.gal -t CGAL -LTL /tmp/LTL17345209762130668162.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((("(((pl_P23_1==0)||(pl_P34_1==0))||(pl_P42_1==0))")||(("(((pl_P26_1==0)||(pl_P29_3==0))||(pl_P35_1==0))")U(("(((pl_P16_1==0)||(pl_P4_1==0))&&(((pl_P26_1==0)||(pl_P29_3==0))||(pl_P35_1==0)))")||(G("(((pl_P26_1==0)||(pl_P29_3==0))||(pl_P35_1==0))")))))||("((pl_P16_1==1)&&(pl_P4_1==1))")))))
Formula 0 simplified : !XF("(((pl_P23_1==0)||(pl_P34_1==0))||(pl_P42_1==0))" | "((pl_P16_1==1)&&(pl_P4_1==1))" | ("(((pl_P26_1==0)||(pl_P29_3==0))||(pl_P35_1==0))" U ("(((pl_P16_1==0)||(pl_P4_1==0))&&(((pl_P26_1==0)||(pl_P29_3==0))||(pl_P35_1==0)))" | G"(((pl_P26_1==0)||(pl_P29_3==0))||(pl_P35_1==0))")))
Reverse transition relation is NOT exact ! Due to transitions t9, t35, t36, t37, t38, t40, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/45/6/51
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
13 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.146293,22452,1,0,115,25564,148,54,1642,18753,119
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Railroad-PT-005-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Railroad-PT-005-06 finished in 2967 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 51/51 transitions.
Ensure Unique test removed 3 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 39 transition count 49
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 37 transition count 49
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 34 transition count 46
Applied a total of 10 rules in 6 ms. Remains 34 /42 variables (removed 8) and now considering 46/51 (removed 5) transitions.
// Phase 1: matrix 46 rows 34 cols
[2021-05-17 13:21:33] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 13:21:33] [INFO ] Implicit Places using invariants in 79 ms returned [14, 15, 16, 31]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 90 ms to find 4 implicit places.
[2021-05-17 13:21:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 46 rows 30 cols
[2021-05-17 13:21:33] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 13:21:33] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Starting structural reductions, iteration 1 : 30/42 places, 46/51 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 29 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 29 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 27 transition count 43
Applied a total of 6 rules in 4 ms. Remains 27 /30 variables (removed 3) and now considering 43/46 (removed 3) transitions.
// Phase 1: matrix 43 rows 27 cols
[2021-05-17 13:21:33] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 13:21:33] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 43 rows 27 cols
[2021-05-17 13:21:33] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 13:21:34] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 27/42 places, 43/51 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Railroad-PT-005-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s6 1) (EQ s13 1)), p0:(AND (EQ s12 1) (EQ s18 1) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 178 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 1 ms.
FORMULA Railroad-PT-005-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-005-07 finished in 770 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 51/51 transitions.
Ensure Unique test removed 3 places
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 39 transition count 48
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 36 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 34 transition count 46
Applied a total of 10 rules in 16 ms. Remains 34 /42 variables (removed 8) and now considering 46/51 (removed 5) transitions.
// Phase 1: matrix 46 rows 34 cols
[2021-05-17 13:21:34] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 13:21:34] [INFO ] Implicit Places using invariants in 81 ms returned [14, 15, 16, 31]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 92 ms to find 4 implicit places.
[2021-05-17 13:21:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 46 rows 30 cols
[2021-05-17 13:21:34] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 13:21:34] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Starting structural reductions, iteration 1 : 30/42 places, 46/51 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 29 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 29 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 27 transition count 43
Applied a total of 6 rules in 5 ms. Remains 27 /30 variables (removed 3) and now considering 43/46 (removed 3) transitions.
// Phase 1: matrix 43 rows 27 cols
[2021-05-17 13:21:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:34] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 43 rows 27 cols
[2021-05-17 13:21:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:34] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 27/42 places, 43/51 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-005-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s19 1) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1863 reset in 110 ms.
Stack based approach found an accepted trace after 70 steps with 0 reset with depth 71 and stack size 71 in 1 ms.
FORMULA Railroad-PT-005-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-005-09 finished in 522 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 51/51 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 39 transition count 50
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 39 transition count 47
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 36 transition count 47
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 33 transition count 44
Applied a total of 14 rules in 18 ms. Remains 33 /42 variables (removed 9) and now considering 44/51 (removed 7) transitions.
// Phase 1: matrix 44 rows 33 cols
[2021-05-17 13:21:35] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 13:21:35] [INFO ] Implicit Places using invariants in 48 ms returned [14, 16, 17, 32]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 ms to find 4 implicit places.
[2021-05-17 13:21:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 29 cols
[2021-05-17 13:21:35] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 13:21:35] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Starting structural reductions, iteration 1 : 29/42 places, 44/51 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 29 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 28 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7 place count 25 transition count 41
Applied a total of 7 rules in 3 ms. Remains 25 /29 variables (removed 4) and now considering 41/44 (removed 3) transitions.
// Phase 1: matrix 41 rows 25 cols
[2021-05-17 13:21:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:35] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2021-05-17 13:21:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:35] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 25/42 places, 41/51 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-005-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s12 1) (NEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3737 reset in 133 ms.
Stack based approach found an accepted trace after 135 steps with 4 reset with depth 36 and stack size 36 in 0 ms.
FORMULA Railroad-PT-005-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-005-10 finished in 635 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0)&&((p1||X(p1)) U p2)) U X(p3)))], workingDir=/home/mcc/execution]
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 51/51 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 39 transition count 51
Applied a total of 3 rules in 14 ms. Remains 39 /42 variables (removed 3) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 39 cols
[2021-05-17 13:21:35] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 13:21:35] [INFO ] Implicit Places using invariants in 54 ms returned [14, 15, 16, 35]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 55 ms to find 4 implicit places.
// Phase 1: matrix 51 rows 35 cols
[2021-05-17 13:21:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:35] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Starting structural reductions, iteration 1 : 35/42 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 35 cols
[2021-05-17 13:21:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:35] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 2 iterations. Remains : 35/42 places, 51/51 transitions.
Stuttering acceptance computed with spot in 387 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Railroad-PT-005-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=8 dest: 7}, { cond=(NOT p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s21 1) (EQ s27 1)), p2:(AND (EQ s13 1) (EQ s17 1) (EQ s27 1)), p1:(AND (EQ s13 1) (EQ s19 1) (EQ s27 1)), p3:(OR (EQ s13 0) (EQ s17 0) (EQ s27 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Knowledge obtained : [(NOT p0), (NOT p2), (NOT p1), p3]
Adopting property with smaller alphabet thanks to knowledge :(NOT p0)
Stuttering acceptance computed with spot in 71 ms :[true, (AND (NOT p0) (NOT p3)), (NOT p3)]
Support contains 4 out of 35 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 35/35 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 35 cols
[2021-05-17 13:21:36] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:36] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 51 rows 35 cols
[2021-05-17 13:21:36] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:36] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 35 cols
[2021-05-17 13:21:36] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:36] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 51/51 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, (AND (NOT p0) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) (NOT p3)), (NOT p3)]
Support contains 4 out of 35 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 35/35 places, 51/51 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 35 transition count 51
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 2 place count 35 transition count 67
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 35 transition count 67
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 33 transition count 65
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 33 transition count 65
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 12 rules in 8 ms. Remains 33 /35 variables (removed 2) and now considering 65/51 (removed -14) transitions.
[2021-05-17 13:21:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 65 rows 33 cols
[2021-05-17 13:21:37] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:37] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/35 places, 65/51 transitions.
Product exploration explored 100000 steps with 50000 reset in 330 ms.
Product exploration explored 100000 steps with 50000 reset in 264 ms.
Starting structural reductions, iteration 0 : 35/35 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 35 cols
[2021-05-17 13:21:37] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:38] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 51 rows 35 cols
[2021-05-17 13:21:38] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:38] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 35 cols
[2021-05-17 13:21:38] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 13:21:38] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 51/51 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:789)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1621257698365

--------------------
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-005"
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-005, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089415700413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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