Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813598400764.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BART-PT-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598400764
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 190K Feb 26 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 721K Feb 26 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 287K Feb 26 03:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 988K Feb 26 03:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 216K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 566K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 97K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 268K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.2M Feb 26 04:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 4.2M Feb 26 04:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1023K Feb 26 04:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Feb 26 04:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 44K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 88K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:22 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-PT-005-LTLFireability-00
FORMULA_NAME BART-PT-005-LTLFireability-01
FORMULA_NAME BART-PT-005-LTLFireability-02
FORMULA_NAME BART-PT-005-LTLFireability-03
FORMULA_NAME BART-PT-005-LTLFireability-04
FORMULA_NAME BART-PT-005-LTLFireability-05
FORMULA_NAME BART-PT-005-LTLFireability-06
FORMULA_NAME BART-PT-005-LTLFireability-07
FORMULA_NAME BART-PT-005-LTLFireability-08
FORMULA_NAME BART-PT-005-LTLFireability-09
FORMULA_NAME BART-PT-005-LTLFireability-10
FORMULA_NAME BART-PT-005-LTLFireability-11
FORMULA_NAME BART-PT-005-LTLFireability-12
FORMULA_NAME BART-PT-005-LTLFireability-13
FORMULA_NAME BART-PT-005-LTLFireability-14
FORMULA_NAME BART-PT-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678644906047

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-005
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:15:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:15:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:15:09] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2023-03-12 18:15:09] [INFO ] Transformed 870 places.
[2023-03-12 18:15:09] [INFO ] Transformed 1010 transitions.
[2023-03-12 18:15:09] [INFO ] Found NUPN structural information;
[2023-03-12 18:15:09] [INFO ] Parsed PT model containing 870 places and 1010 transitions and 8100 arcs in 351 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-005-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 660 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 48 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
// Phase 1: matrix 1010 rows 660 cols
[2023-03-12 18:15:09] [INFO ] Computed 5 place invariants in 60 ms
[2023-03-12 18:15:10] [INFO ] Implicit Places using invariants in 556 ms returned []
[2023-03-12 18:15:10] [INFO ] Invariant cache hit.
[2023-03-12 18:15:11] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1539 ms to find 0 implicit places.
[2023-03-12 18:15:11] [INFO ] Invariant cache hit.
[2023-03-12 18:15:13] [INFO ] Dead Transitions using invariants and state equation in 2384 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3984 ms. Remains : 660/660 places, 1010/1010 transitions.
Support contains 660 out of 660 places after structural reductions.
[2023-03-12 18:15:14] [INFO ] Flatten gal took : 137 ms
[2023-03-12 18:15:14] [INFO ] Flatten gal took : 46 ms
[2023-03-12 18:15:14] [INFO ] Input system was already deterministic with 1010 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 18:15:14] [INFO ] Invariant cache hit.
[2023-03-12 18:15:15] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA BART-PT-005-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BART-PT-005-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BART-PT-005-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA BART-PT-005-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((!p1 U p2)))))'
Support contains 490 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 660 transition count 1005
Reduce places removed 5 places and 0 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 1 with 45 rules applied. Total rules applied 50 place count 655 transition count 965
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 90 place count 615 transition count 965
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 230 place count 545 transition count 895
Applied a total of 230 rules in 92 ms. Remains 545 /660 variables (removed 115) and now considering 895/1010 (removed 115) transitions.
// Phase 1: matrix 895 rows 545 cols
[2023-03-12 18:15:15] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 18:15:16] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-12 18:15:16] [INFO ] Invariant cache hit.
[2023-03-12 18:15:16] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2023-03-12 18:15:16] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-12 18:15:16] [INFO ] Invariant cache hit.
[2023-03-12 18:15:17] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 545/660 places, 895/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1614 ms. Remains : 545/660 places, 895/1010 transitions.
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BART-PT-005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s135 0) (EQ s18 0) (EQ s67 0) (EQ s153 0) (EQ s45 0) (EQ s24 0) (EQ s103 0) (EQ s65 0) (EQ s137 0) (EQ s22 0) (EQ s101 0) (EQ s57 0) (EQ s124 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 116 reset in 2307 ms.
Stack based approach found an accepted trace after 857 steps with 1 reset with depth 495 and stack size 495 in 21 ms.
FORMULA BART-PT-005-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-005-LTLFireability-00 finished in 4412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1||X(G((p2||G(p3)))))&&p0))))'
Support contains 490 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 660 transition count 1005
Reduce places removed 5 places and 0 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 1 with 45 rules applied. Total rules applied 50 place count 655 transition count 965
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 90 place count 615 transition count 965
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 90 place count 615 transition count 960
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 100 place count 610 transition count 960
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 240 place count 540 transition count 890
Applied a total of 240 rules in 69 ms. Remains 540 /660 variables (removed 120) and now considering 890/1010 (removed 120) transitions.
// Phase 1: matrix 890 rows 540 cols
[2023-03-12 18:15:20] [INFO ] Computed 5 place invariants in 17 ms
[2023-03-12 18:15:20] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-12 18:15:20] [INFO ] Invariant cache hit.
[2023-03-12 18:15:20] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2023-03-12 18:15:20] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-12 18:15:20] [INFO ] Invariant cache hit.
[2023-03-12 18:15:21] [INFO ] Dead Transitions using invariants and state equation in 717 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 540/660 places, 890/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1359 ms. Remains : 540/660 places, 890/1010 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : BART-PT-005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p2) (NOT p3)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p1 (NOT p3)) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p3), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s518 0) (EQ s150 0) (EQ s410 0) (EQ s74 0) (EQ s336 0) (EQ s501 0) (EQ s142 0) (EQ s173 0) (EQ s453 0) (EQ s203 0) (EQ s328 0) (EQ s512 0) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1612 ms.
Stack based approach found an accepted trace after 1645 steps with 0 reset with depth 1646 and stack size 1646 in 25 ms.
FORMULA BART-PT-005-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-005-LTLFireability-02 finished in 3317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 485 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Graph (trivial) has 130 edges and 660 vertex of which 30 / 660 are part of one of the 5 SCC in 3 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 635 transition count 945
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 595 transition count 945
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 201 place count 535 transition count 885
Applied a total of 201 rules in 29 ms. Remains 535 /660 variables (removed 125) and now considering 885/1010 (removed 125) transitions.
[2023-03-12 18:15:23] [INFO ] Flow matrix only has 881 transitions (discarded 4 similar events)
// Phase 1: matrix 881 rows 535 cols
[2023-03-12 18:15:23] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 18:15:23] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-12 18:15:23] [INFO ] Flow matrix only has 881 transitions (discarded 4 similar events)
[2023-03-12 18:15:23] [INFO ] Invariant cache hit.
[2023-03-12 18:15:24] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
[2023-03-12 18:15:24] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-12 18:15:24] [INFO ] Flow matrix only has 881 transitions (discarded 4 similar events)
[2023-03-12 18:15:24] [INFO ] Invariant cache hit.
[2023-03-12 18:15:24] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 535/660 places, 885/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1489 ms. Remains : 535/660 places, 885/1010 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-005-LTLFireability-06 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 (AND (EQ s125 0) (EQ s3 0) (EQ s57 0) (EQ s143 0) (EQ s35 0) (EQ s14 0) (EQ s93 0) (EQ s55 0) (EQ s127 0) (EQ s12 0) (EQ s91 0) (EQ s47 0) (EQ s114...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA BART-PT-005-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-06 finished in 1643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0&&X(G(p1))) U !p0) U G(p2)))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 452 place count 367 transition count 717
Iterating global reduction 0 with 134 rules applied. Total rules applied 586 place count 367 transition count 717
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 605 place count 348 transition count 698
Iterating global reduction 0 with 19 rules applied. Total rules applied 624 place count 348 transition count 698
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 638 place count 334 transition count 684
Iterating global reduction 0 with 14 rules applied. Total rules applied 652 place count 334 transition count 684
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 666 place count 320 transition count 670
Iterating global reduction 0 with 14 rules applied. Total rules applied 680 place count 320 transition count 670
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 694 place count 306 transition count 656
Iterating global reduction 0 with 14 rules applied. Total rules applied 708 place count 306 transition count 656
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 722 place count 292 transition count 642
Iterating global reduction 0 with 14 rules applied. Total rules applied 736 place count 292 transition count 642
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 750 place count 278 transition count 628
Iterating global reduction 0 with 14 rules applied. Total rules applied 764 place count 278 transition count 628
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 773 place count 269 transition count 619
Iterating global reduction 0 with 9 rules applied. Total rules applied 782 place count 269 transition count 619
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 791 place count 260 transition count 610
Iterating global reduction 0 with 9 rules applied. Total rules applied 800 place count 260 transition count 610
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 804 place count 256 transition count 606
Iterating global reduction 0 with 4 rules applied. Total rules applied 808 place count 256 transition count 606
Applied a total of 808 rules in 251 ms. Remains 256 /660 variables (removed 404) and now considering 606/1010 (removed 404) transitions.
// Phase 1: matrix 606 rows 256 cols
[2023-03-12 18:15:25] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 18:15:25] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-12 18:15:25] [INFO ] Invariant cache hit.
[2023-03-12 18:15:25] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-12 18:15:25] [INFO ] Invariant cache hit.
[2023-03-12 18:15:26] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/660 places, 606/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1109 ms. Remains : 256/660 places, 606/1010 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p2), (NOT p1), p0, (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : BART-PT-005-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(NEQ s84 1), p0:(NEQ s77 1), p1:(NEQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 763 steps with 235 reset in 50 ms.
FORMULA BART-PT-005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-09 finished in 1458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 452 place count 367 transition count 717
Iterating global reduction 0 with 134 rules applied. Total rules applied 586 place count 367 transition count 717
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 606 place count 347 transition count 697
Iterating global reduction 0 with 20 rules applied. Total rules applied 626 place count 347 transition count 697
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 640 place count 333 transition count 683
Iterating global reduction 0 with 14 rules applied. Total rules applied 654 place count 333 transition count 683
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 668 place count 319 transition count 669
Iterating global reduction 0 with 14 rules applied. Total rules applied 682 place count 319 transition count 669
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 696 place count 305 transition count 655
Iterating global reduction 0 with 14 rules applied. Total rules applied 710 place count 305 transition count 655
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 724 place count 291 transition count 641
Iterating global reduction 0 with 14 rules applied. Total rules applied 738 place count 291 transition count 641
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 752 place count 277 transition count 627
Iterating global reduction 0 with 14 rules applied. Total rules applied 766 place count 277 transition count 627
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 776 place count 267 transition count 617
Iterating global reduction 0 with 10 rules applied. Total rules applied 786 place count 267 transition count 617
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 795 place count 258 transition count 608
Iterating global reduction 0 with 9 rules applied. Total rules applied 804 place count 258 transition count 608
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 809 place count 253 transition count 603
Iterating global reduction 0 with 5 rules applied. Total rules applied 814 place count 253 transition count 603
Applied a total of 814 rules in 62 ms. Remains 253 /660 variables (removed 407) and now considering 603/1010 (removed 407) transitions.
// Phase 1: matrix 603 rows 253 cols
[2023-03-12 18:15:26] [INFO ] Computed 5 place invariants in 16 ms
[2023-03-12 18:15:26] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-12 18:15:26] [INFO ] Invariant cache hit.
[2023-03-12 18:15:26] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-12 18:15:26] [INFO ] Invariant cache hit.
[2023-03-12 18:15:27] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/660 places, 603/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 691 ms. Remains : 253/660 places, 603/1010 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BART-PT-005-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s85 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-PT-005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-10 finished in 823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(!p1))))'
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 158 places :
Symmetric choice reduction at 0 with 158 rule applications. Total rules 158 place count 502 transition count 852
Iterating global reduction 0 with 158 rules applied. Total rules applied 316 place count 502 transition count 852
Discarding 133 places :
Symmetric choice reduction at 0 with 133 rule applications. Total rules 449 place count 369 transition count 719
Iterating global reduction 0 with 133 rules applied. Total rules applied 582 place count 369 transition count 719
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 601 place count 350 transition count 700
Iterating global reduction 0 with 19 rules applied. Total rules applied 620 place count 350 transition count 700
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 634 place count 336 transition count 686
Iterating global reduction 0 with 14 rules applied. Total rules applied 648 place count 336 transition count 686
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 662 place count 322 transition count 672
Iterating global reduction 0 with 14 rules applied. Total rules applied 676 place count 322 transition count 672
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 690 place count 308 transition count 658
Iterating global reduction 0 with 14 rules applied. Total rules applied 704 place count 308 transition count 658
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 718 place count 294 transition count 644
Iterating global reduction 0 with 14 rules applied. Total rules applied 732 place count 294 transition count 644
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 746 place count 280 transition count 630
Iterating global reduction 0 with 14 rules applied. Total rules applied 760 place count 280 transition count 630
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 769 place count 271 transition count 621
Iterating global reduction 0 with 9 rules applied. Total rules applied 778 place count 271 transition count 621
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 787 place count 262 transition count 612
Iterating global reduction 0 with 9 rules applied. Total rules applied 796 place count 262 transition count 612
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 800 place count 258 transition count 608
Iterating global reduction 0 with 4 rules applied. Total rules applied 804 place count 258 transition count 608
Applied a total of 804 rules in 40 ms. Remains 258 /660 variables (removed 402) and now considering 608/1010 (removed 402) transitions.
// Phase 1: matrix 608 rows 258 cols
[2023-03-12 18:15:27] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 18:15:27] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-12 18:15:27] [INFO ] Invariant cache hit.
[2023-03-12 18:15:27] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-12 18:15:27] [INFO ] Invariant cache hit.
[2023-03-12 18:15:28] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 258/660 places, 608/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 709 ms. Remains : 258/660 places, 608/1010 transitions.
Stuttering acceptance computed with spot in 154 ms :[p1, (OR (NOT p0) p1), true, (OR (NOT p0) p1)]
Running random walk in product with property : BART-PT-005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(NEQ s25 1), p0:(EQ s168 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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-PT-005-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-11 finished in 878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G((F(p1)||X((p2 U p3)))))))'
Support contains 4 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 500 transition count 850
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 500 transition count 850
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 455 place count 365 transition count 715
Iterating global reduction 0 with 135 rules applied. Total rules applied 590 place count 365 transition count 715
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 610 place count 345 transition count 695
Iterating global reduction 0 with 20 rules applied. Total rules applied 630 place count 345 transition count 695
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 645 place count 330 transition count 680
Iterating global reduction 0 with 15 rules applied. Total rules applied 660 place count 330 transition count 680
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 675 place count 315 transition count 665
Iterating global reduction 0 with 15 rules applied. Total rules applied 690 place count 315 transition count 665
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 705 place count 300 transition count 650
Iterating global reduction 0 with 15 rules applied. Total rules applied 720 place count 300 transition count 650
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 735 place count 285 transition count 635
Iterating global reduction 0 with 15 rules applied. Total rules applied 750 place count 285 transition count 635
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 765 place count 270 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 780 place count 270 transition count 620
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 790 place count 260 transition count 610
Iterating global reduction 0 with 10 rules applied. Total rules applied 800 place count 260 transition count 610
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 810 place count 250 transition count 600
Iterating global reduction 0 with 10 rules applied. Total rules applied 820 place count 250 transition count 600
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 825 place count 245 transition count 595
Iterating global reduction 0 with 5 rules applied. Total rules applied 830 place count 245 transition count 595
Applied a total of 830 rules in 89 ms. Remains 245 /660 variables (removed 415) and now considering 595/1010 (removed 415) transitions.
// Phase 1: matrix 595 rows 245 cols
[2023-03-12 18:15:28] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 18:15:28] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-12 18:15:28] [INFO ] Invariant cache hit.
[2023-03-12 18:15:28] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-03-12 18:15:28] [INFO ] Invariant cache hit.
[2023-03-12 18:15:29] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/660 places, 595/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 861 ms. Remains : 245/660 places, 595/1010 transitions.
Stuttering acceptance computed with spot in 432 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) p2)]
Running random walk in product with property : BART-PT-005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={0} source=6 dest: 4}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(EQ s5 1), p1:(EQ s9 1), p3:(EQ s212 1), p2:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3067 reset in 320 ms.
Stack based approach found an accepted trace after 15242 steps with 456 reset with depth 42 and stack size 42 in 44 ms.
FORMULA BART-PT-005-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-005-LTLFireability-12 finished in 1703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(G(p0))))))'
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 452 place count 367 transition count 717
Iterating global reduction 0 with 134 rules applied. Total rules applied 586 place count 367 transition count 717
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 605 place count 348 transition count 698
Iterating global reduction 0 with 19 rules applied. Total rules applied 624 place count 348 transition count 698
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 638 place count 334 transition count 684
Iterating global reduction 0 with 14 rules applied. Total rules applied 652 place count 334 transition count 684
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 666 place count 320 transition count 670
Iterating global reduction 0 with 14 rules applied. Total rules applied 680 place count 320 transition count 670
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 694 place count 306 transition count 656
Iterating global reduction 0 with 14 rules applied. Total rules applied 708 place count 306 transition count 656
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 722 place count 292 transition count 642
Iterating global reduction 0 with 14 rules applied. Total rules applied 736 place count 292 transition count 642
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 750 place count 278 transition count 628
Iterating global reduction 0 with 14 rules applied. Total rules applied 764 place count 278 transition count 628
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 774 place count 268 transition count 618
Iterating global reduction 0 with 10 rules applied. Total rules applied 784 place count 268 transition count 618
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 794 place count 258 transition count 608
Iterating global reduction 0 with 10 rules applied. Total rules applied 804 place count 258 transition count 608
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 809 place count 253 transition count 603
Iterating global reduction 0 with 5 rules applied. Total rules applied 814 place count 253 transition count 603
Applied a total of 814 rules in 51 ms. Remains 253 /660 variables (removed 407) and now considering 603/1010 (removed 407) transitions.
// Phase 1: matrix 603 rows 253 cols
[2023-03-12 18:15:29] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 18:15:30] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-12 18:15:30] [INFO ] Invariant cache hit.
[2023-03-12 18:15:30] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-12 18:15:30] [INFO ] Invariant cache hit.
[2023-03-12 18:15:31] [INFO ] Dead Transitions using invariants and state equation in 981 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/660 places, 603/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1319 ms. Remains : 253/660 places, 603/1010 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : BART-PT-005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s91 1), p0:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA BART-PT-005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-15 finished in 1607 ms.
All properties solved by simple procedures.
Total runtime 22674 ms.
ITS solved all properties within timeout

BK_STOP 1678644931803

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

+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-PT-005"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BART-PT-005, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598400764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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