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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 5.5K Apr 29 22:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 29 22:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 21:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 21:04 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.5K May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:06 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 219K 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-060-LTLFireability-00
FORMULA_NAME BART-COL-060-LTLFireability-01
FORMULA_NAME BART-COL-060-LTLFireability-02
FORMULA_NAME BART-COL-060-LTLFireability-03
FORMULA_NAME BART-COL-060-LTLFireability-04
FORMULA_NAME BART-COL-060-LTLFireability-05
FORMULA_NAME BART-COL-060-LTLFireability-06
FORMULA_NAME BART-COL-060-LTLFireability-07
FORMULA_NAME BART-COL-060-LTLFireability-08
FORMULA_NAME BART-COL-060-LTLFireability-09
FORMULA_NAME BART-COL-060-LTLFireability-10
FORMULA_NAME BART-COL-060-LTLFireability-11
FORMULA_NAME BART-COL-060-LTLFireability-12
FORMULA_NAME BART-COL-060-LTLFireability-13
FORMULA_NAME BART-COL-060-LTLFireability-14
FORMULA_NAME BART-COL-060-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652667127182

Running Version 202205111006
[2022-05-16 02:12:08] [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:12:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:12:08] [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:12:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 02:12:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 637 ms
[2022-05-16 02:12:09] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2022-05-16 02:12:09] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 25133 PT places and 8.443377072E10 transition bindings in 61 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:12:09] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 5 ms.
[2022-05-16 02:12:09] [INFO ] Skeletonized 16 HLPN properties in 0 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.
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 60
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Arc [2:1*[(MOD (ADD $tsp 1) 6), $ds2]] contains successor/predecessor on variables of sort speed
[2022-05-16 02:12:09] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 221 ms.
[2022-05-16 02:12:09] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
[2022-05-16 02:12:09] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:12:09] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:12:09] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:12:09] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:12:09] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:12:09] [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-060-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-060-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-060-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-060-LTLFireability-15 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 5 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:12:09] [INFO ] Computed 1 place invariants in 9 ms
[2022-05-16 02:12:09] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:12:09] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:12:09] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:12:09] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:12:10] [INFO ] Dead Transitions using invariants and state equation in 104 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:12:10] [INFO ] Flatten gal took : 28 ms
[2022-05-16 02:12:10] [INFO ] Flatten gal took : 18 ms
[2022-05-16 02:12:10] [INFO ] Input system was already deterministic with 202 transitions.
Finished random walk after 489 steps, including 0 resets, run visited all 8 properties in 11 ms. (steps per millisecond=44 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(G(!(X(p0)&&p1))) U F(p2)))'
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 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:12:10] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:12:10] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:12:10] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:10] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-05-16 02:12:10] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:12:10] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:10] [INFO ] Dead Transitions using invariants and state equation in 90 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 130 ms :[(NOT p2)]
Running random walk in product with property : BART-COL-060-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (GEQ s1 1) (OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s80 1) (GEQ s12 1) (GEQ s78 1) (GEQ s14 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 568 reset in 414 ms.
Product exploration explored 100000 steps with 583 reset in 338 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 p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
Finished random walk after 550 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=275 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:12:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:12] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 02:12:12] [INFO ] Computed and/alt/rep : 132/236/132 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 02:12:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:12:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:12:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:12] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2022-05-16 02:12:12] [INFO ] Computed and/alt/rep : 132/236/132 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-16 02:12:12] [INFO ] Added : 130 causal constraints over 27 iterations in 331 ms. Result :sat
Could not prove EG (NOT p2)
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 7 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:12:12] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:12:12] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:12:12] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 02:12:12] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2022-05-16 02:12:12] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:12:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:13] [INFO ] Dead Transitions using invariants and state equation in 96 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 : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 275 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p2)]
Finished random walk after 611 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=305 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:12:13] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:12:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:13] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-16 02:12:13] [INFO ] Computed and/alt/rep : 132/236/132 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-16 02:12:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:12:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:12:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:14] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-16 02:12:14] [INFO ] Computed and/alt/rep : 132/236/132 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-16 02:12:14] [INFO ] Added : 130 causal constraints over 27 iterations in 369 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 30 ms :[(NOT p2)]
Product exploration explored 100000 steps with 573 reset in 458 ms.
Product exploration explored 100000 steps with 563 reset in 298 ms.
Built C files in :
/tmp/ltsmin8821152329202600666
[2022-05-16 02:12:15] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2022-05-16 02:12:15] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:15] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2022-05-16 02:12:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:15] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2022-05-16 02:12:15] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:15] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8821152329202600666
Running compilation step : cd /tmp/ltsmin8821152329202600666;'/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 477 ms.
Running link step : cd /tmp/ltsmin8821152329202600666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin8821152329202600666;'/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/stateBased2549455422919254715.hoa' '--buchi-type=spotba'
LTSmin run took 536 ms.
FORMULA BART-COL-060-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-060-LTLFireability-00 finished in 5989 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||p1))||G(p2)))'
Support contains 98 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 3 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:12:16] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:12:16] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:12:16] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:12:16] [INFO ] Implicit Places using invariants and state equation in 89 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:12:16] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:12:16] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BART-COL-060-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (GEQ s98 1) (GEQ s49 1) (GEQ s102 1) (GEQ s53 1) (GEQ s106 1) (GEQ s57 1) (GEQ s61 1) (GEQ s65 1) (GEQ s69 1) (GEQ s8 1) (GEQ s73 1) (GEQ s12 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 350 ms.
Product exploration explored 100000 steps with 50000 reset in 245 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) p1 p2), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BART-COL-060-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-060-LTLFireability-02 finished in 1253 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G((F(p0)&&!p0))||G(!p0)))))'
Support contains 1 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 1 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.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. 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
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 328 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 330 place count 2 transition count 2
Applied a total of 330 rules in 54 ms. Remains 2 /132 variables (removed 130) and now considering 2/202 (removed 200) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 02:12:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:12:17] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 02:12:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:12:17] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-16 02:12:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 02:12:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:12:17] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/132 places, 2/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/132 places, 2/202 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : BART-COL-060-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 48 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA BART-COL-060-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-060-LTLFireability-04 finished in 213 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(p1)||p0)) U G((G(p1)&&G(p2))))))'
Support contains 78 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:12:17] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:12:17] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:12:18] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 02:12:18] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:12:18] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:12:18] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), true]
Running random walk in product with property : BART-COL-060-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s114 1) (GEQ s12 1) (GEQ s112 1) (GEQ s14 1) (GEQ s118 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 73 steps with 25 reset in 1 ms.
FORMULA BART-COL-060-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-05 finished in 679 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(!(F(p1)||p0) U p1)||(G(p2) U p3))))'
Support contains 122 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:12:18] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:12:18] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:12:18] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:12:18] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:12:18] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:12:18] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (AND p1 (NOT p3)), (OR (NOT p2) (NOT p3)), true, (AND p1 (NOT p3))]
Running random walk in product with property : BART-COL-060-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p3 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s114 1) (GEQ s12 1) (GEQ s112 1) (GEQ s14 1) (GEQ s118 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 66941 steps with 0 reset in 190 ms.
FORMULA BART-COL-060-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-06 finished in 658 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 68 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 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 30 rules applied. Total rules applied 33 place count 129 transition count 172
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 60 place count 102 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 101 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 101 transition count 171
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 70 place count 97 transition count 167
Applied a total of 70 rules in 28 ms. Remains 97 /132 variables (removed 35) and now considering 167/202 (removed 35) transitions.
// Phase 1: matrix 167 rows 97 cols
[2022-05-16 02:12:19] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:12:19] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 167 rows 97 cols
[2022-05-16 02:12:19] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:12:19] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2022-05-16 02:12:19] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 167 rows 97 cols
[2022-05-16 02:12:19] [INFO ] Computed 1 place invariants in 20 ms
[2022-05-16 02:12:19] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/132 places, 167/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/132 places, 167/202 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-060-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s44 1) (GEQ s42 1) (GEQ s1 1) (GEQ s3 1) (GEQ s5 1) (GEQ s7 1) (GEQ s9 1) (GEQ s79 1) (GEQ s11 1) (GEQ s77 1) (GEQ s13 1) (GEQ s83 1) (GEQ s15...], 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 4 reset in 194 ms.
Product exploration explored 100000 steps with 0 reset in 374 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 p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 167 rows 97 cols
[2022-05-16 02:12:20] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:12:20] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:20] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2022-05-16 02:12:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:12:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:12:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:21] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-05-16 02:12:21] [INFO ] Computed and/alt/rep : 131/235/131 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-16 02:12:21] [INFO ] Added : 90 causal constraints over 19 iterations in 218 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 68 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 167/167 transitions.
Applied a total of 0 rules in 7 ms. Remains 97 /97 variables (removed 0) and now considering 167/167 (removed 0) transitions.
// Phase 1: matrix 167 rows 97 cols
[2022-05-16 02:12:21] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:12:21] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 167 rows 97 cols
[2022-05-16 02:12:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:21] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-05-16 02:12:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 167 rows 97 cols
[2022-05-16 02:12:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:21] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/97 places, 167/167 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 167 rows 97 cols
[2022-05-16 02:12:22] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:12:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:12:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:22] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2022-05-16 02:12:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:12:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:12:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:22] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-16 02:12:22] [INFO ] Computed and/alt/rep : 131/235/131 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-16 02:12:22] [INFO ] Added : 90 causal constraints over 19 iterations in 222 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 259 ms.
Product exploration explored 100000 steps with 0 reset in 314 ms.
Built C files in :
/tmp/ltsmin13962100493977206113
[2022-05-16 02:12:23] [INFO ] Computing symmetric may disable matrix : 167 transitions.
[2022-05-16 02:12:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:23] [INFO ] Computing symmetric may enable matrix : 167 transitions.
[2022-05-16 02:12:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:23] [INFO ] Computing Do-Not-Accords matrix : 167 transitions.
[2022-05-16 02:12:23] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:23] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13962100493977206113
Running compilation step : cd /tmp/ltsmin13962100493977206113;'/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 348 ms.
Running link step : cd /tmp/ltsmin13962100493977206113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13962100493977206113;'/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/stateBased11749323126208038914.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 68 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 167/167 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 167/167 (removed 0) transitions.
// Phase 1: matrix 167 rows 97 cols
[2022-05-16 02:12:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:38] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 167 rows 97 cols
[2022-05-16 02:12:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:38] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2022-05-16 02:12:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 167 rows 97 cols
[2022-05-16 02:12:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:38] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/97 places, 167/167 transitions.
Built C files in :
/tmp/ltsmin14387662351811778068
[2022-05-16 02:12:38] [INFO ] Computing symmetric may disable matrix : 167 transitions.
[2022-05-16 02:12:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:38] [INFO ] Computing symmetric may enable matrix : 167 transitions.
[2022-05-16 02:12:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:38] [INFO ] Computing Do-Not-Accords matrix : 167 transitions.
[2022-05-16 02:12:38] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:38] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14387662351811778068
Running compilation step : cd /tmp/ltsmin14387662351811778068;'/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 259 ms.
Running link step : cd /tmp/ltsmin14387662351811778068;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin14387662351811778068;'/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/stateBased1943597265508397189.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:12:53] [INFO ] Flatten gal took : 6 ms
[2022-05-16 02:12:53] [INFO ] Flatten gal took : 6 ms
[2022-05-16 02:12:53] [INFO ] Time to serialize gal into /tmp/LTL6480253541286592901.gal : 1 ms
[2022-05-16 02:12:53] [INFO ] Time to serialize properties into /tmp/LTL4193579423807990887.ltl : 0 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/LTL6480253541286592901.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4193579423807990887.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/LTL6480253...266
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||(((TrainState_47>=1)||(TrainState_4...1551
Formula 0 simplified : !GF"((((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||(((TrainState_47>=1)||(TrainState_49>...1545
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 02:13:09] [INFO ] Flatten gal took : 8 ms
[2022-05-16 02:13:09] [INFO ] Applying decomposition
[2022-05-16 02:13:09] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7401338046383496910.txt' '-o' '/tmp/graph7401338046383496910.bin' '-w' '/tmp/graph7401338046383496910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7401338046383496910.bin' '-l' '-1' '-v' '-w' '/tmp/graph7401338046383496910.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:13:09] [INFO ] Decomposing Gal with order
[2022-05-16 02:13:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:13:09] [INFO ] Removed a total of 56 redundant transitions.
[2022-05-16 02:13:09] [INFO ] Flatten gal took : 43 ms
[2022-05-16 02:13:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 11 ms.
[2022-05-16 02:13:09] [INFO ] Time to serialize gal into /tmp/LTL15774096435316923505.gal : 4 ms
[2022-05-16 02:13:09] [INFO ] Time to serialize properties into /tmp/LTL2446475526349555464.ltl : 4 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/LTL15774096435316923505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2446475526349555464.ltl' '-c' '-stutter-deadlock'

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/LTL1577409...246
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((i1.i1.u11.TrainState_90>=1)||(i1.i1.u11.TrainState_88>=1))||((i3.i0.u1.TrainState_43>=1)||(i3.i0.u1.TrainState_45>=1))...2182
Formula 0 simplified : !GF"((((((((i1.i1.u11.TrainState_90>=1)||(i1.i1.u11.TrainState_88>=1))||((i3.i0.u1.TrainState_43>=1)||(i3.i0.u1.TrainState_45>=1)))|...2176
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4100017766889127736
[2022-05-16 02:13:24] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4100017766889127736
Running compilation step : cd /tmp/ltsmin4100017766889127736;'/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 288 ms.
Running link step : cd /tmp/ltsmin4100017766889127736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin4100017766889127736;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BART-COL-060-LTLFireability-07 finished in 80238 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 88 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 15 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:13:39] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:13:39] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:13:39] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-16 02:13:39] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:13:39] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:39] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-060-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s86 1) (GEQ s44 1) (GEQ s90 1) (GEQ s48 1) (GEQ s94 1) (GEQ s52 1) (GEQ s56 1) (GEQ s60 1) (GEQ s64 1) (GEQ s8 1) (GEQ s68 1) (GEQ s12 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 387 steps with 0 reset in 1 ms.
FORMULA BART-COL-060-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-08 finished in 243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(X((!F(p1)||X((p0 U p2))||p3))))))'
Support contains 131 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:13:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:13:39] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:13:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:13:39] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:13:39] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:39] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 335 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (NOT p2), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) p3)), true, (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), p1]
Running random walk in product with property : BART-COL-060-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=3 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p3 p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={1} source=7 dest: 7}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={0} source=7 dest: 8}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={0, 1} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={1} source=8 dest: 7}, { cond=(OR (AND p0 p3 (NOT p2)) (AND p0 (NOT p1) (NOT p2))), acceptance={0} source=8 dest: 8}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={0, 1} source=8 dest: 8}], [{ cond=p1, acceptance={} source=9 dest: 6}, { cond=(NOT p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(OR (GEQ s98 1) (GEQ s49 1) (GEQ s102 1) (GEQ s53 1) (GEQ s106 1) (GEQ s57 1) (GEQ s61 1) (GEQ s65 1) (GEQ s69 1) (GEQ s8 1) (GEQ s73 1) (GEQ s12 1) (G...], nbAcceptance=2, 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 826 reset in 403 ms.
Product exploration explored 100000 steps with 827 reset in 381 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) p3 (NOT p1) (NOT p2)), true, (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 578 ms. Reduced automaton from 10 states, 28 edges and 4 AP to 10 states, 28 edges and 4 AP.
Stuttering acceptance computed with spot in 396 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (NOT p2), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) p3)), true, (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), p1]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :14
Finished Best-First random walk after 232 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) (NOT p2)), true, (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p2) (NOT p1) p3)), (F (AND p0 (NOT p2) p1 p3)), (F (AND (NOT p0) (NOT p2) p1)), (F (AND p0 p1 (NOT p3))), (F p1), (F (AND p0 (NOT p1) (NOT p3))), (F (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2) p1 (NOT p3))), (F (AND p0 (NOT p2))), (F p0), (F (AND (NOT p1) (NOT p3))), (F (AND p1 (NOT p3))), (F (AND p0 (NOT p2) (NOT p1) (NOT p3))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 6 factoid took 1232 ms. Reduced automaton from 10 states, 28 edges and 4 AP to 10 states, 28 edges and 4 AP.
Stuttering acceptance computed with spot in 447 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (NOT p2), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) p3)), true, (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), p1]
Stuttering acceptance computed with spot in 346 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (NOT p2), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) p3)), true, (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), p1]
Support contains 131 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:13:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:13:44] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:13:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:44] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:13:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:44] [INFO ] Dead Transitions using invariants and state equation in 88 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) p3 (NOT p2)), true, (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 395 ms. Reduced automaton from 10 states, 28 edges and 4 AP to 10 states, 28 edges and 4 AP.
Stuttering acceptance computed with spot in 289 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (NOT p2), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) p3)), true, (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), p1]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :13
Finished Best-First random walk after 231 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=77 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), true, (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p2) (NOT p1) p3)), (F (AND p0 (NOT p2) p1 p3)), (F (AND (NOT p0) (NOT p2) p1)), (F (AND p0 p1 (NOT p3))), (F p1), (F (AND p0 (NOT p1) (NOT p3))), (F (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2) p1 (NOT p3))), (F (AND p0 (NOT p2))), (F p0), (F (AND (NOT p1) (NOT p3))), (F (AND p1 (NOT p3))), (F (AND p0 (NOT p2) (NOT p1) (NOT p3))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 6 factoid took 737 ms. Reduced automaton from 10 states, 28 edges and 4 AP to 10 states, 28 edges and 4 AP.
Stuttering acceptance computed with spot in 283 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (NOT p2), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) p3)), true, (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), p1]
Stuttering acceptance computed with spot in 267 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (NOT p2), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) p3)), true, (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), p1]
Stuttering acceptance computed with spot in 268 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (NOT p2), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) p3)), true, (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), p1]
Product exploration explored 100000 steps with 825 reset in 559 ms.
Product exploration explored 100000 steps with 823 reset in 547 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, false, false, true]
Stuttering acceptance computed with spot in 317 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (NOT p2), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) p3)), true, (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), p1]
Support contains 131 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2022-05-16 02:13:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:13:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:13:48] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Product exploration explored 100000 steps with 825 reset in 637 ms.
Product exploration explored 100000 steps with 822 reset in 682 ms.
Built C files in :
/tmp/ltsmin18117457675859747073
[2022-05-16 02:13:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18117457675859747073
Running compilation step : cd /tmp/ltsmin18117457675859747073;'/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 377 ms.
Running link step : cd /tmp/ltsmin18117457675859747073;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin18117457675859747073;'/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/stateBased4944235188437164654.hoa' '--buchi-type=spotba'
LTSmin run took 1840 ms.
FORMULA BART-COL-060-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-060-LTLFireability-09 finished in 12220 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(X((F(p1)||!p0))||(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 3 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:13:51] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:13:52] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:13:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:52] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:13:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:52] [INFO ] Dead Transitions using invariants and state equation in 85 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 105 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : BART-COL-060-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s0 1), p1:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s111 1) (GEQ s12 1) (GEQ s109 1) (GEQ s14 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24918 reset in 167 ms.
Product exploration explored 100000 steps with 24930 reset in 177 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
Finished random walk after 61 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p0)), (F p1), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:13:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:53] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:13:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:53] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2022-05-16 02:13:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:13:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:13:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:53] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-16 02:13:53] [INFO ] Computed and/alt/rep : 163/267/163 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 02:13:53] [INFO ] Added : 122 causal constraints over 25 iterations in 219 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 69 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 199/199 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 199/199 (removed 0) transitions.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:13:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:53] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:13:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:53] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:13:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:13:54] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 199/199 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 p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
Finished random walk after 61 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT p0)), (F p1), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:13:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:54] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:13:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:54] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2022-05-16 02:13:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:13:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:13:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:55] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-16 02:13:55] [INFO ] Computed and/alt/rep : 163/267/163 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 02:13:55] [INFO ] Added : 122 causal constraints over 25 iterations in 274 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
Product exploration explored 100000 steps with 24947 reset in 264 ms.
Product exploration explored 100000 steps with 24860 reset in 230 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
Support contains 69 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 199/199 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 129 transition count 199
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 129 transition count 199
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 122 transition count 192
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 122 transition count 192
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 45 rules in 18 ms. Remains 122 /129 variables (removed 7) and now considering 192/199 (removed 7) transitions.
[2022-05-16 02:13:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 192 rows 122 cols
[2022-05-16 02:13:56] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:56] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/129 places, 192/199 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/129 places, 192/199 transitions.
Product exploration explored 100000 steps with 24911 reset in 501 ms.
Product exploration explored 100000 steps with 24942 reset in 400 ms.
Built C files in :
/tmp/ltsmin13883654436795659242
[2022-05-16 02:13:57] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13883654436795659242
Running compilation step : cd /tmp/ltsmin13883654436795659242;'/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 236 ms.
Running link step : cd /tmp/ltsmin13883654436795659242;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin13883654436795659242;'/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/stateBased7520032645663459039.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 69 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 199/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 199/199 (removed 0) transitions.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:14:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:14:12] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:14:12] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:14:12] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:14:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:14:12] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 199/199 transitions.
Built C files in :
/tmp/ltsmin6407128150161556664
[2022-05-16 02:14:12] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6407128150161556664
Running compilation step : cd /tmp/ltsmin6407128150161556664;'/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 258 ms.
Running link step : cd /tmp/ltsmin6407128150161556664;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6407128150161556664;'/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/stateBased11993860258245691688.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:14:28] [INFO ] Flatten gal took : 8 ms
[2022-05-16 02:14:28] [INFO ] Flatten gal took : 8 ms
[2022-05-16 02:14:28] [INFO ] Time to serialize gal into /tmp/LTL18377550729363550877.gal : 1 ms
[2022-05-16 02:14:28] [INFO ] Time to serialize properties into /tmp/LTL8941368055459714912.ltl : 0 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/LTL18377550729363550877.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8941368055459714912.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/LTL1837755...267
Read 1 LTL properties
Checking formula 0 : !((X(G(("(TrainState_0>=1)")&&((X((F("((((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||(((Tr...3154
Formula 0 simplified : !XG("(TrainState_0>=1)" & (X("(TrainState_0<1)" | F"((((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState...3141
Detected timeout of ITS tools.
[2022-05-16 02:14:43] [INFO ] Flatten gal took : 8 ms
[2022-05-16 02:14:43] [INFO ] Applying decomposition
[2022-05-16 02:14:43] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6969655011662296239.txt' '-o' '/tmp/graph6969655011662296239.bin' '-w' '/tmp/graph6969655011662296239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6969655011662296239.bin' '-l' '-1' '-v' '-w' '/tmp/graph6969655011662296239.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:14:43] [INFO ] Decomposing Gal with order
[2022-05-16 02:14:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:14:43] [INFO ] Removed a total of 54 redundant transitions.
[2022-05-16 02:14:43] [INFO ] Flatten gal took : 29 ms
[2022-05-16 02:14:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2022-05-16 02:14:43] [INFO ] Time to serialize gal into /tmp/LTL12797979017703763835.gal : 3 ms
[2022-05-16 02:14:43] [INFO ] Time to serialize properties into /tmp/LTL15042485203060041925.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/LTL12797979017703763835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15042485203060041925.ltl' '-c' '-stutter-deadlock'

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/LTL1279797...247
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i1.u2.TrainState_0>=1)")&&((X((F("((((((((i0.u13.TrainState_90>=1)||(i0.u13.TrainState_88>=1))||((i0.u0.TrainState_43>=1)||(...4368
Formula 0 simplified : !XG("(i1.u2.TrainState_0>=1)" & (X("(i1.u2.TrainState_0<1)" | F"((((((((i0.u13.TrainState_90>=1)||(i0.u13.TrainState_88>=1))||((i0.u...4355
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3580106519964138716
[2022-05-16 02:14:58] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3580106519964138716
Running compilation step : cd /tmp/ltsmin3580106519964138716;'/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 335 ms.
Running link step : cd /tmp/ltsmin3580106519964138716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3580106519964138716;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)&&(X((<>((LTLAPp1==true))||!(LTLAPp0==true)))||((LTLAPp1==true) U !(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BART-COL-060-LTLFireability-10 finished in 81381 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1)))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 7 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:15:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:13] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:15:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:13] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:15:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:13] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BART-COL-060-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s86 1) (GEQ s44 1) (GEQ s90 1) (GEQ s48 1) (GEQ s94 1) (GEQ s52 1) (GEQ s56 1) (GEQ s60 1) (GEQ s64 1) (GEQ s8 1) (GEQ s68 1) (GEQ s12 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-060-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-12 finished in 257 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 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 10 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:15:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:15:13] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 02:15:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:13] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 02:15:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:15:13] [INFO ] Dead Transitions using invariants and state equation in 45 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 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-060-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-060-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-13 finished in 221 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 88 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 7 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:15:13] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:15:13] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:15:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:13] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:15:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:14] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-060-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s86 1) (GEQ s44 1) (GEQ s90 1) (GEQ s48 1) (GEQ s94 1) (GEQ s52 1) (GEQ s56 1) (GEQ s60 1) (GEQ s64 1) (GEQ s8 1) (GEQ s68 1) (GEQ s12 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33266 reset in 195 ms.
Product exploration explored 100000 steps with 33261 reset in 159 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 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:15:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA BART-COL-060-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-060-LTLFireability-14 finished in 1265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(X((F(p1)||!p0))||(p1 U !p0))))))'
Found a SL insensitive property : BART-COL-060-LTLFireability-10
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
Support contains 69 out of 132 places. Attempting structural reductions.
Starting structural reductions in SLCL_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 14 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:15:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:15] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:15:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:15] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:15:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:15] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 98/132 places, 168/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/132 places, 168/202 transitions.
Running random walk in product with property : BART-COL-060-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s0 1), p1:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s80 1) (GEQ s12 1) (GEQ s78 1) (GEQ s14 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24941 reset in 235 ms.
Product exploration explored 100000 steps with 24949 reset in 202 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
Finished random walk after 61 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p0)), (F p1), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:15:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:16] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:15:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:15:16] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-16 02:15:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:15:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:15:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:15:17] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-05-16 02:15:17] [INFO ] Computed and/alt/rep : 132/236/132 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 02:15:17] [INFO ] Added : 93 causal constraints over 20 iterations in 173 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 69 out of 98 places. Attempting structural reductions.
Starting structural reductions in 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:15:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:17] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:15:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:17] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:15:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:17] [INFO ] Dead Transitions using invariants and state equation in 58 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 p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
Finished random walk after 61 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT p0)), (F p1), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:15:18] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:15:18] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-16 02:15:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:15:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:15:18] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-16 02:15:18] [INFO ] Computed and/alt/rep : 132/236/132 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 02:15:18] [INFO ] Added : 93 causal constraints over 20 iterations in 152 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) p0), (NOT p1)]
Product exploration explored 100000 steps with 24986 reset in 146 ms.
Product exploration explored 100000 steps with 25003 reset in 154 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) 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 2 ms. Remains 98 /98 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2022-05-16 02:15:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:15:19] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:15:19] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 168/168 transitions.
Product exploration explored 100000 steps with 25009 reset in 384 ms.
Product exploration explored 100000 steps with 24852 reset in 350 ms.
Built C files in :
/tmp/ltsmin256471190701006348
[2022-05-16 02:15:20] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin256471190701006348
Running compilation step : cd /tmp/ltsmin256471190701006348;'/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 203 ms.
Running link step : cd /tmp/ltsmin256471190701006348;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin256471190701006348;'/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/stateBased6009786842018804218.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 LTL mode, iteration 0 : 98/98 places, 168/168 transitions.
Applied a total of 0 rules in 2 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:15:35] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:35] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:15:35] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:15:35] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:15:35] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:15:35] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 168/168 transitions.
Built C files in :
/tmp/ltsmin14612272612572574671
[2022-05-16 02:15:35] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14612272612572574671
Running compilation step : cd /tmp/ltsmin14612272612572574671;'/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/ltsmin14612272612572574671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14612272612572574671;'/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/stateBased6108247351343821321.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:15:50] [INFO ] Flatten gal took : 11 ms
[2022-05-16 02:15:50] [INFO ] Flatten gal took : 9 ms
[2022-05-16 02:15:50] [INFO ] Time to serialize gal into /tmp/LTL3653112242333635340.gal : 1 ms
[2022-05-16 02:15:50] [INFO ] Time to serialize properties into /tmp/LTL17068915274301820576.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/LTL3653112242333635340.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17068915274301820576.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/LTL3653112...267
Read 1 LTL properties
Checking formula 0 : !((X(G(("(TrainState_0>=1)")&&((X((F("((((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||(((Tr...3154
Formula 0 simplified : !XG("(TrainState_0>=1)" & (X("(TrainState_0<1)" | F"((((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState...3141
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 02:16:05] [INFO ] Flatten gal took : 19 ms
[2022-05-16 02:16:05] [INFO ] Applying decomposition
[2022-05-16 02:16:05] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8235503392593082167.txt' '-o' '/tmp/graph8235503392593082167.bin' '-w' '/tmp/graph8235503392593082167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8235503392593082167.bin' '-l' '-1' '-v' '-w' '/tmp/graph8235503392593082167.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:16:05] [INFO ] Decomposing Gal with order
[2022-05-16 02:16:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:16:05] [INFO ] Removed a total of 56 redundant transitions.
[2022-05-16 02:16:05] [INFO ] Flatten gal took : 17 ms
[2022-05-16 02:16:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 3 ms.
[2022-05-16 02:16:05] [INFO ] Time to serialize gal into /tmp/LTL2234651923705032872.gal : 2 ms
[2022-05-16 02:16:05] [INFO ] Time to serialize properties into /tmp/LTL9879069234827006145.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/LTL2234651923705032872.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9879069234827006145.ltl' '-c' '-stutter-deadlock'

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/LTL2234651...245
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i2.u6.TrainState_0>=1)")&&((X((F("((((((((i0.i1.u12.TrainState_90>=1)||(i0.i1.u2.TrainState_88>=1))||((i0.i0.u0.TrainState_4...4318
Formula 0 simplified : !XG("(i2.u6.TrainState_0>=1)" & (X("(i2.u6.TrainState_0<1)" | F"((((((((i0.i1.u12.TrainState_90>=1)||(i0.i1.u2.TrainState_88>=1))||(...4305
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13064569528494318081
[2022-05-16 02:16:20] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13064569528494318081
Running compilation step : cd /tmp/ltsmin13064569528494318081;'/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 305 ms.
Running link step : cd /tmp/ltsmin13064569528494318081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13064569528494318081;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)&&(X((<>((LTLAPp1==true))||!(LTLAPp0==true)))||((LTLAPp1==true) U !(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BART-COL-060-LTLFireability-10 finished in 80740 ms.
[2022-05-16 02:16:35] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14847580628276252979
[2022-05-16 02:16:35] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2022-05-16 02:16:35] [INFO ] Applying decomposition
[2022-05-16 02:16:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:16:35] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2022-05-16 02:16:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:16:35] [INFO ] Flatten gal took : 6 ms
[2022-05-16 02:16:35] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15050885837855711899.txt' '-o' '/tmp/graph15050885837855711899.bin' '-w' '/tmp/graph15050885837855711899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15050885837855711899.bin' '-l' '-1' '-v' '-w' '/tmp/graph15050885837855711899.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:16:35] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:16:35] [INFO ] Decomposing Gal with order
[2022-05-16 02:16:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:16:35] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14847580628276252979
Running compilation step : cd /tmp/ltsmin14847580628276252979;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
[2022-05-16 02:16:35] [INFO ] Removed a total of 47 redundant transitions.
[2022-05-16 02:16:35] [INFO ] Flatten gal took : 12 ms
[2022-05-16 02:16:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 2 ms.
[2022-05-16 02:16:36] [INFO ] Time to serialize gal into /tmp/LTLFireability2629513706592204770.gal : 2 ms
[2022-05-16 02:16:36] [INFO ] Time to serialize properties into /tmp/LTLFireability5677909420670163480.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/LTLFireability2629513706592204770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5677909420670163480.ltl' '-c' '-stutter-deadlock'

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/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !((G(F("((((((((i0.i1.u9.TrainState_90>=1)||(i0.i1.u9.TrainState_88>=1))||((i7.i1.u0.TrainState_43>=1)||(i7.i1.u1.TrainState_45>=1)))|...2098
Formula 0 simplified : !GF"((((((((i0.i1.u9.TrainState_90>=1)||(i0.i1.u9.TrainState_88>=1))||((i7.i1.u0.TrainState_43>=1)||(i7.i1.u1.TrainState_45>=1)))||(...2092
Compilation finished in 392 ms.
Running link step : cd /tmp/ltsmin14847580628276252979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin14847580628276252979;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.012: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.035: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.205: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.193: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.200: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.205: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.220: Initializing POR dependencies: labels 204, guards 202
pins2lts-mc-linux64( 3/ 8), 0.229: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.237: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.233: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.236: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.258: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.259: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.259: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.296: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.297: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.321: There are 206 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.321: State length is 133, there are 205 groups
pins2lts-mc-linux64( 0/ 8), 0.321: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.321: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.321: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.321: Visible groups: 0 / 205, labels: 1 / 206
pins2lts-mc-linux64( 0/ 8), 0.321: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.321: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.659: [Blue] ~119 levels ~960 states ~37376 transitions
pins2lts-mc-linux64( 3/ 8), 0.678: [Blue] ~239 levels ~1920 states ~39176 transitions
pins2lts-mc-linux64( 3/ 8), 0.703: [Blue] ~441 levels ~3840 states ~42712 transitions
pins2lts-mc-linux64( 3/ 8), 0.837: [Blue] ~919 levels ~7680 states ~67296 transitions
pins2lts-mc-linux64( 3/ 8), 1.106: [Blue] ~1879 levels ~15360 states ~112992 transitions
pins2lts-mc-linux64( 3/ 8), 1.494: [Blue] ~3795 levels ~30720 states ~208248 transitions
pins2lts-mc-linux64( 5/ 8), 2.115: [Blue] ~7679 levels ~61440 states ~450984 transitions
pins2lts-mc-linux64( 5/ 8), 2.958: [Blue] ~15359 levels ~122880 states ~825504 transitions
pins2lts-mc-linux64( 5/ 8), 4.204: [Blue] ~30719 levels ~245760 states ~1573136 transitions
pins2lts-mc-linux64( 5/ 8), 6.579: [Blue] ~61439 levels ~491520 states ~3079912 transitions
pins2lts-mc-linux64( 1/ 8), 12.084: [Blue] ~122857 levels ~983040 states ~6373640 transitions
pins2lts-mc-linux64( 5/ 8), 23.038: [Blue] ~245759 levels ~1966080 states ~12578584 transitions
pins2lts-mc-linux64( 1/ 8), 45.435: [Blue] ~491426 levels ~3932160 states ~26572176 transitions
pins2lts-mc-linux64( 1/ 8), 87.874: [Blue] ~982883 levels ~7864320 states ~53213952 transitions
pins2lts-mc-linux64( 5/ 8), 118.058: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 119.087:
pins2lts-mc-linux64( 0/ 8), 119.087: Explored 8138230 states 69430607 transitions, fanout: 8.531
pins2lts-mc-linux64( 0/ 8), 119.088: Total exploration time 118.750 sec (117.740 sec minimum, 118.202 sec on average)
pins2lts-mc-linux64( 0/ 8), 119.088: States per second: 68532, Transitions per second: 584679
pins2lts-mc-linux64( 0/ 8), 119.088:
pins2lts-mc-linux64( 0/ 8), 119.088: State space has 53486924 states, 3140 are accepting
pins2lts-mc-linux64( 0/ 8), 119.088: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 119.088: blue states: 8138230 (15.22%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 119.088: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 119.088: all-red states: 3140 (0.01%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 119.088:
pins2lts-mc-linux64( 0/ 8), 119.088: Total memory used for local state coloring: 124.0MB
pins2lts-mc-linux64( 0/ 8), 119.088:
pins2lts-mc-linux64( 0/ 8), 119.088: Queue width: 8B, total height: 8127270, memory: 62.01MB
pins2lts-mc-linux64( 0/ 8), 119.088: Tree memory: 664.1MB, 13.0 B/state, compr.: 2.4%
pins2lts-mc-linux64( 0/ 8), 119.088: Tree fill ratio (roots/leafs): 39.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 119.088: Stored 204 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 119.088: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 119.088: Est. total memory use: 726.1MB (~1086.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14847580628276252979;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14847580628276252979;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 02:38:05] [INFO ] Applying decomposition
[2022-05-16 02:38:05] [INFO ] Flatten gal took : 5 ms
[2022-05-16 02:38:05] [INFO ] Decomposing Gal with order
[2022-05-16 02:38:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:38:05] [INFO ] Removed a total of 140 redundant transitions.
[2022-05-16 02:38:05] [INFO ] Flatten gal took : 11 ms
[2022-05-16 02:38:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 02:38:05] [INFO ] Time to serialize gal into /tmp/LTLFireability8630506536439439114.gal : 2 ms
[2022-05-16 02:38:05] [INFO ] Time to serialize properties into /tmp/LTLFireability17877651339591256121.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/LTLFireability8630506536439439114.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17877651339591256121.ltl' '-c' '-stutter-deadlock'

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/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((G(F("((((((((trainidspeeddistance90.TrainState_90>=1)||(trainidspeeddistance88.TrainState_88>=1))||((trainidspeeddistance43.TrainSt...3140
Formula 0 simplified : !GF"((((((((trainidspeeddistance90.TrainState_90>=1)||(trainidspeeddistance88.TrainState_88>=1))||((trainidspeeddistance43.TrainStat...3134
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
102794 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,1027.96,3741448,1,0,7.20158e+06,110487,1500,4.27589e+06,73,241971,5048803
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-COL-060-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(("(trainidspeeddistance0.TrainState_0>=1)")&&((X((F("((((((((trainidspeeddistance90.TrainState_90>=1)||(trainidspeeddistance88....6398
Formula 1 simplified : !XG("(trainidspeeddistance0.TrainState_0>=1)" & (X("(trainidspeeddistance0.TrainState_0<1)" | F"((((((((trainidspeeddistance90.Train...6385
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
9342 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,1121.39,3744904,1,0,7.20158e+06,110487,2412,4.27589e+06,77,241971,6949957
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BART-COL-060-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 2692740 ms.

BK_STOP 1652669821305

--------------------
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-060"
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-060, 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-165245689500588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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