Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 6.6K Apr 29 20:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 29 20:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 20:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 20:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 186K May 10 09:33 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 BART-COL-005-LTLFireability-00
FORMULA_NAME BART-COL-005-LTLFireability-01
FORMULA_NAME BART-COL-005-LTLFireability-02
FORMULA_NAME BART-COL-005-LTLFireability-03
FORMULA_NAME BART-COL-005-LTLFireability-04
FORMULA_NAME BART-COL-005-LTLFireability-05
FORMULA_NAME BART-COL-005-LTLFireability-06
FORMULA_NAME BART-COL-005-LTLFireability-07
FORMULA_NAME BART-COL-005-LTLFireability-08
FORMULA_NAME BART-COL-005-LTLFireability-09
FORMULA_NAME BART-COL-005-LTLFireability-10
FORMULA_NAME BART-COL-005-LTLFireability-11
FORMULA_NAME BART-COL-005-LTLFireability-12
FORMULA_NAME BART-COL-005-LTLFireability-13
FORMULA_NAME BART-COL-005-LTLFireability-14
FORMULA_NAME BART-COL-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652666513529

Running Version 202205111006
[2022-05-16 02:01:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:01:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:01:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 02:01:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 02:01:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 776 ms
[2022-05-16 02:01:55] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2022-05-16 02:01:55] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 11603 PT places and 7.03614756E9 transition bindings in 100 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 02:01:56] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 5 ms.
[2022-05-16 02:01:56] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Arc [1:1*[(MOD (ADD $tsp 1) 6), $ds2]] contains successor/predecessor on variables of sort speed
Symmetric sort wr.t. initial and guards and successors and join/free detected :trainid
Symmetric sort wr.t. initial detected :trainid
Symmetric sort wr.t. initial and guards detected :trainid
Applying symmetric unfolding of full symmetric sort :trainid domain size was 5
[2022-05-16 02:01:56] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 280 ms.
[2022-05-16 02:01:56] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
[2022-05-16 02:01:56] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:01:56] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:01:56] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:01:56] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:01:56] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:01:56] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:01:56] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:01:56] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:01:56] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 2 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-005-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-005-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-005-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 132 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:01:56] [INFO ] Computed 1 place invariants in 14 ms
[2022-05-16 02:01:56] [INFO ] Implicit Places using invariants in 223 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:01:56] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-16 02:01:56] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:01:56] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 02:01:57] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2022-05-16 02:01:57] [INFO ] Flatten gal took : 73 ms
[2022-05-16 02:01:57] [INFO ] Flatten gal took : 27 ms
[2022-05-16 02:01:57] [INFO ] Input system was already deterministic with 202 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:01:57] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:01:57] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA BART-COL-005-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X((X(G(p1))&&F(p0)))))'
Support contains 69 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 12 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:01:58] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:01:58] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:01:58] [INFO ] Computed 1 place invariants in 15 ms
[2022-05-16 02:01:58] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:01:58] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:01:58] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND p0 p1), (AND p1 p0), p1, (AND p1 p0)]
Running random walk in product with property : BART-COL-005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1 1), p1:(OR (GEQ s20 1) (GEQ s121 1) (GEQ s22 1) (GEQ s119 1) (GEQ s24 1) (GEQ s125 1) (GEQ s26 1) (GEQ s123 1) (GEQ s12 1) (GEQ s113 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1386 reset in 355 ms.
Stack based approach found an accepted trace after 952 steps with 12 reset with depth 65 and stack size 65 in 3 ms.
FORMULA BART-COL-005-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-005-LTLFireability-00 finished in 933 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X((X(p1)||p0))))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 23 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:01:59] [INFO ] Computed 1 place invariants in 12 ms
[2022-05-16 02:01:59] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:01:59] [INFO ] Computed 1 place invariants in 14 ms
[2022-05-16 02:01:59] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:01:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:01:59] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (GEQ s78 1) (GEQ s77 1) (GEQ s85 1) (GEQ s88 1) (GEQ s86 1) (GEQ s87 1) (GEQ s42 1) (GEQ s41 1) (GEQ s79 1)), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 211 ms.
Stack based approach found an accepted trace after 533 steps with 0 reset with depth 534 and stack size 534 in 2 ms.
FORMULA BART-COL-005-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-005-LTLFireability-04 finished in 660 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X((G(X((F(p0) U X(G(p1)))))||X(p2)))))))'
Support contains 69 out of 132 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 29 rules applied. Total rules applied 32 place count 129 transition count 173
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 102 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 102 transition count 172
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 98 transition count 168
Applied a total of 68 rules in 22 ms. Remains 98 /132 variables (removed 34) and now considering 168/202 (removed 34) transitions.
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:01:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:01:59] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:01:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:01:59] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2022-05-16 02:01:59] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:01:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:01:59] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/132 places, 168/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/132 places, 168/202 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BART-COL-005-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (GEQ s20 1) (GEQ s90 1) (GEQ s22 1) (GEQ s88 1) (GEQ s24 1) (GEQ s94 1) (GEQ s26 1) (GEQ s92 1) (GEQ s12 1) (GEQ s82 1) (GEQ s14 1) (GEQ s80 1) (GE...], 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 1161 reset in 153 ms.
Product exploration explored 100000 steps with 1169 reset in 248 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 12 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 69 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:01] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:01] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:02:01] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-05-16 02:02:01] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:01] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 12 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 4 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1173 reset in 224 ms.
Product exploration explored 100000 steps with 1161 reset in 258 ms.
Built C files in :
/tmp/ltsmin8411202509936942305
[2022-05-16 02:02:02] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2022-05-16 02:02:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:02] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2022-05-16 02:02:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:02] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2022-05-16 02:02:02] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:02] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8411202509936942305
Running compilation step : cd /tmp/ltsmin8411202509936942305;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1085 ms.
Running link step : cd /tmp/ltsmin8411202509936942305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin8411202509936942305;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15202693159211605893.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 69 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:17] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:17] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 02:02:17] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2022-05-16 02:02:17] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:17] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:02:17] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 168/168 transitions.
Built C files in :
/tmp/ltsmin1254148881950023258
[2022-05-16 02:02:17] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2022-05-16 02:02:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:17] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2022-05-16 02:02:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:17] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2022-05-16 02:02:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:17] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1254148881950023258
Running compilation step : cd /tmp/ltsmin1254148881950023258;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 219 ms.
Running link step : cd /tmp/ltsmin1254148881950023258;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin1254148881950023258;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2556110093502326410.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:02:32] [INFO ] Flatten gal took : 19 ms
[2022-05-16 02:02:32] [INFO ] Flatten gal took : 17 ms
[2022-05-16 02:02:32] [INFO ] Time to serialize gal into /tmp/LTL9075986721564701559.gal : 5 ms
[2022-05-16 02:02:32] [INFO ] Time to serialize properties into /tmp/LTL5949759534774223887.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9075986721564701559.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5949759534774223887.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9075986...266
Read 1 LTL properties
Checking formula 0 : !((G(X(F(X((G(X((F("(TrainState_42>=1)"))U(X(G("(TrainState_0>=1)"))))))||(X("((((((((TrainState_61>=1)||(TrainState_191>=1))||((Train...1625
Formula 0 simplified : !GXFX(GX(F"(TrainState_42>=1)" U XG"(TrainState_0>=1)") | X"((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(T...1602
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
16 unique states visited
0 strongly connected components in search stack
17 transitions explored
9 items max in DFS search stack
29 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.336213,31300,1,0,39,67232,43,10,3162,44727,145
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-COL-005-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-COL-005-LTLFireability-05 finished in 33681 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (!F(p1) U p0)))'
Support contains 69 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 4 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:02:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:33] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:02:33] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 02:02:33] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:02:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:33] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), true, p1]
Running random walk in product with property : BART-COL-005-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s1 1), p1:(OR (GEQ s20 1) (GEQ s121 1) (GEQ s22 1) (GEQ s119 1) (GEQ s24 1) (GEQ s125 1) (GEQ s26 1) (GEQ s123 1) (GEQ s12 1) (GEQ s113 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-005-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-005-LTLFireability-06 finished in 351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((G(F(G(p0)))&&p1)))))'
Support contains 70 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 29 rules applied. Total rules applied 32 place count 129 transition count 173
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 102 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 102 transition count 172
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 98 transition count 168
Applied a total of 68 rules in 10 ms. Remains 98 /132 variables (removed 34) and now considering 168/202 (removed 34) transitions.
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:33] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:33] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2022-05-16 02:02:33] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:33] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:02:33] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/132 places, 168/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/132 places, 168/202 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-COL-005-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s0 1), p1:(OR (LT s1 1) (AND (LT s20 1) (LT s90 1) (LT s22 1) (LT s88 1) (LT s24 1) (LT s94 1) (LT s26 1) (LT s92 1) (LT s12 1) (LT s82 1) (LT s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 119 ms.
Stack based approach found an accepted trace after 288 steps with 0 reset with depth 289 and stack size 289 in 0 ms.
FORMULA BART-COL-005-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-005-LTLFireability-07 finished in 405 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F((X(p0)||p1))))))'
Support contains 69 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 29 rules applied. Total rules applied 32 place count 129 transition count 173
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 102 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 102 transition count 172
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 98 transition count 168
Applied a total of 68 rules in 36 ms. Remains 98 /132 variables (removed 34) and now considering 168/202 (removed 34) transitions.
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:34] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:34] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:02:34] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2022-05-16 02:02:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:34] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:34] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/132 places, 168/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/132 places, 168/202 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-COL-005-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s1 1), p0:(OR (GEQ s20 1) (GEQ s90 1) (GEQ s22 1) (GEQ s88 1) (GEQ s24 1) (GEQ s94 1) (GEQ s26 1) (GEQ s92 1) (GEQ s12 1) (GEQ s82 1) (GEQ s14 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 199 reset in 129 ms.
Product exploration explored 100000 steps with 180 reset in 246 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 974 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:36] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:36] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-05-16 02:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:02:36] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2022-05-16 02:02:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:02:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:02:36] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-05-16 02:02:36] [INFO ] Computed and/alt/rep : 132/236/132 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-16 02:02:37] [INFO ] Added : 132 causal constraints over 27 iterations in 611 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 69 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:37] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:37] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:37] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:37] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2022-05-16 02:02:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:37] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:37] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:37] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:02:38] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-05-16 02:02:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:02:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:02:38] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-16 02:02:38] [INFO ] Computed and/alt/rep : 132/236/132 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 02:02:38] [INFO ] Added : 132 causal constraints over 27 iterations in 237 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 196 reset in 160 ms.
Product exploration explored 100000 steps with 205 reset in 185 ms.
Built C files in :
/tmp/ltsmin15928352298142455844
[2022-05-16 02:02:38] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2022-05-16 02:02:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:38] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2022-05-16 02:02:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:38] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2022-05-16 02:02:38] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:38] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15928352298142455844
Running compilation step : cd /tmp/ltsmin15928352298142455844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 230 ms.
Running link step : cd /tmp/ltsmin15928352298142455844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin15928352298142455844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6875943575537543281.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 69 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:54] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:02:54] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:54] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2022-05-16 02:02:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:02:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:54] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 168/168 transitions.
Built C files in :
/tmp/ltsmin1104012635955234243
[2022-05-16 02:02:54] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2022-05-16 02:02:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:54] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2022-05-16 02:02:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:54] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2022-05-16 02:02:54] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:02:54] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1104012635955234243
Running compilation step : cd /tmp/ltsmin1104012635955234243;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 736 ms.
Running link step : cd /tmp/ltsmin1104012635955234243;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin1104012635955234243;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7176356268959663643.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:03:09] [INFO ] Flatten gal took : 19 ms
[2022-05-16 02:03:09] [INFO ] Flatten gal took : 11 ms
[2022-05-16 02:03:09] [INFO ] Time to serialize gal into /tmp/LTL12403680813688019625.gal : 2 ms
[2022-05-16 02:03:09] [INFO ] Time to serialize properties into /tmp/LTL7404662363999205399.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12403680813688019625.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7404662363999205399.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1240368...267
Read 1 LTL properties
Checking formula 0 : !((X(G(X(F((X("((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainState_189>=1)))||(((TrainState_65>=1)||(Tra...1586
Formula 0 simplified : !XGXF("(TrainState_42>=1)" | X"((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainState_189>=1)))||(((Train...1573
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
32 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.361311,27160,1,0,10,56571,29,1,2943,35582,27
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-COL-005-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-COL-005-LTLFireability-08 finished in 35854 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))||(X(X(p0)) U G(p1))))'
Support contains 69 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 2 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:03:09] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:03:10] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:03:10] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-16 02:03:10] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:03:10] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:03:10] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : BART-COL-005-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}, { cond=p1, acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 2}, { cond=p1, acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 4}, { cond=(AND p1 p0), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(OR (GEQ s20 1) (GEQ s121 1) (GEQ s22 1) (GEQ s119 1) (GEQ s24 1) (GEQ s125 1) (GEQ s26 1) (GEQ s123 1) (GEQ s12 1) (GEQ s113 1) (GEQ s14 1) (GEQ s111 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 375 ms.
Product exploration explored 100000 steps with 50000 reset in 466 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 6 factoid took 306 ms. Reduced automaton from 10 states, 20 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BART-COL-005-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-005-LTLFireability-09 finished in 1711 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p1)||G(p2))&&p0)))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 132 transition count 138
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 68 transition count 138
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 128 place count 68 transition count 134
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 136 place count 64 transition count 134
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 142 place count 58 transition count 128
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 58 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 149 place count 58 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 54 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 54 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 51 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 51 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 48 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 48 transition count 117
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 171 place count 46 transition count 115
Iterating global reduction 3 with 2 rules applied. Total rules applied 173 place count 46 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 175 place count 44 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 44 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 178 place count 43 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 43 transition count 112
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 193 place count 36 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 36 transition count 101
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 4 with 4 rules applied. Total rules applied 201 place count 34 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 205 place count 34 transition count 95
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 5 with 4 rules applied. Total rules applied 209 place count 32 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 213 place count 32 transition count 89
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 6 with 4 rules applied. Total rules applied 217 place count 30 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 221 place count 30 transition count 83
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 7 with 4 rules applied. Total rules applied 225 place count 28 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 229 place count 28 transition count 77
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 8 with 4 rules applied. Total rules applied 233 place count 26 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 237 place count 26 transition count 71
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 9 with 4 rules applied. Total rules applied 241 place count 24 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 245 place count 24 transition count 65
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 10 with 4 rules applied. Total rules applied 249 place count 22 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 253 place count 22 transition count 59
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 11 with 4 rules applied. Total rules applied 257 place count 20 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 261 place count 20 transition count 53
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 12 with 4 rules applied. Total rules applied 265 place count 18 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 269 place count 18 transition count 47
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 13 with 4 rules applied. Total rules applied 273 place count 16 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 277 place count 16 transition count 41
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 14 with 4 rules applied. Total rules applied 281 place count 14 transition count 39
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 285 place count 14 transition count 35
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 15 with 4 rules applied. Total rules applied 289 place count 12 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 293 place count 12 transition count 29
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 16 with 4 rules applied. Total rules applied 297 place count 10 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 301 place count 10 transition count 23
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 17 with 4 rules applied. Total rules applied 305 place count 8 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 309 place count 8 transition count 17
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 18 with 4 rules applied. Total rules applied 313 place count 6 transition count 15
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 317 place count 6 transition count 11
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 19 with 4 rules applied. Total rules applied 321 place count 4 transition count 9
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 326 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 328 place count 3 transition count 3
Applied a total of 328 rules in 60 ms. Remains 3 /132 variables (removed 129) and now considering 3/202 (removed 199) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 02:03:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:03:11] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 02:03:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:03:11] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2022-05-16 02:03:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 02:03:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:03:11] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/132 places, 3/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/132 places, 3/202 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BART-COL-005-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s1 1) (GEQ s0 1)), p1:(LT s0 1), p2:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5273 reset in 79 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA BART-COL-005-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-005-LTLFireability-10 finished in 495 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(!G(p1))))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 100 transition count 170
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 100 transition count 170
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 91 place count 73 transition count 143
Iterating global reduction 0 with 27 rules applied. Total rules applied 118 place count 73 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 69 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 69 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 66 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 66 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 63 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 60 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 60 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 57 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 57 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 54 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 54 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 52 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 162 place count 50 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 49 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 49 transition count 119
Applied a total of 166 rules in 9 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 02:03:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:03:12] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 02:03:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:03:12] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 02:03:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:03:12] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/132 places, 119/202 transitions.
Stuttering acceptance computed with spot in 147 ms :[p1, p1]
Running random walk in product with property : BART-COL-005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s1 1) (LT s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BART-COL-005-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-005-LTLFireability-12 finished in 737 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(X(X(p1))))||p0)))'
Support contains 121 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:03:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:03:12] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:03:12] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 02:03:13] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:03:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:03:13] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BART-COL-005-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s20 1) (GEQ s24 1) (GEQ s12 1) (GEQ s73 1) (GEQ s16 1) (GEQ s65 1) (GEQ s8 1) (GEQ s69 1) (GEQ s57 1) (GEQ s61 1) (GEQ s48 1) (GEQ s105 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4327 reset in 249 ms.
Product exploration explored 100000 steps with 4273 reset in 252 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:03:14] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:03:14] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:03:14] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2022-05-16 02:03:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:03:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:03:15] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-05-16 02:03:15] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-16 02:03:15] [INFO ] Added : 166 causal constraints over 34 iterations in 373 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 121 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 9 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:03:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:03:15] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:03:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:03:15] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:03:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:03:15] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:03:16] [INFO ] Computed 1 place invariants in 21 ms
[2022-05-16 02:03:16] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:03:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:03:16] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2022-05-16 02:03:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:03:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:03:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:03:16] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-05-16 02:03:16] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 02:03:16] [INFO ] Added : 166 causal constraints over 34 iterations in 309 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4439 reset in 177 ms.
Product exploration explored 100000 steps with 4337 reset in 187 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 121 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 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 132 transition count 202
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 132 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 130 transition count 200
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 130 transition count 200
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 10 rules in 10 ms. Remains 130 /132 variables (removed 2) and now considering 200/202 (removed 2) transitions.
[2022-05-16 02:03:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 200 rows 130 cols
[2022-05-16 02:03:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:03:17] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/132 places, 200/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/132 places, 200/202 transitions.
Product exploration explored 100000 steps with 4165 reset in 266 ms.
Product exploration explored 100000 steps with 4333 reset in 259 ms.
Built C files in :
/tmp/ltsmin17015708062959898095
[2022-05-16 02:03:18] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17015708062959898095
Running compilation step : cd /tmp/ltsmin17015708062959898095;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 227 ms.
Running link step : cd /tmp/ltsmin17015708062959898095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 18 ms.
Running LTSmin : cd /tmp/ltsmin17015708062959898095;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13341446530646869771.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 121 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 0 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:03:33] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-16 02:03:33] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:03:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:03:33] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:03:33] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:03:33] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Built C files in :
/tmp/ltsmin2255264855762351118
[2022-05-16 02:03:33] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2255264855762351118
Running compilation step : cd /tmp/ltsmin2255264855762351118;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 232 ms.
Running link step : cd /tmp/ltsmin2255264855762351118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin2255264855762351118;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1311979059332967977.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:03:48] [INFO ] Flatten gal took : 17 ms
[2022-05-16 02:03:48] [INFO ] Flatten gal took : 15 ms
[2022-05-16 02:03:48] [INFO ] Time to serialize gal into /tmp/LTL1865712205582644861.gal : 10 ms
[2022-05-16 02:03:48] [INFO ] Time to serialize properties into /tmp/LTL14387315482735248911.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1865712205582644861.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14387315482735248911.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1865712...267
Read 1 LTL properties
Checking formula 0 : !((G((((((((X(F(X(X("((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainState_189>=1)))||(((TrainState_65>=1)...3569
Formula 0 simplified : !G("((((((TrainState_101>=1)||(TrainState_105>=1))||((TrainState_92>=1)||(TrainState_157>=1)))||(((TrainState_96>=1)||(TrainState_14...3538
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
92 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.955107,49056,1,0,36,175476,51,2,4005,114420,92
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-COL-005-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BART-COL-005-LTLFireability-13 finished in 37024 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((false U true)))'
Support contains 0 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 202 edges and 132 vertex of which 132 / 132 are part of one of the 1 SCC in 3 ms
Free SCC test removed 131 places
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 18 ms. Remains 0 /132 variables (removed 132) and now considering 1/202 (removed 201) transitions.
[2022-05-16 02:03:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 02:03:49] [INFO ] Implicit Places using invariants in 6 ms returned []
[2022-05-16 02:03:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 02:03:49] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2022-05-16 02:03:49] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 02:03:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 02:03:49] [INFO ] Dead Transitions using invariants and state equation in 4 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 0/132 places, 1/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 0/132 places, 1/202 transitions.
Stuttering acceptance computed with spot in 115 ms :[false]
Running random walk in product with property : BART-COL-005-LTLFireability-14 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA BART-COL-005-LTLFireability-14 TRUE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-005-LTLFireability-14 finished in 174 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (X(!p0) U !F(X(p1)))))'
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:03:50] [INFO ] Computed 1 place invariants in 14 ms
[2022-05-16 02:03:50] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:03:50] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:03:50] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:03:50] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:03:50] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 156 ms :[p1, (AND p1 p0), p1, true, p1]
Running random walk in product with property : BART-COL-005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (LT s78 1) (LT s77 1) (LT s108 1) (LT s111 1) (LT s109 1) (LT s110 1) (LT s42 1) (LT s41 1) (LT s79 1)), p1:(OR (GEQ s20 1) (GEQ s124 1) (GEQ s22 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-005-LTLFireability-15 finished in 432 ms.
All properties solved by simple procedures.
Total runtime 115592 ms.

BK_STOP 1652666630631

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BART-COL-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 BART-COL-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 r006-tajo-165245689500540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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