Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 355K Apr 29 20:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 29 20:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 566K Apr 29 20:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.9M Apr 29 20:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 216K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 572K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 233K May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 587K May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 9 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 40K May 9 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 2.4M May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BART-PT-010-LTLFireability-00
FORMULA_NAME BART-PT-010-LTLFireability-01
FORMULA_NAME BART-PT-010-LTLFireability-02
FORMULA_NAME BART-PT-010-LTLFireability-03
FORMULA_NAME BART-PT-010-LTLFireability-04
FORMULA_NAME BART-PT-010-LTLFireability-05
FORMULA_NAME BART-PT-010-LTLFireability-06
FORMULA_NAME BART-PT-010-LTLFireability-07
FORMULA_NAME BART-PT-010-LTLFireability-08
FORMULA_NAME BART-PT-010-LTLFireability-09
FORMULA_NAME BART-PT-010-LTLFireability-10
FORMULA_NAME BART-PT-010-LTLFireability-11
FORMULA_NAME BART-PT-010-LTLFireability-12
FORMULA_NAME BART-PT-010-LTLFireability-13
FORMULA_NAME BART-PT-010-LTLFireability-14
FORMULA_NAME BART-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652667594737

Running Version 202205111006
[2022-05-16 02:19:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:19:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:19:56] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2022-05-16 02:19:56] [INFO ] Transformed 1530 places.
[2022-05-16 02:19:56] [INFO ] Transformed 2020 transitions.
[2022-05-16 02:19:56] [INFO ] Found NUPN structural information;
[2022-05-16 02:19:56] [INFO ] Parsed PT model containing 1530 places and 2020 transitions in 371 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-010-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1320 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 36 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:19:56] [INFO ] Computed 10 place invariants in 30 ms
[2022-05-16 02:19:57] [INFO ] Implicit Places using invariants in 414 ms returned []
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:19:57] [INFO ] Computed 10 place invariants in 13 ms
[2022-05-16 02:19:57] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:19:57] [INFO ] Computed 10 place invariants in 11 ms
[2022-05-16 02:19:59] [INFO ] Dead Transitions using invariants and state equation in 1066 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1320/1320 places, 2020/2020 transitions.
Support contains 1320 out of 1320 places after structural reductions.
[2022-05-16 02:19:59] [INFO ] Flatten gal took : 163 ms
[2022-05-16 02:19:59] [INFO ] Flatten gal took : 91 ms
[2022-05-16 02:19:59] [INFO ] Input system was already deterministic with 2020 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:20:00] [INFO ] Computed 10 place invariants in 12 ms
[2022-05-16 02:20:00] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2022-05-16 02:20:01] [INFO ] After 701ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 02:20:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-16 02:20:01] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 02:20:01] [INFO ] After 629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-05-16 02:20:02] [INFO ] After 967ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 111 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
Parikh walk visited 1 properties in 8 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F((F(p1)&&p0))))))'
Support contains 980 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1320 transition count 2010
Reduce places removed 10 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 90 rules applied. Total rules applied 100 place count 1310 transition count 1930
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 180 place count 1230 transition count 1930
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 180 place count 1230 transition count 1920
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 200 place count 1220 transition count 1920
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 480 place count 1080 transition count 1780
Applied a total of 480 rules in 216 ms. Remains 1080 /1320 variables (removed 240) and now considering 1780/2020 (removed 240) transitions.
// Phase 1: matrix 1780 rows 1080 cols
[2022-05-16 02:20:02] [INFO ] Computed 10 place invariants in 9 ms
[2022-05-16 02:20:02] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 1780 rows 1080 cols
[2022-05-16 02:20:02] [INFO ] Computed 10 place invariants in 12 ms
[2022-05-16 02:20:03] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
[2022-05-16 02:20:03] [INFO ] Redundant transitions in 106 ms returned []
// Phase 1: matrix 1780 rows 1080 cols
[2022-05-16 02:20:03] [INFO ] Computed 10 place invariants in 15 ms
[2022-05-16 02:20:04] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1080/1320 places, 1780/2020 transitions.
Finished structural reductions, in 1 iterations. Remains : 1080/1320 places, 1780/2020 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s30 1) (EQ s237 1) (EQ s263 1) (EQ s85 1) (EQ s194 1) (EQ s37 1) (EQ s123 1) (EQ s127 1) (EQ s81 1) (EQ s190 1) (EQ s296 1) (EQ s267 1) (EQ s29...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5653 reset in 1341 ms.
Stack based approach found an accepted trace after 3910 steps with 238 reset with depth 12 and stack size 12 in 47 ms.
FORMULA BART-PT-010-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-010-LTLFireability-00 finished in 3859 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!X(((p0 U F(p1))&&p0))) U p2))'
Support contains 1300 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 7 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:20:06] [INFO ] Computed 10 place invariants in 8 ms
[2022-05-16 02:20:06] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:20:06] [INFO ] Computed 10 place invariants in 18 ms
[2022-05-16 02:20:07] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:20:07] [INFO ] Computed 10 place invariants in 8 ms
[2022-05-16 02:20:08] [INFO ] Dead Transitions using invariants and state equation in 1133 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1320/1320 places, 2020/2020 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p2), (OR (NOT p2) (AND p0 p1)), true, p1, (AND p1 p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s1100 1) (EQ s696 1) (EQ s460 1) (EQ s1149 1) (EQ s739 1) (EQ s546 1) (EQ s320 1) (EQ s589 1) (EQ s35 1) (EQ s1316 1) (EQ s142 1) (EQ s653 1) (...], 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 32 steps with 0 reset in 2 ms.
FORMULA BART-PT-010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-01 finished in 2314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p0))))'
Support contains 90 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 230 places :
Symmetric choice reduction at 0 with 230 rule applications. Total rules 230 place count 1090 transition count 1790
Iterating global reduction 0 with 230 rules applied. Total rules applied 460 place count 1090 transition count 1790
Discarding 190 places :
Symmetric choice reduction at 0 with 190 rule applications. Total rules 650 place count 900 transition count 1600
Iterating global reduction 0 with 190 rules applied. Total rules applied 840 place count 900 transition count 1600
Applied a total of 840 rules in 115 ms. Remains 900 /1320 variables (removed 420) and now considering 1600/2020 (removed 420) transitions.
// Phase 1: matrix 1600 rows 900 cols
[2022-05-16 02:20:08] [INFO ] Computed 10 place invariants in 8 ms
[2022-05-16 02:20:08] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 1600 rows 900 cols
[2022-05-16 02:20:08] [INFO ] Computed 10 place invariants in 18 ms
[2022-05-16 02:20:09] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
// Phase 1: matrix 1600 rows 900 cols
[2022-05-16 02:20:09] [INFO ] Computed 10 place invariants in 17 ms
[2022-05-16 02:20:10] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 900/1320 places, 1600/2020 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/1320 places, 1600/2020 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s70 1) (EQ s277 1) (EQ s303 1) (EQ s125 1) (EQ s244 1) (EQ s77 1) (EQ s183 1) (EQ s187 1) (EQ s121 1) (EQ s240 1) (EQ s336 1) (EQ s307 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-04 finished in 1618 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 90 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 230 places :
Symmetric choice reduction at 0 with 230 rule applications. Total rules 230 place count 1090 transition count 1790
Iterating global reduction 0 with 230 rules applied. Total rules applied 460 place count 1090 transition count 1790
Discarding 190 places :
Symmetric choice reduction at 0 with 190 rule applications. Total rules 650 place count 900 transition count 1600
Iterating global reduction 0 with 190 rules applied. Total rules applied 840 place count 900 transition count 1600
Applied a total of 840 rules in 65 ms. Remains 900 /1320 variables (removed 420) and now considering 1600/2020 (removed 420) transitions.
// Phase 1: matrix 1600 rows 900 cols
[2022-05-16 02:20:10] [INFO ] Computed 10 place invariants in 11 ms
[2022-05-16 02:20:10] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 1600 rows 900 cols
[2022-05-16 02:20:10] [INFO ] Computed 10 place invariants in 12 ms
[2022-05-16 02:20:10] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
// Phase 1: matrix 1600 rows 900 cols
[2022-05-16 02:20:10] [INFO ] Computed 10 place invariants in 13 ms
[2022-05-16 02:20:11] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 900/1320 places, 1600/2020 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/1320 places, 1600/2020 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s70 1) (EQ s277 1) (EQ s303 1) (EQ s125 1) (EQ s244 1) (EQ s77 1) (EQ s183 1) (EQ s187 1) (EQ s121 1) (EQ s240 1) (EQ s336 1) (EQ s307 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BART-PT-010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-05 finished in 1488 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((p0 U p1))&&(F(p0)||X((G(p1)||p2))))))'
Support contains 100 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 230 places :
Symmetric choice reduction at 0 with 230 rule applications. Total rules 230 place count 1090 transition count 1790
Iterating global reduction 0 with 230 rules applied. Total rules applied 460 place count 1090 transition count 1790
Discarding 190 places :
Symmetric choice reduction at 0 with 190 rule applications. Total rules 650 place count 900 transition count 1600
Iterating global reduction 0 with 190 rules applied. Total rules applied 840 place count 900 transition count 1600
Applied a total of 840 rules in 87 ms. Remains 900 /1320 variables (removed 420) and now considering 1600/2020 (removed 420) transitions.
// Phase 1: matrix 1600 rows 900 cols
[2022-05-16 02:20:11] [INFO ] Computed 10 place invariants in 7 ms
[2022-05-16 02:20:11] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 1600 rows 900 cols
[2022-05-16 02:20:11] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-16 02:20:12] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
// Phase 1: matrix 1600 rows 900 cols
[2022-05-16 02:20:12] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-16 02:20:13] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 900/1320 places, 1600/2020 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/1320 places, 1600/2020 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s70 1) (EQ s277 1) (EQ s303 1) (EQ s125 1) (EQ s244 1) (EQ s77 1) (EQ s183 1) (EQ s187 1) (EQ s121 1) (EQ s240 1) (EQ s336 1) (EQ s307 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2035 ms.
Product exploration explored 100000 steps with 50000 reset in 1789 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1 p2)
Knowledge based reduction with 8 factoid took 284 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BART-PT-010-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-06 finished in 6727 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(((p0 U p1) U p1))&&X(p2)))))'
Support contains 780 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 22 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:20:18] [INFO ] Computed 10 place invariants in 9 ms
[2022-05-16 02:20:18] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:20:18] [INFO ] Computed 10 place invariants in 7 ms
[2022-05-16 02:20:19] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:20:19] [INFO ] Computed 10 place invariants in 7 ms
[2022-05-16 02:20:20] [INFO ] Dead Transitions using invariants and state equation in 1158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1320/1320 places, 2020/2020 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p1:(OR (EQ s70 1) (EQ s297 1) (EQ s333 1) (EQ s125 1) (EQ s254 1) (EQ s77 1) (EQ s183 1) (EQ s187 1) (EQ s121 1) (EQ s250 1) (EQ s376 1) (EQ s337 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3588 reset in 1540 ms.
Product exploration explored 100000 steps with 3579 reset in 1336 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (OR (AND (NOT p1) (NOT p0)) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Finished random walk after 44 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (OR (AND (NOT p1) (NOT p0)) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 3 factoid took 267 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:20:25] [INFO ] Computed 10 place invariants in 9 ms
[2022-05-16 02:20:26] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-05-16 02:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:20:28] [INFO ] [Real]Absence check using state equation in 2552 ms returned sat
[2022-05-16 02:20:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:20:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-16 02:20:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:20:31] [INFO ] [Nat]Absence check using state equation in 1528 ms returned sat
[2022-05-16 02:20:31] [INFO ] Computed and/alt/rep : 1660/2700/1660 causal constraints (skipped 0 transitions) in 121 ms.
[2022-05-16 02:20:44] [INFO ] Added : 400 causal constraints over 80 iterations in 12315 ms. Result :unknown
Could not prove EG (NOT p1)
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:20:44] [INFO ] Computed 10 place invariants in 9 ms
[2022-05-16 02:20:58] [INFO ] [Real]Absence check using 10 positive place invariants in 29 ms returned sat
[2022-05-16 02:20:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:20:59] [INFO ] [Real]Absence check using state equation in 1722 ms returned unknown
Could not prove EG (NOT p2)
Support contains 780 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 15 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:21:00] [INFO ] Computed 10 place invariants in 14 ms
[2022-05-16 02:21:00] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:21:00] [INFO ] Computed 10 place invariants in 7 ms
[2022-05-16 02:21:01] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:21:01] [INFO ] Computed 10 place invariants in 16 ms
[2022-05-16 02:21:02] [INFO ] Dead Transitions using invariants and state equation in 1054 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1320/1320 places, 2020/2020 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Finished random walk after 213 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:21:03] [INFO ] Computed 10 place invariants in 10 ms
[2022-05-16 02:21:04] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2022-05-16 02:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:21:06] [INFO ] [Real]Absence check using state equation in 2496 ms returned sat
[2022-05-16 02:21:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:21:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-16 02:21:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:21:09] [INFO ] [Nat]Absence check using state equation in 1716 ms returned sat
[2022-05-16 02:21:09] [INFO ] Computed and/alt/rep : 1660/2700/1660 causal constraints (skipped 0 transitions) in 137 ms.
[2022-05-16 02:21:22] [INFO ] Deduced a trap composed of 132 places in 652 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 02:21:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:21:22] [INFO ] Computed 10 place invariants in 17 ms
[2022-05-16 02:21:36] [INFO ] [Real]Absence check using 10 positive place invariants in 28 ms returned sat
[2022-05-16 02:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:21:37] [INFO ] [Real]Absence check using state equation in 875 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3569 reset in 1050 ms.
Product exploration explored 100000 steps with 3616 reset in 964 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Support contains 780 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Performed 230 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 230 rules applied. Total rules applied 230 place count 1320 transition count 2020
Deduced a syphon composed of 230 places in 1 ms
Applied a total of 230 rules in 143 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2022-05-16 02:21:40] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:21:40] [INFO ] Computed 10 place invariants in 13 ms
[2022-05-16 02:21:41] [INFO ] Dead Transitions using invariants and state equation in 1096 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1320/1320 places, 2020/2020 transitions.
Finished structural reductions, in 1 iterations. Remains : 1320/1320 places, 2020/2020 transitions.
Product exploration explored 100000 steps with 3914 reset in 1155 ms.
Product exploration explored 100000 steps with 3948 reset in 1118 ms.
Built C files in :
/tmp/ltsmin7085727922125776899
[2022-05-16 02:21:44] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7085727922125776899
Running compilation step : cd /tmp/ltsmin7085727922125776899;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7085727922125776899;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7085727922125776899;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 780 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 14 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:21:47] [INFO ] Computed 10 place invariants in 7 ms
[2022-05-16 02:21:47] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:21:47] [INFO ] Computed 10 place invariants in 13 ms
[2022-05-16 02:21:48] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
// Phase 1: matrix 2020 rows 1320 cols
[2022-05-16 02:21:48] [INFO ] Computed 10 place invariants in 8 ms
[2022-05-16 02:21:49] [INFO ] Dead Transitions using invariants and state equation in 1039 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1320/1320 places, 2020/2020 transitions.
Built C files in :
/tmp/ltsmin9982149003361762251
[2022-05-16 02:21:49] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9982149003361762251
Running compilation step : cd /tmp/ltsmin9982149003361762251;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9982149003361762251;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9982149003361762251;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 02:21:52] [INFO ] Flatten gal took : 76 ms
[2022-05-16 02:21:52] [INFO ] Flatten gal took : 67 ms
[2022-05-16 02:21:52] [INFO ] Time to serialize gal into /tmp/LTL8547224242110077394.gal : 11 ms
[2022-05-16 02:21:52] [INFO ] Time to serialize properties into /tmp/LTL11403986979185864368.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8547224242110077394.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11403986979185864368.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8547224...267
Read 1 LTL properties
Checking formula 0 : !((F(X((X((("(((((TrainState_7_1_1==1)||(TrainState_8_1_1==1))||((TrainState_9_1_1==1)||(TrainState_10_1_1==1)))||(((TrainState_1_1_1=...22523
Formula 0 simplified : !FX(X(("(((((TrainState_7_1_1==1)||(TrainState_8_1_1==1))||((TrainState_9_1_1==1)||(TrainState_10_1_1==1)))||(((TrainState_1_1_1==1)...22512
Detected timeout of ITS tools.
[2022-05-16 02:22:07] [INFO ] Flatten gal took : 95 ms
[2022-05-16 02:22:07] [INFO ] Applying decomposition
[2022-05-16 02:22:07] [INFO ] Flatten gal took : 67 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10781908677857120046.txt' '-o' '/tmp/graph10781908677857120046.bin' '-w' '/tmp/graph10781908677857120046.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10781908677857120046.bin' '-l' '-1' '-v' '-w' '/tmp/graph10781908677857120046.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:22:08] [INFO ] Decomposing Gal with order
[2022-05-16 02:22:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:22:08] [INFO ] Removed a total of 119 redundant transitions.
[2022-05-16 02:22:08] [INFO ] Flatten gal took : 210 ms
[2022-05-16 02:22:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2022-05-16 02:22:08] [INFO ] Time to serialize gal into /tmp/LTL3288629638006300333.gal : 28 ms
[2022-05-16 02:22:08] [INFO ] Time to serialize properties into /tmp/LTL15440074691455566660.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3288629638006300333.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15440074691455566660.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3288629...246
Read 1 LTL properties
Checking formula 0 : !((F(X((X((("(((((i1.i0.u3.TrainState_7_1_1==1)||(i2.i0.u4.TrainState_8_1_1==1))||((i5.i0.u10.TrainState_9_1_1==1)||(i3.i0.u5.TrainSta...31601
Formula 0 simplified : !FX(X(("(((((i1.i0.u3.TrainState_7_1_1==1)||(i2.i0.u4.TrainState_8_1_1==1))||((i5.i0.u10.TrainState_9_1_1==1)||(i3.i0.u5.TrainState_...31590
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
313 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.31759,135216,1,0,180527,5205,9614,698048,1260,9287,344192
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-010-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-010-LTLFireability-07 finished in 114382 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(G(p0)) U p1)||F(p2)||p3)))'
Support contains 4 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 1977 edges and 1320 vertex of which 792 / 1320 are part of one of the 6 SCC in 8 ms
Free SCC test removed 786 places
Ensure Unique test removed 1206 transitions
Reduce isomorphic transitions removed 1206 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 256 transitions
Trivial Post-agglo rules discarded 256 transitions
Performed 256 trivial Post agglomeration. Transition count delta: 256
Iterating post reduction 0 with 261 rules applied. Total rules applied 262 place count 528 transition count 553
Reduce places removed 256 places and 0 transitions.
Iterating post reduction 1 with 256 rules applied. Total rules applied 518 place count 272 transition count 553
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 518 place count 272 transition count 536
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 552 place count 255 transition count 536
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 576 place count 231 transition count 512
Iterating global reduction 2 with 24 rules applied. Total rules applied 600 place count 231 transition count 512
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 604 place count 231 transition count 508
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 620 place count 215 transition count 492
Iterating global reduction 3 with 16 rules applied. Total rules applied 636 place count 215 transition count 492
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 648 place count 203 transition count 480
Iterating global reduction 3 with 12 rules applied. Total rules applied 660 place count 203 transition count 480
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 672 place count 191 transition count 468
Iterating global reduction 3 with 12 rules applied. Total rules applied 684 place count 191 transition count 468
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 692 place count 183 transition count 460
Iterating global reduction 3 with 8 rules applied. Total rules applied 700 place count 183 transition count 460
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 708 place count 175 transition count 452
Iterating global reduction 3 with 8 rules applied. Total rules applied 716 place count 175 transition count 452
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 720 place count 171 transition count 448
Iterating global reduction 3 with 4 rules applied. Total rules applied 724 place count 171 transition count 448
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 780 place count 143 transition count 420
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 796 place count 143 transition count 404
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 812 place count 135 transition count 396
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 828 place count 135 transition count 380
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 844 place count 127 transition count 372
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 860 place count 127 transition count 356
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 876 place count 119 transition count 348
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 892 place count 119 transition count 332
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 908 place count 111 transition count 324
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 924 place count 111 transition count 308
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 940 place count 103 transition count 300
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 956 place count 103 transition count 284
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 972 place count 95 transition count 276
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 988 place count 95 transition count 260
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 16 rules applied. Total rules applied 1004 place count 87 transition count 252
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 1020 place count 87 transition count 236
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 16 rules applied. Total rules applied 1036 place count 79 transition count 228
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 1052 place count 79 transition count 212
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 12 with 16 rules applied. Total rules applied 1068 place count 71 transition count 204
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 12 with 16 rules applied. Total rules applied 1084 place count 71 transition count 188
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 13 with 16 rules applied. Total rules applied 1100 place count 63 transition count 180
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 13 with 16 rules applied. Total rules applied 1116 place count 63 transition count 164
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 14 with 16 rules applied. Total rules applied 1132 place count 55 transition count 156
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 14 with 16 rules applied. Total rules applied 1148 place count 55 transition count 140
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 15 with 16 rules applied. Total rules applied 1164 place count 47 transition count 132
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 15 with 16 rules applied. Total rules applied 1180 place count 47 transition count 116
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 16 with 16 rules applied. Total rules applied 1196 place count 39 transition count 108
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 16 with 16 rules applied. Total rules applied 1212 place count 39 transition count 92
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 17 with 16 rules applied. Total rules applied 1228 place count 31 transition count 84
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 17 with 16 rules applied. Total rules applied 1244 place count 31 transition count 68
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 18 with 16 rules applied. Total rules applied 1260 place count 23 transition count 60
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 18 with 16 rules applied. Total rules applied 1276 place count 23 transition count 44
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 19 with 16 rules applied. Total rules applied 1292 place count 15 transition count 36
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 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 19 with 19 rules applied. Total rules applied 1311 place count 15 transition count 17
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 20 with 7 rules applied. Total rules applied 1318 place count 12 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 1320 place count 11 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 3 Pre rules applied. Total rules applied 1320 place count 11 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 22 with 6 rules applied. Total rules applied 1326 place count 8 transition count 9
Applied a total of 1326 rules in 153 ms. Remains 8 /1320 variables (removed 1312) and now considering 9/2020 (removed 2011) transitions.
// Phase 1: matrix 9 rows 8 cols
[2022-05-16 02:22:12] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 02:22:13] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2022-05-16 02:22:13] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 02:22:13] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-16 02:22:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2022-05-16 02:22:13] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 02:22:13] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/1320 places, 9/2020 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/1320 places, 9/2020 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BART-PT-010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(EQ s6 1), p1:(OR (EQ s3 1) (EQ s6 1)), p2:(EQ s4 1), p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA BART-PT-010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-08 finished in 401 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F((F(G(X(G(X(X(p0))))))&&p1))))))'
Support contains 2 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 2016 edges and 1320 vertex of which 1186 / 1320 are part of one of the 9 SCC in 3 ms
Free SCC test removed 1177 places
Ensure Unique test removed 1806 transitions
Reduce isomorphic transitions removed 1806 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 71 rules applied. Total rules applied 72 place count 135 transition count 143
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 136 place count 71 transition count 143
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 136 place count 71 transition count 139
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 144 place count 67 transition count 139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 150 place count 61 transition count 133
Iterating global reduction 2 with 6 rules applied. Total rules applied 156 place count 61 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 61 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 161 place count 57 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 57 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 168 place count 54 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 171 place count 54 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 174 place count 51 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 177 place count 51 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 179 place count 49 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 181 place count 49 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 183 place count 47 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 47 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 186 place count 46 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 187 place count 46 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 201 place count 39 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 205 place count 39 transition count 106
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 209 place count 37 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 213 place count 37 transition count 100
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 217 place count 35 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 221 place count 35 transition count 94
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 225 place count 33 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 229 place count 33 transition count 88
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 233 place count 31 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 237 place count 31 transition count 82
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 241 place count 29 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 245 place count 29 transition count 76
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 249 place count 27 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 253 place count 27 transition count 70
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 257 place count 25 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 261 place count 25 transition count 64
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 265 place count 23 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 269 place count 23 transition count 58
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 273 place count 21 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 277 place count 21 transition count 52
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 281 place count 19 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 285 place count 19 transition count 46
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 289 place count 17 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 293 place count 17 transition count 40
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 297 place count 15 transition count 38
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 301 place count 15 transition count 34
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 305 place count 13 transition count 32
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 309 place count 13 transition count 28
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 313 place count 11 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 317 place count 11 transition count 22
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 321 place count 9 transition count 20
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 325 place count 9 transition count 16
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 329 place count 7 transition count 14
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 334 place count 7 transition count 9
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 336 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 336 place count 6 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 338 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 339 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 339 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 341 place count 4 transition count 5
Applied a total of 341 rules in 45 ms. Remains 4 /1320 variables (removed 1316) and now considering 5/2020 (removed 2015) transitions.
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:22:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:22:13] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:22:13] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:22:13] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-16 02:22:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:22:13] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:22:13] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/1320 places, 5/2020 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/1320 places, 5/2020 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2 1), p1:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-PT-010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-09 finished in 241 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(G(F(G(p1))))))'
Support contains 2 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 320 places :
Symmetric choice reduction at 0 with 320 rule applications. Total rules 320 place count 1000 transition count 1700
Iterating global reduction 0 with 320 rules applied. Total rules applied 640 place count 1000 transition count 1700
Discarding 270 places :
Symmetric choice reduction at 0 with 270 rule applications. Total rules 910 place count 730 transition count 1430
Iterating global reduction 0 with 270 rules applied. Total rules applied 1180 place count 730 transition count 1430
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1220 place count 690 transition count 1390
Iterating global reduction 0 with 40 rules applied. Total rules applied 1260 place count 690 transition count 1390
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1290 place count 660 transition count 1360
Iterating global reduction 0 with 30 rules applied. Total rules applied 1320 place count 660 transition count 1360
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1350 place count 630 transition count 1330
Iterating global reduction 0 with 30 rules applied. Total rules applied 1380 place count 630 transition count 1330
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1410 place count 600 transition count 1300
Iterating global reduction 0 with 30 rules applied. Total rules applied 1440 place count 600 transition count 1300
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1470 place count 570 transition count 1270
Iterating global reduction 0 with 30 rules applied. Total rules applied 1500 place count 570 transition count 1270
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1530 place count 540 transition count 1240
Iterating global reduction 0 with 30 rules applied. Total rules applied 1560 place count 540 transition count 1240
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1580 place count 520 transition count 1220
Iterating global reduction 0 with 20 rules applied. Total rules applied 1600 place count 520 transition count 1220
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1620 place count 500 transition count 1200
Iterating global reduction 0 with 20 rules applied. Total rules applied 1640 place count 500 transition count 1200
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1650 place count 490 transition count 1190
Iterating global reduction 0 with 10 rules applied. Total rules applied 1660 place count 490 transition count 1190
Applied a total of 1660 rules in 230 ms. Remains 490 /1320 variables (removed 830) and now considering 1190/2020 (removed 830) transitions.
// Phase 1: matrix 1190 rows 490 cols
[2022-05-16 02:22:13] [INFO ] Computed 10 place invariants in 16 ms
[2022-05-16 02:22:13] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 1190 rows 490 cols
[2022-05-16 02:22:13] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-16 02:22:14] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
// Phase 1: matrix 1190 rows 490 cols
[2022-05-16 02:22:14] [INFO ] Computed 10 place invariants in 8 ms
[2022-05-16 02:22:14] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 490/1320 places, 1190/2020 transitions.
Finished structural reductions, in 1 iterations. Remains : 490/1320 places, 1190/2020 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BART-PT-010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s12 0), p1:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 274 ms.
Entered a terminal (fully accepting) state of product in 91 steps with 0 reset in 1 ms.
FORMULA BART-PT-010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-10 finished in 1552 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(p0)&&p0))))'
Support contains 1 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 319 places :
Symmetric choice reduction at 0 with 319 rule applications. Total rules 319 place count 1001 transition count 1701
Iterating global reduction 0 with 319 rules applied. Total rules applied 638 place count 1001 transition count 1701
Discarding 269 places :
Symmetric choice reduction at 0 with 269 rule applications. Total rules 907 place count 732 transition count 1432
Iterating global reduction 0 with 269 rules applied. Total rules applied 1176 place count 732 transition count 1432
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1216 place count 692 transition count 1392
Iterating global reduction 0 with 40 rules applied. Total rules applied 1256 place count 692 transition count 1392
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1286 place count 662 transition count 1362
Iterating global reduction 0 with 30 rules applied. Total rules applied 1316 place count 662 transition count 1362
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1346 place count 632 transition count 1332
Iterating global reduction 0 with 30 rules applied. Total rules applied 1376 place count 632 transition count 1332
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1406 place count 602 transition count 1302
Iterating global reduction 0 with 30 rules applied. Total rules applied 1436 place count 602 transition count 1302
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1466 place count 572 transition count 1272
Iterating global reduction 0 with 30 rules applied. Total rules applied 1496 place count 572 transition count 1272
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1525 place count 543 transition count 1243
Iterating global reduction 0 with 29 rules applied. Total rules applied 1554 place count 543 transition count 1243
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1574 place count 523 transition count 1223
Iterating global reduction 0 with 20 rules applied. Total rules applied 1594 place count 523 transition count 1223
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1614 place count 503 transition count 1203
Iterating global reduction 0 with 20 rules applied. Total rules applied 1634 place count 503 transition count 1203
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1644 place count 493 transition count 1193
Iterating global reduction 0 with 10 rules applied. Total rules applied 1654 place count 493 transition count 1193
Applied a total of 1654 rules in 126 ms. Remains 493 /1320 variables (removed 827) and now considering 1193/2020 (removed 827) transitions.
// Phase 1: matrix 1193 rows 493 cols
[2022-05-16 02:22:15] [INFO ] Computed 10 place invariants in 6 ms
[2022-05-16 02:22:15] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 1193 rows 493 cols
[2022-05-16 02:22:15] [INFO ] Computed 10 place invariants in 10 ms
[2022-05-16 02:22:15] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
// Phase 1: matrix 1193 rows 493 cols
[2022-05-16 02:22:15] [INFO ] Computed 10 place invariants in 7 ms
[2022-05-16 02:22:15] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 493/1320 places, 1193/2020 transitions.
Finished structural reductions, in 1 iterations. Remains : 493/1320 places, 1193/2020 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s380 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1570 ms.
Product exploration explored 100000 steps with 33333 reset in 1115 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :p0
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BART-PT-010-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-11 finished in 3994 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(X(G(p0)))))))'
Support contains 2 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 2016 edges and 1320 vertex of which 1186 / 1320 are part of one of the 9 SCC in 3 ms
Free SCC test removed 1177 places
Ensure Unique test removed 1806 transitions
Reduce isomorphic transitions removed 1806 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 71 rules applied. Total rules applied 72 place count 135 transition count 143
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 136 place count 71 transition count 143
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 136 place count 71 transition count 139
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 144 place count 67 transition count 139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 150 place count 61 transition count 133
Iterating global reduction 2 with 6 rules applied. Total rules applied 156 place count 61 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 61 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 161 place count 57 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 57 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 168 place count 54 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 171 place count 54 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 174 place count 51 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 177 place count 51 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 179 place count 49 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 181 place count 49 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 183 place count 47 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 47 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 186 place count 46 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 187 place count 46 transition count 117
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 201 place count 39 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 205 place count 39 transition count 106
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 209 place count 37 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 213 place count 37 transition count 100
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 217 place count 35 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 221 place count 35 transition count 94
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 225 place count 33 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 229 place count 33 transition count 88
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 233 place count 31 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 237 place count 31 transition count 82
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 241 place count 29 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 245 place count 29 transition count 76
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 249 place count 27 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 253 place count 27 transition count 70
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 257 place count 25 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 261 place count 25 transition count 64
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 265 place count 23 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 269 place count 23 transition count 58
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 273 place count 21 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 277 place count 21 transition count 52
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 281 place count 19 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 285 place count 19 transition count 46
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 289 place count 17 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 293 place count 17 transition count 40
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 297 place count 15 transition count 38
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 301 place count 15 transition count 34
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 305 place count 13 transition count 32
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 309 place count 13 transition count 28
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 313 place count 11 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 317 place count 11 transition count 22
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 321 place count 9 transition count 20
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 325 place count 9 transition count 16
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 329 place count 7 transition count 14
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 334 place count 7 transition count 9
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 336 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 336 place count 6 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 338 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 339 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 339 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 341 place count 4 transition count 5
Applied a total of 341 rules in 59 ms. Remains 4 /1320 variables (removed 1316) and now considering 5/2020 (removed 2015) transitions.
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:22:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:22:19] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:22:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:22:19] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2022-05-16 02:22:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:22:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:22:19] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/1320 places, 5/2020 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/1320 places, 5/2020 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BART-PT-010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-12 finished in 242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(((p0 U p1)&&p2)) U X(p3)))'
Support contains 4 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 319 places :
Symmetric choice reduction at 0 with 319 rule applications. Total rules 319 place count 1001 transition count 1701
Iterating global reduction 0 with 319 rules applied. Total rules applied 638 place count 1001 transition count 1701
Discarding 267 places :
Symmetric choice reduction at 0 with 267 rule applications. Total rules 905 place count 734 transition count 1434
Iterating global reduction 0 with 267 rules applied. Total rules applied 1172 place count 734 transition count 1434
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1212 place count 694 transition count 1394
Iterating global reduction 0 with 40 rules applied. Total rules applied 1252 place count 694 transition count 1394
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1282 place count 664 transition count 1364
Iterating global reduction 0 with 30 rules applied. Total rules applied 1312 place count 664 transition count 1364
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1342 place count 634 transition count 1334
Iterating global reduction 0 with 30 rules applied. Total rules applied 1372 place count 634 transition count 1334
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1401 place count 605 transition count 1305
Iterating global reduction 0 with 29 rules applied. Total rules applied 1430 place count 605 transition count 1305
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1459 place count 576 transition count 1276
Iterating global reduction 0 with 29 rules applied. Total rules applied 1488 place count 576 transition count 1276
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1517 place count 547 transition count 1247
Iterating global reduction 0 with 29 rules applied. Total rules applied 1546 place count 547 transition count 1247
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1566 place count 527 transition count 1227
Iterating global reduction 0 with 20 rules applied. Total rules applied 1586 place count 527 transition count 1227
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1605 place count 508 transition count 1208
Iterating global reduction 0 with 19 rules applied. Total rules applied 1624 place count 508 transition count 1208
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1634 place count 498 transition count 1198
Iterating global reduction 0 with 10 rules applied. Total rules applied 1644 place count 498 transition count 1198
Applied a total of 1644 rules in 151 ms. Remains 498 /1320 variables (removed 822) and now considering 1198/2020 (removed 822) transitions.
// Phase 1: matrix 1198 rows 498 cols
[2022-05-16 02:22:19] [INFO ] Computed 10 place invariants in 8 ms
[2022-05-16 02:22:19] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 1198 rows 498 cols
[2022-05-16 02:22:19] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-16 02:22:19] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
// Phase 1: matrix 1198 rows 498 cols
[2022-05-16 02:22:19] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-16 02:22:20] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 498/1320 places, 1198/2020 transitions.
Finished structural reductions, in 1 iterations. Remains : 498/1320 places, 1198/2020 transitions.
Stuttering acceptance computed with spot in 309 ms :[(NOT p3), (NOT p3), (NOT p3), true, (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s271 1), p1:(EQ s101 1), p0:(NEQ s24 1), p3:(EQ s323 1)], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-13 finished in 1282 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((p1 U F(G(p1))) U (p1 U p2))))'
Support contains 4 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 1942 edges and 1320 vertex of which 1054 / 1320 are part of one of the 8 SCC in 2 ms
Free SCC test removed 1046 places
Ensure Unique test removed 1605 transitions
Reduce isomorphic transitions removed 1605 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 267 transition count 283
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 1 with 126 rules applied. Total rules applied 259 place count 141 transition count 283
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 259 place count 141 transition count 273
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 279 place count 131 transition count 273
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 291 place count 119 transition count 261
Iterating global reduction 2 with 12 rules applied. Total rules applied 303 place count 119 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 305 place count 119 transition count 259
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 313 place count 111 transition count 251
Iterating global reduction 3 with 8 rules applied. Total rules applied 321 place count 111 transition count 251
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 327 place count 105 transition count 245
Iterating global reduction 3 with 6 rules applied. Total rules applied 333 place count 105 transition count 245
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 339 place count 99 transition count 239
Iterating global reduction 3 with 6 rules applied. Total rules applied 345 place count 99 transition count 239
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 349 place count 95 transition count 235
Iterating global reduction 3 with 4 rules applied. Total rules applied 353 place count 95 transition count 235
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 357 place count 91 transition count 231
Iterating global reduction 3 with 4 rules applied. Total rules applied 361 place count 91 transition count 231
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 363 place count 89 transition count 229
Iterating global reduction 3 with 2 rules applied. Total rules applied 365 place count 89 transition count 229
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 393 place count 75 transition count 215
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 401 place count 75 transition count 207
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 4 with 8 rules applied. Total rules applied 409 place count 71 transition count 203
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 417 place count 71 transition count 195
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 5 with 8 rules applied. Total rules applied 425 place count 67 transition count 191
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 433 place count 67 transition count 183
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 6 with 8 rules applied. Total rules applied 441 place count 63 transition count 179
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 449 place count 63 transition count 171
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 457 place count 59 transition count 167
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 465 place count 59 transition count 159
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 8 with 8 rules applied. Total rules applied 473 place count 55 transition count 155
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 481 place count 55 transition count 147
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 9 with 8 rules applied. Total rules applied 489 place count 51 transition count 143
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 496 place count 51 transition count 136
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 10 with 8 rules applied. Total rules applied 504 place count 47 transition count 132
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 512 place count 47 transition count 124
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 11 with 8 rules applied. Total rules applied 520 place count 43 transition count 120
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 528 place count 43 transition count 112
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 12 with 8 rules applied. Total rules applied 536 place count 39 transition count 108
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 544 place count 39 transition count 100
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 13 with 8 rules applied. Total rules applied 552 place count 35 transition count 96
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 560 place count 35 transition count 88
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 14 with 8 rules applied. Total rules applied 568 place count 31 transition count 84
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 576 place count 31 transition count 76
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 15 with 8 rules applied. Total rules applied 584 place count 27 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 592 place count 27 transition count 64
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 16 with 8 rules applied. Total rules applied 600 place count 23 transition count 60
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 608 place count 23 transition count 52
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 17 with 8 rules applied. Total rules applied 616 place count 19 transition count 48
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 624 place count 19 transition count 40
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 18 with 8 rules applied. Total rules applied 632 place count 15 transition count 36
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 18 with 8 rules applied. Total rules applied 640 place count 15 transition count 28
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 19 with 8 rules applied. Total rules applied 648 place count 11 transition count 24
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 19 with 10 rules applied. Total rules applied 658 place count 11 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 662 place count 9 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 663 place count 9 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 663 place count 9 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 665 place count 8 transition count 10
Applied a total of 665 rules in 37 ms. Remains 8 /1320 variables (removed 1312) and now considering 10/2020 (removed 2010) transitions.
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 02:22:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 02:22:20] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 02:22:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 02:22:20] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-16 02:22:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 02:22:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 02:22:20] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/1320 places, 10/2020 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/1320 places, 10/2020 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : BART-PT-010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s4 1) (EQ s0 1)), p0:(EQ s1 1), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-PT-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-14 finished in 257 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)||p1))||(G(p2)&&F(p2))))'
Support contains 3 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 2011 edges and 1320 vertex of which 1229 / 1320 are part of one of the 10 SCC in 1 ms
Free SCC test removed 1219 places
Ensure Unique test removed 1884 transitions
Reduce isomorphic transitions removed 1884 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 93 transition count 67
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 76 rules applied. Total rules applied 146 place count 31 transition count 53
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 14 rules applied. Total rules applied 160 place count 26 transition count 44
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 172 place count 22 transition count 36
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 12 rules applied. Total rules applied 184 place count 18 transition count 28
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 10 rules applied. Total rules applied 194 place count 14 transition count 22
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 7 rules applied. Total rules applied 201 place count 11 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 203 place count 10 transition count 17
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 205 place count 8 transition count 15
Iterating global reduction 8 with 2 rules applied. Total rules applied 207 place count 8 transition count 15
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 209 place count 8 transition count 13
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 212 place count 8 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 212 place count 8 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 214 place count 7 transition count 9
Applied a total of 214 rules in 12 ms. Remains 7 /1320 variables (removed 1313) and now considering 9/2020 (removed 2011) transitions.
// Phase 1: matrix 9 rows 7 cols
[2022-05-16 02:22:20] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:22:20] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 9 rows 7 cols
[2022-05-16 02:22:20] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:22:20] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-16 02:22:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 7 cols
[2022-05-16 02:22:20] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:22:20] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/1320 places, 9/2020 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/1320 places, 9/2020 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s0 1), p1:(EQ s3 1), p2:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-15 finished in 201 ms.
All properties solved by simple procedures.
Total runtime 144938 ms.

BK_STOP 1652667741090

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BART-PT-010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BART-PT-010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245689600612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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