Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180500268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BART-COL-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180500268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 9.5K Apr 13 01:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 13 01:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 22:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 22:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 13 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 213K May 18 16:42 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-050-LTLFireability-00
FORMULA_NAME BART-COL-050-LTLFireability-01
FORMULA_NAME BART-COL-050-LTLFireability-02
FORMULA_NAME BART-COL-050-LTLFireability-03
FORMULA_NAME BART-COL-050-LTLFireability-04
FORMULA_NAME BART-COL-050-LTLFireability-05
FORMULA_NAME BART-COL-050-LTLFireability-06
FORMULA_NAME BART-COL-050-LTLFireability-07
FORMULA_NAME BART-COL-050-LTLFireability-08
FORMULA_NAME BART-COL-050-LTLFireability-09
FORMULA_NAME BART-COL-050-LTLFireability-10
FORMULA_NAME BART-COL-050-LTLFireability-11
FORMULA_NAME BART-COL-050-LTLFireability-12
FORMULA_NAME BART-COL-050-LTLFireability-13
FORMULA_NAME BART-COL-050-LTLFireability-14
FORMULA_NAME BART-COL-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716340401637

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-050
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-22 01:13:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 01:13:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:13:24] [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.
[2024-05-22 01:13:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-22 01:13:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 977 ms
[2024-05-22 01:13:25] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2024-05-22 01:13:25] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 22673 PT places and 7.03614756E10 transition bindings in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
[2024-05-22 01:13:25] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 7 ms.
[2024-05-22 01:13:25] [INFO ] Skeletonized 2 HLPN properties in 1 ms. Removed 14 properties that had guard overlaps.
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 50
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Arc [0:1*[$db, (MOD (ADD $tsp 1) 6), $da2]] contains successor/predecessor on variables of sort speed
[2024-05-22 01:13:26] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 266 ms.
[2024-05-22 01:13:26] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
[2024-05-22 01:13:26] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 01:13:26] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 01:13:26] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 01:13:26] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 01:13:26] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 01:13:26] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 01:13:26] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 01:13:26] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 01:13:26] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 01:13:26] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 01:13:26] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 01:13:26] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 4 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-050-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-050-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-050-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-050-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-050-LTLFireability-14 FALSE 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 10 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-22 01:13:26] [INFO ] Computed 1 invariants in 35 ms
[2024-05-22 01:13:26] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-22 01:13:26] [INFO ] Invariant cache hit.
[2024-05-22 01:13:26] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2024-05-22 01:13:26] [INFO ] Invariant cache hit.
[2024-05-22 01:13:26] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 691 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2024-05-22 01:13:26] [INFO ] Flatten gal took : 52 ms
[2024-05-22 01:13:27] [INFO ] Flatten gal took : 42 ms
[2024-05-22 01:13:27] [INFO ] Input system was already deterministic with 202 transitions.
Finished random walk after 460 steps, including 0 resets, run visited all 8 properties in 10 ms. (steps per millisecond=46 )
Parikh walk visited 0 properties in 1 ms.
FORMULA BART-COL-050-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||(p0 U p1))) U (X(p0) U G(p0))))'
Support contains 130 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.
[2024-05-22 01:13:27] [INFO ] Invariant cache hit.
[2024-05-22 01:13:27] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 01:13:27] [INFO ] Invariant cache hit.
[2024-05-22 01:13:27] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-22 01:13:27] [INFO ] Invariant cache hit.
[2024-05-22 01:13:27] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 132/132 places, 202/202 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 324 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : BART-COL-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s78 1) (GEQ s77 1) (GEQ s108 1) (GEQ s111 1) (GEQ s109 1) (GEQ s110 1) (GEQ s42 1) (GEQ s41 1) (GEQ s79 1)), p1:(AND (OR (GEQ s20 1) (GEQ s124...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BART-COL-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-050-LTLFireability-00 finished in 754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F((X(X(!p0))&&F(p1)))))))'
Support contains 69 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 29 rules applied. Total rules applied 32 place count 129 transition count 173
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 102 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 102 transition count 172
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 98 transition count 168
Applied a total of 68 rules in 31 ms. Remains 98 /132 variables (removed 34) and now considering 168/202 (removed 34) transitions.
// Phase 1: matrix 168 rows 98 cols
[2024-05-22 01:13:28] [INFO ] Computed 1 invariants in 6 ms
[2024-05-22 01:13:28] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 01:13:28] [INFO ] Invariant cache hit.
[2024-05-22 01:13:28] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-22 01:13:28] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-22 01:13:28] [INFO ] Invariant cache hit.
[2024-05-22 01:13:28] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/132 places, 168/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 357 ms. Remains : 98/132 places, 168/202 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s20 1) (LT s90 1) (LT s22 1) (LT s88 1) (LT s24 1) (LT s94 1) (LT s26 1) (LT s92 1) (LT s12 1) (LT s82 1) (LT s14 1) (LT s80 1) (LT s16 1) (LT...], 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 656 reset in 905 ms.
Product exploration explored 100000 steps with 652 reset in 536 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 (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 69 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 168/168 transitions.
Applied a total of 0 rules in 9 ms. Remains 98 /98 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-22 01:13:30] [INFO ] Invariant cache hit.
[2024-05-22 01:13:30] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 01:13:30] [INFO ] Invariant cache hit.
[2024-05-22 01:13:30] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-22 01:13:30] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-22 01:13:30] [INFO ] Invariant cache hit.
[2024-05-22 01:13:31] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 273 ms. 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 (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 646 reset in 507 ms.
Product exploration explored 100000 steps with 645 reset in 432 ms.
Built C files in :
/tmp/ltsmin10479867700018004684
[2024-05-22 01:13:32] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2024-05-22 01:13:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:13:32] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2024-05-22 01:13:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:13:32] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2024-05-22 01:13:32] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:13:32] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10479867700018004684
Running compilation step : cd /tmp/ltsmin10479867700018004684;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 603 ms.
Running link step : cd /tmp/ltsmin10479867700018004684;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin10479867700018004684;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9242402606146219290.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 69 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-22 01:13:47] [INFO ] Invariant cache hit.
[2024-05-22 01:13:47] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 01:13:47] [INFO ] Invariant cache hit.
[2024-05-22 01:13:47] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-22 01:13:47] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-22 01:13:47] [INFO ] Invariant cache hit.
[2024-05-22 01:13:48] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 284 ms. Remains : 98/98 places, 168/168 transitions.
Built C files in :
/tmp/ltsmin15661293716487039211
[2024-05-22 01:13:48] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2024-05-22 01:13:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:13:48] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2024-05-22 01:13:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:13:48] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2024-05-22 01:13:48] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:13:48] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15661293716487039211
Running compilation step : cd /tmp/ltsmin15661293716487039211;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 402 ms.
Running link step : cd /tmp/ltsmin15661293716487039211;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15661293716487039211;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10023220651642312813.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:14:03] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:14:03] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:14:03] [INFO ] Time to serialize gal into /tmp/LTL703807337939783465.gal : 4 ms
[2024-05-22 01:14:03] [INFO ] Time to serialize properties into /tmp/LTL13719272790768319219.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL703807337939783465.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6708783523319925880.hoa' '-atoms' '/tmp/LTL13719272790768319219.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL13719272790768319219.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6708783523319925880.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-22 01:14:18] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:14:18] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:14:18] [INFO ] Time to serialize gal into /tmp/LTL16413205903177548406.gal : 2 ms
[2024-05-22 01:14:18] [INFO ] Time to serialize properties into /tmp/LTL8663983622913226804.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16413205903177548406.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8663983622913226804.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((((((((TrainState_61<1)&&(TrainState_191<1))&&((TrainState_63<1)&&(TrainState_189<1)))&&(((TrainState_65<1)&&(TrainState_195...3049
Formula 0 simplified : F(G!"((((((((TrainState_61<1)&&(TrainState_191<1))&&((TrainState_63<1)&&(TrainState_189<1)))&&(((TrainState_65<1)&&(TrainState_195<1...3033
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-22 01:14:33] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:14:33] [INFO ] Applying decomposition
[2024-05-22 01:14:33] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12604131369484303418.txt' '-o' '/tmp/graph12604131369484303418.bin' '-w' '/tmp/graph12604131369484303418.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12604131369484303418.bin' '-l' '-1' '-v' '-w' '/tmp/graph12604131369484303418.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:14:33] [INFO ] Decomposing Gal with order
[2024-05-22 01:14:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:14:33] [INFO ] Removed a total of 51 redundant transitions.
[2024-05-22 01:14:33] [INFO ] Flatten gal took : 94 ms
[2024-05-22 01:14:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 11 ms.
[2024-05-22 01:14:33] [INFO ] Time to serialize gal into /tmp/LTL13559934751590280989.gal : 5 ms
[2024-05-22 01:14:33] [INFO ] Time to serialize properties into /tmp/LTL4027275513913822816.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13559934751590280989.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4027275513913822816.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("((((((((i2.i0.u4.TrainState_61<1)&&(i5.i1.u32.TrainState_191<1))&&((i2.i0.u5.TrainState_63<1)&&(i5.i0.u30.TrainState_189<1)))...4246
Formula 0 simplified : F(G!"((((((((i2.i0.u4.TrainState_61<1)&&(i5.i1.u32.TrainState_191<1))&&((i2.i0.u5.TrainState_63<1)&&(i5.i0.u30.TrainState_189<1)))&&...4230
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15607420249420504897
[2024-05-22 01:14:48] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15607420249420504897
Running compilation step : cd /tmp/ltsmin15607420249420504897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 326 ms.
Running link step : cd /tmp/ltsmin15607420249420504897;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15607420249420504897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(<>((X(X(!(LTLAPp0==true)))&&<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BART-COL-050-LTLFireability-02 finished in 95665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(!p1))))))'
Support contains 97 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
[2024-05-22 01:15:03] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 01:15:03] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 01:15:03] [INFO ] Invariant cache hit.
[2024-05-22 01:15:04] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-22 01:15:04] [INFO ] Invariant cache hit.
[2024-05-22 01:15:04] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BART-COL-050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s20 1) (LT s24 1) (LT s12 1) (LT s73 1) (LT s16 1) (LT s65 1) (LT s8 1) (LT s69 1) (LT s57 1) (LT s61 1) (LT s48 1) (LT s105 1) (LT s52 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 211 ms.
Stack based approach found an accepted trace after 32859 steps with 0 reset with depth 32860 and stack size 11085 in 109 ms.
FORMULA BART-COL-050-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-050-LTLFireability-03 finished in 834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0||G(p1)))))'
Support contains 89 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 200
Reduce places removed 2 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 11 rules applied. Total rules applied 13 place count 130 transition count 191
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 22 place count 121 transition count 191
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 22 place count 121 transition count 187
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 30 place count 117 transition count 187
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 111 transition count 181
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 111 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 111 transition count 180
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 46 place count 108 transition count 177
Iterating global reduction 4 with 3 rules applied. Total rules applied 49 place count 108 transition count 177
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 52 place count 105 transition count 174
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 105 transition count 174
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 58 place count 102 transition count 171
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 102 transition count 171
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 63 place count 100 transition count 169
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 100 transition count 169
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 67 place count 98 transition count 167
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 98 transition count 167
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 97 transition count 166
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 97 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 83 place count 91 transition count 160
Applied a total of 83 rules in 35 ms. Remains 91 /132 variables (removed 41) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 91 cols
[2024-05-22 01:15:04] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 01:15:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 01:15:04] [INFO ] Invariant cache hit.
[2024-05-22 01:15:04] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-22 01:15:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:15:04] [INFO ] Invariant cache hit.
[2024-05-22 01:15:05] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/132 places, 160/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 91/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : BART-COL-050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s17 1) (LT s21 1) (LT s9 1) (LT s64 1) (LT s13 1) (LT s56 1) (LT s5 1) (LT s60 1) (LT s48 1) (LT s52 1) (LT s39 1) (LT s88 1) (LT s43 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 220 reset in 414 ms.
Stack based approach found an accepted trace after 1757 steps with 12 reset with depth 285 and stack size 285 in 10 ms.
FORMULA BART-COL-050-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-050-LTLFireability-04 finished in 789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)&&X(G(p1)))))'
Support contains 97 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 26 edges and 132 vertex of which 6 / 132 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 127 transition count 189
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 119 transition count 189
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 41 place count 107 transition count 177
Applied a total of 41 rules in 16 ms. Remains 107 /132 variables (removed 25) and now considering 177/202 (removed 25) transitions.
// Phase 1: matrix 177 rows 107 cols
[2024-05-22 01:15:05] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 01:15:05] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 01:15:05] [INFO ] Invariant cache hit.
[2024-05-22 01:15:05] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-22 01:15:05] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:15:05] [INFO ] Invariant cache hit.
[2024-05-22 01:15:05] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/132 places, 177/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 277 ms. Remains : 107/132 places, 177/202 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : BART-COL-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p0), acceptance={1} source=0 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 0}, { cond=(NOT p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s15 1) (LT s19 1) (LT s7 1) (LT s66 1) (LT s11 1) (LT s58 1) (LT s3 1) (LT s62 1) (LT s50 1) (LT s54 1) (LT s41 1) (LT s96 1) (LT s45 1) (LT s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-COL-050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-050-LTLFireability-07 finished in 454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G((G(p2)||p1))))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 18 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2024-05-22 01:15:06] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 01:15:06] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 01:15:06] [INFO ] Invariant cache hit.
[2024-05-22 01:15:06] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-22 01:15:06] [INFO ] Invariant cache hit.
[2024-05-22 01:15:06] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BART-COL-050-LTLFireability-10 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: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (GEQ s78 1) (GEQ s77 1) (GEQ s85 1) (GEQ s88 1) (GEQ s86 1) (GEQ s87 1) (GEQ s42 1) (GEQ s41 1) (GEQ s79 1)), p2:(GEQ s0 1), p1:(OR (GEQ s78 1) (GE...], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-050-LTLFireability-10 finished in 487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(!p0)))&&(G(!p0)||(p0 U !p1))))'
Support contains 69 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 6 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2024-05-22 01:15:06] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 01:15:06] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 01:15:06] [INFO ] Invariant cache hit.
[2024-05-22 01:15:06] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-22 01:15:06] [INFO ] Invariant cache hit.
[2024-05-22 01:15:06] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 187 ms :[p0, p0, p0, p1, true]
Running random walk in product with property : BART-COL-050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s0 1), p1:(AND (LT s20 1) (LT s121 1) (LT s22 1) (LT s119 1) (LT s24 1) (LT s125 1) (LT s26 1) (LT s123 1) (LT s12 1) (LT s113 1) (LT s14 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BART-COL-050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-050-LTLFireability-11 finished in 518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(p0 U (p1||G(p0)))))))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 132 transition count 138
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 68 transition count 138
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 128 place count 68 transition count 134
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 136 place count 64 transition count 134
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 142 place count 58 transition count 128
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 58 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 149 place count 58 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 54 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 54 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 51 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 51 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 48 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 48 transition count 117
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 171 place count 46 transition count 115
Iterating global reduction 3 with 2 rules applied. Total rules applied 173 place count 46 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 175 place count 44 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 44 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 178 place count 43 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 43 transition count 112
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 193 place count 36 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 36 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 201 place count 34 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 205 place count 34 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 209 place count 32 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 213 place count 32 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 217 place count 30 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 221 place count 30 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 225 place count 28 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 229 place count 28 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 233 place count 26 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 237 place count 26 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 241 place count 24 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 245 place count 24 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 249 place count 22 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 253 place count 22 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 257 place count 20 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 261 place count 20 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 265 place count 18 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 269 place count 18 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 273 place count 16 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 277 place count 16 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 281 place count 14 transition count 39
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 285 place count 14 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 289 place count 12 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 293 place count 12 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 297 place count 10 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 301 place count 10 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 305 place count 8 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 309 place count 8 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 313 place count 6 transition count 15
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 317 place count 6 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 321 place count 4 transition count 9
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 326 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 328 place count 3 transition count 3
Applied a total of 328 rules in 50 ms. Remains 3 /132 variables (removed 129) and now considering 3/202 (removed 199) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-22 01:15:07] [INFO ] Computed 1 invariants in 5 ms
[2024-05-22 01:15:07] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 01:15:07] [INFO ] Invariant cache hit.
[2024-05-22 01:15:07] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-22 01:15:07] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 01:15:07] [INFO ] Invariant cache hit.
[2024-05-22 01:15:07] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/132 places, 3/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 3/132 places, 3/202 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-050-LTLFireability-12 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}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s0 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 56 reset in 117 ms.
Stack based approach found an accepted trace after 30373 steps with 21 reset with depth 1012 and stack size 413 in 60 ms.
FORMULA BART-COL-050-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-050-LTLFireability-12 finished in 484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--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
[2024-05-22 01:15:07] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 01:15:07] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 01:15:07] [INFO ] Invariant cache hit.
[2024-05-22 01:15:07] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-22 01:15:07] [INFO ] Invariant cache hit.
[2024-05-22 01:15:07] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 49/132 places, 119/202 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-050-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 s0 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 82 steps with 0 reset in 0 ms.
FORMULA BART-COL-050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-050-LTLFireability-13 finished in 287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(!p1&&F(p0))))))'
Support contains 68 out of 132 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 29 rules applied. Total rules applied 32 place count 129 transition count 173
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 102 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 102 transition count 172
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 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 12 ms. Remains 98 /132 variables (removed 34) and now considering 168/202 (removed 34) transitions.
// Phase 1: matrix 168 rows 98 cols
[2024-05-22 01:15:07] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 01:15:07] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 01:15:07] [INFO ] Invariant cache hit.
[2024-05-22 01:15:07] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-22 01:15:07] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:15:07] [INFO ] Invariant cache hit.
[2024-05-22 01:15:08] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/132 places, 168/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 98/132 places, 168/202 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-050-LTLFireability-15 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:(AND (LT s20 1) (LT s90 1) (LT s22 1) (LT s88 1) (LT s24 1) (LT s94 1) (LT s26 1) (LT s92 1) (LT s12 1) (LT s82 1) (LT s14 1) (LT s80 1) (LT s16 1) (LT...], 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 271 ms.
Stack based approach found an accepted trace after 9972 steps with 1 reset with depth 7298 and stack size 5012 in 35 ms.
FORMULA BART-COL-050-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-050-LTLFireability-15 finished in 656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F((X(X(!p0))&&F(p1)))))))'
[2024-05-22 01:15:08] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6836970520119804566
[2024-05-22 01:15:08] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2024-05-22 01:15:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:15:08] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2024-05-22 01:15:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:15:08] [INFO ] Applying decomposition
[2024-05-22 01:15:08] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2024-05-22 01:15:08] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:15:08] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:15:08] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6836970520119804566
Running compilation step : cd /tmp/ltsmin6836970520119804566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4458532206916989943.txt' '-o' '/tmp/graph4458532206916989943.bin' '-w' '/tmp/graph4458532206916989943.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4458532206916989943.bin' '-l' '-1' '-v' '-w' '/tmp/graph4458532206916989943.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:15:08] [INFO ] Decomposing Gal with order
[2024-05-22 01:15:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:15:08] [INFO ] Removed a total of 50 redundant transitions.
[2024-05-22 01:15:08] [INFO ] Flatten gal took : 23 ms
[2024-05-22 01:15:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 5 ms.
[2024-05-22 01:15:08] [INFO ] Time to serialize gal into /tmp/LTLFireability12810479409469080427.gal : 5 ms
[2024-05-22 01:15:08] [INFO ] Time to serialize properties into /tmp/LTLFireability190033125447210042.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12810479409469080427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability190033125447210042.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((((((((i4.i2.u19.TrainState_61<1)&&(i3.i0.u28.TrainState_191<1))&&((i4.i0.u9.TrainState_63<1)&&(i7.i0.u48.TrainState_189<1))...4105
Formula 0 simplified : F(G!"((((((((i4.i2.u19.TrainState_61<1)&&(i3.i0.u28.TrainState_191<1))&&((i4.i0.u9.TrainState_63<1)&&(i7.i0.u48.TrainState_189<1)))&...4085
Compilation finished in 553 ms.
Running link step : cd /tmp/ltsmin6836970520119804566;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6836970520119804566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(<>((X(X(!(LTLAPp0==true)))&&<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-22 01:35:43] [INFO ] Applying decomposition
[2024-05-22 01:35:43] [INFO ] Flatten gal took : 106 ms
[2024-05-22 01:35:43] [INFO ] Decomposing Gal with order
[2024-05-22 01:35:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:35:44] [INFO ] Removed a total of 140 redundant transitions.
[2024-05-22 01:35:44] [INFO ] Flatten gal took : 136 ms
[2024-05-22 01:35:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 01:35:44] [INFO ] Time to serialize gal into /tmp/LTLFireability4033493815221683397.gal : 50 ms
[2024-05-22 01:35:44] [INFO ] Time to serialize properties into /tmp/LTLFireability14567083261778353100.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4033493815221683397.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14567083261778353100.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("((((((((trainidspeeddistance61.TrainState_61<1)&&(trainidspeeddistance191.TrainState_191<1))&&((trainidspeeddistance63.TrainS...6185
Formula 0 simplified : F(G!"((((((((trainidspeeddistance61.TrainState_61<1)&&(trainidspeeddistance191.TrainState_191<1))&&((trainidspeeddistance63.TrainSta...6165
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: LTL layer: formula: []((<>((LTLAPp0==true))||X(<>((X(X(!(LTLAPp0==true)))&&<>((LTLAPp1==true)))))))
pins2lts-mc-linux64( 1/ 8), 0.008: "[]((<>((LTLAPp0==true))||X(<>((X(X(!(LTLAPp0==true)))&&<>((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.008: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.038: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.108: DFS-FIFO for weak LTL, using special progress label 205
pins2lts-mc-linux64( 0/ 8), 0.108: There are 206 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.108: State length is 133, there are 205 groups
pins2lts-mc-linux64( 0/ 8), 0.108: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.108: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.108: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.108: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.000: ~119 levels ~960 states ~57648 transitions
pins2lts-mc-linux64( 0/ 8), 1.404: ~234 levels ~1920 states ~98280 transitions
pins2lts-mc-linux64( 7/ 8), 1.632: ~445 levels ~3840 states ~126528 transitions
pins2lts-mc-linux64( 7/ 8), 1.692: ~446 levels ~7680 states ~133472 transitions
pins2lts-mc-linux64( 7/ 8), 1.806: ~446 levels ~15360 states ~149744 transitions
pins2lts-mc-linux64( 7/ 8), 1.972: ~446 levels ~30720 states ~183240 transitions
pins2lts-mc-linux64( 7/ 8), 2.340: ~446 levels ~61440 states ~252280 transitions
pins2lts-mc-linux64( 7/ 8), 3.006: ~446 levels ~122880 states ~409776 transitions
pins2lts-mc-linux64( 7/ 8), 4.238: ~446 levels ~245760 states ~741384 transitions
pins2lts-mc-linux64( 0/ 8), 6.190: ~493 levels ~491520 states ~1441680 transitions
pins2lts-mc-linux64( 0/ 8), 9.571: ~493 levels ~983040 states ~2958432 transitions
pins2lts-mc-linux64( 7/ 8), 15.091: ~446 levels ~1966080 states ~5924560 transitions
pins2lts-mc-linux64( 0/ 8), 25.726: ~493 levels ~3932160 states ~12683208 transitions
pins2lts-mc-linux64( 0/ 8), 46.988: ~493 levels ~7864320 states ~26690232 transitions
pins2lts-mc-linux64( 0/ 8), 90.249: ~493 levels ~15728640 states ~55663584 transitions
pins2lts-mc-linux64( 0/ 8), 177.436: ~493 levels ~31457280 states ~114587984 transitions
pins2lts-mc-linux64( 0/ 8), 414.339: ~493 levels ~62914560 states ~240544560 transitions
pins2lts-mc-linux64( 0/ 8), 902.727: ~493 levels ~125829120 states ~498072240 transitions
pins2lts-mc-linux64( 1/ 8), 1724.336: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1724.384:
pins2lts-mc-linux64( 0/ 8), 1724.384: mean standard work distribution: 77.5% (states) 77.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 1724.384:
pins2lts-mc-linux64( 0/ 8), 1724.384: Explored 134137387 states 553384945 transitions, fanout: 4.126
pins2lts-mc-linux64( 0/ 8), 1724.384: Total exploration time 1724.250 sec (1724.200 sec minimum, 1724.223 sec on average)
pins2lts-mc-linux64( 0/ 8), 1724.384: States per second: 77795, Transitions per second: 320942
pins2lts-mc-linux64( 0/ 8), 1724.384:
pins2lts-mc-linux64( 0/ 8), 1724.384: Progress states detected: 184
pins2lts-mc-linux64( 0/ 8), 1724.384: Redundant explorations: -0.0596
pins2lts-mc-linux64( 0/ 8), 1724.384:
pins2lts-mc-linux64( 0/ 8), 1724.384: Queue width: 8B, total height: 2543, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 1724.384: Tree memory: 1030.7MB, 8.1 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 1724.384: Tree fill ratio (roots/leafs): 99.0%/2.0%
pins2lts-mc-linux64( 0/ 8), 1724.384: Stored 202 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1724.384: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1724.385: Est. total memory use: 1030.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6836970520119804566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(<>((X(X(!(LTLAPp0==true)))&&<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6836970520119804566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(<>((X(X(!(LTLAPp0==true)))&&<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-22 01:56:18] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:56:18] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-22 01:56:18] [INFO ] Transformed 132 places.
[2024-05-22 01:56:18] [INFO ] Transformed 202 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 01:56:18] [INFO ] Time to serialize gal into /tmp/LTLFireability15649542204672579263.gal : 2 ms
[2024-05-22 01:56:18] [INFO ] Time to serialize properties into /tmp/LTLFireability16491820077041393237.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15649542204672579263.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16491820077041393237.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("((((((((TrainState_61<1)&&(TrainState_191<1))&&((TrainState_63<1)&&(TrainState_189<1)))&&(((TrainState_65<1)&&(TrainState_195...2984
Formula 0 simplified : F(G!"((((((((TrainState_61<1)&&(TrainState_191<1))&&((TrainState_63<1)&&(TrainState_189<1)))&&(((TrainState_65<1)&&(TrainState_195<1...2964
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12440620 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16040820 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BART-COL-050, 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 r043-smll-171620180500268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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