Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r295-tall-167873948300740.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is PolyORBNT-PT-S05J60, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948300740
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 39K Feb 25 23:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 208K Feb 25 23:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 25 23:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 319K Feb 25 23:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Feb 25 23:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 25 23:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 154K Feb 25 23:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 663K Feb 25 23:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:23 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 PolyORBNT-PT-S05J60-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678899951098

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 17:05:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 17:05:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 17:05:52] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-15 17:05:52] [INFO ] Transformed 909 places.
[2023-03-15 17:05:52] [INFO ] Transformed 1970 transitions.
[2023-03-15 17:05:52] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2023-03-15 17:05:52] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 17:05:52] [INFO ] Reduced 10 identical enabling conditions.
[2023-03-15 17:05:52] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-15 17:05:52] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 764 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 905 transition count 1315
Applied a total of 4 rules in 43 ms. Remains 905 /909 variables (removed 4) and now considering 1315/1315 (removed 0) transitions.
[2023-03-15 17:05:53] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 905 cols
[2023-03-15 17:05:53] [INFO ] Computed 138 place invariants in 96 ms
[2023-03-15 17:05:55] [INFO ] Dead Transitions using invariants and state equation in 2266 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2023-03-15 17:05:55] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
// Phase 1: matrix 1216 rows 905 cols
[2023-03-15 17:05:55] [INFO ] Computed 138 place invariants in 65 ms
[2023-03-15 17:05:56] [INFO ] Implicit Places using invariants in 894 ms returned []
[2023-03-15 17:05:56] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-15 17:05:56] [INFO ] Invariant cache hit.
[2023-03-15 17:05:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:06:04] [INFO ] Implicit Places using invariants and state equation in 8419 ms returned []
Implicit Place search using SMT with State Equation took 9321 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 905/909 places, 1220/1315 transitions.
Applied a total of 0 rules in 20 ms. Remains 905 /905 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11676 ms. Remains : 905/909 places, 1220/1315 transitions.
Support contains 764 out of 905 places after structural reductions.
[2023-03-15 17:06:05] [INFO ] Flatten gal took : 195 ms
[2023-03-15 17:06:05] [INFO ] Flatten gal took : 115 ms
[2023-03-15 17:06:05] [INFO ] Input system was already deterministic with 1220 transitions.
Support contains 641 out of 905 places (down from 764) after GAL structural reductions.
Incomplete random walk after 10001 steps, including 683 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 26) seen :23
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-15 17:06:06] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-15 17:06:06] [INFO ] Invariant cache hit.
[2023-03-15 17:06:06] [INFO ] [Real]Absence check using 112 positive place invariants in 24 ms returned sat
[2023-03-15 17:06:06] [INFO ] [Real]Absence check using 112 positive and 26 generalized place invariants in 49 ms returned sat
[2023-03-15 17:06:06] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 17:06:06] [INFO ] [Nat]Absence check using 112 positive place invariants in 48 ms returned sat
[2023-03-15 17:06:06] [INFO ] [Nat]Absence check using 112 positive and 26 generalized place invariants in 65 ms returned sat
[2023-03-15 17:06:08] [INFO ] After 1969ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 17:06:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:06:08] [INFO ] After 377ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 17:06:09] [INFO ] Deduced a trap composed of 523 places in 327 ms of which 4 ms to minimize.
[2023-03-15 17:06:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 457 ms
[2023-03-15 17:06:09] [INFO ] After 1061ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 342 ms.
[2023-03-15 17:06:09] [INFO ] After 3670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 905 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
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 65 rules applied. Total rules applied 65 place count 904 transition count 1156
Reduce places removed 64 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 840 transition count 1154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 133 place count 838 transition count 1154
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 133 place count 838 transition count 1091
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 259 place count 775 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 260 place count 774 transition count 1090
Iterating global reduction 3 with 1 rules applied. Total rules applied 261 place count 774 transition count 1090
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 265 place count 772 transition count 1088
Applied a total of 265 rules in 275 ms. Remains 772 /905 variables (removed 133) and now considering 1088/1220 (removed 132) transitions.
[2023-03-15 17:06:10] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
// Phase 1: matrix 1084 rows 772 cols
[2023-03-15 17:06:10] [INFO ] Computed 137 place invariants in 20 ms
[2023-03-15 17:06:11] [INFO ] Dead Transitions using invariants and state equation in 1316 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1591 ms. Remains : 772/905 places, 1088/1220 transitions.
Finished random walk after 558 steps, including 26 resets, run visited all 2 properties in 9 ms. (steps per millisecond=62 )
FORMULA PolyORBNT-PT-S05J60-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&F(p1)))'
Support contains 63 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Applied a total of 1 rules in 37 ms. Remains 904 /905 variables (removed 1) and now considering 1220/1220 (removed 0) transitions.
[2023-03-15 17:06:12] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
// Phase 1: matrix 1216 rows 904 cols
[2023-03-15 17:06:12] [INFO ] Computed 137 place invariants in 18 ms
[2023-03-15 17:06:14] [INFO ] Dead Transitions using invariants and state equation in 1970 ms found 0 transitions.
[2023-03-15 17:06:14] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-15 17:06:14] [INFO ] Invariant cache hit.
[2023-03-15 17:06:15] [INFO ] Implicit Places using invariants in 1449 ms returned []
[2023-03-15 17:06:15] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-15 17:06:15] [INFO ] Invariant cache hit.
[2023-03-15 17:06:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:06:31] [INFO ] Implicit Places using invariants and state equation in 15732 ms returned []
Implicit Place search using SMT with State Equation took 17186 ms to find 0 implicit places.
[2023-03-15 17:06:31] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-15 17:06:31] [INFO ] Invariant cache hit.
[2023-03-15 17:06:33] [INFO ] Dead Transitions using invariants and state equation in 1830 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 904/905 places, 1220/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21027 ms. Remains : 904/905 places, 1220/1220 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s350 1), p0:(OR (AND (GEQ s33 1) (GEQ s261 1)) (AND (GEQ s261 1) (GEQ s467 1)) (AND (GEQ s261 1) (GEQ s865 1)) (AND (GEQ s13 1) (GEQ s261 1)) (AND...], 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]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-00 finished in 21348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 62 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 39 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-15 17:06:33] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-15 17:06:33] [INFO ] Computed 137 place invariants in 39 ms
[2023-03-15 17:06:35] [INFO ] Dead Transitions using invariants and state equation in 1936 ms found 0 transitions.
[2023-03-15 17:06:35] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:06:35] [INFO ] Invariant cache hit.
[2023-03-15 17:06:36] [INFO ] Implicit Places using invariants in 1441 ms returned []
[2023-03-15 17:06:36] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:06:36] [INFO ] Invariant cache hit.
[2023-03-15 17:06:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:06:55] [INFO ] Implicit Places using invariants and state equation in 18974 ms returned []
Implicit Place search using SMT with State Equation took 20431 ms to find 0 implicit places.
[2023-03-15 17:06:55] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:06:55] [INFO ] Invariant cache hit.
[2023-03-15 17:06:57] [INFO ] Dead Transitions using invariants and state equation in 1903 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24321 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GEQ s489 2), p0:(OR (GEQ s489 2) (GEQ s445 1) (GEQ s133 1) (GEQ s131 1) (GEQ s765 1) (GEQ s135 1) (GEQ s639 1) (GEQ s453 1) (GEQ s893 1) (GEQ s325 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-01 finished in 24498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 429 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1215
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 899 transition count 1215
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 10 place count 899 transition count 1150
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 140 place count 834 transition count 1150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 833 transition count 1149
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 833 transition count 1149
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 2 with 4 rules applied. Total rules applied 146 place count 831 transition count 1147
Applied a total of 146 rules in 87 ms. Remains 831 /905 variables (removed 74) and now considering 1147/1220 (removed 73) transitions.
[2023-03-15 17:06:57] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
// Phase 1: matrix 1143 rows 831 cols
[2023-03-15 17:06:57] [INFO ] Computed 137 place invariants in 19 ms
[2023-03-15 17:06:59] [INFO ] Dead Transitions using invariants and state equation in 1410 ms found 0 transitions.
[2023-03-15 17:06:59] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
[2023-03-15 17:06:59] [INFO ] Invariant cache hit.
[2023-03-15 17:07:00] [INFO ] Implicit Places using invariants in 872 ms returned []
[2023-03-15 17:07:00] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
[2023-03-15 17:07:00] [INFO ] Invariant cache hit.
[2023-03-15 17:07:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:07:07] [INFO ] Implicit Places using invariants and state equation in 6780 ms returned []
Implicit Place search using SMT with State Equation took 7655 ms to find 0 implicit places.
[2023-03-15 17:07:07] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-15 17:07:07] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
[2023-03-15 17:07:07] [INFO ] Invariant cache hit.
[2023-03-15 17:07:08] [INFO ] Dead Transitions using invariants and state equation in 1292 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 831/905 places, 1147/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10533 ms. Remains : 831/905 places, 1147/1220 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s483 1)) (AND (GEQ s77 1) (GEQ s671 1)) (AND (GEQ s245 1) (GEQ s681 1)) (AND (GEQ s296 1) (GEQ s465 1)) (AND (GEQ s208 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-02 finished in 10634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 7 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 58 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-15 17:07:08] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-15 17:07:08] [INFO ] Computed 137 place invariants in 32 ms
[2023-03-15 17:07:10] [INFO ] Dead Transitions using invariants and state equation in 1868 ms found 0 transitions.
[2023-03-15 17:07:10] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:07:10] [INFO ] Invariant cache hit.
[2023-03-15 17:07:11] [INFO ] Implicit Places using invariants in 1447 ms returned []
[2023-03-15 17:07:11] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:07:11] [INFO ] Invariant cache hit.
[2023-03-15 17:07:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:07:28] [INFO ] Implicit Places using invariants and state equation in 17040 ms returned []
Implicit Place search using SMT with State Equation took 18488 ms to find 0 implicit places.
[2023-03-15 17:07:28] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:07:28] [INFO ] Invariant cache hit.
[2023-03-15 17:07:30] [INFO ] Dead Transitions using invariants and state equation in 1901 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22324 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-03 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 (AND (GEQ s119 1) (GEQ s212 2) (GEQ s528 1) (GEQ s710 7)) (AND (GEQ s119 1) (GEQ s528 1) (GEQ s536 1) (GEQ s710 7) (GEQ s819 1)) (AND (GEQ s119 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-03 finished in 22433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 7 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 50 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-15 17:07:30] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:07:30] [INFO ] Invariant cache hit.
[2023-03-15 17:07:32] [INFO ] Dead Transitions using invariants and state equation in 1872 ms found 0 transitions.
[2023-03-15 17:07:32] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:07:32] [INFO ] Invariant cache hit.
[2023-03-15 17:07:34] [INFO ] Implicit Places using invariants in 1435 ms returned []
[2023-03-15 17:07:34] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:07:34] [INFO ] Invariant cache hit.
[2023-03-15 17:07:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:07:49] [INFO ] Implicit Places using invariants and state equation in 15194 ms returned []
Implicit Place search using SMT with State Equation took 16631 ms to find 0 implicit places.
[2023-03-15 17:07:49] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:07:49] [INFO ] Invariant cache hit.
[2023-03-15 17:07:51] [INFO ] Dead Transitions using invariants and state equation in 1928 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20498 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s119 1) (LT s457 1) (LT s536 2) (LT s710 6) (LT s819 1)) (OR (LT s119 1) (LT s212 1) (LT s457 2) (LT s528 1) (LT s710 6)) (OR (LT s119 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1092 ms.
Product exploration explored 100000 steps with 50000 reset in 1076 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J60-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-04 finished in 22963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (X(!X((!F(p2) U X(p3)))) U p3)))'
Support contains 73 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 50 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-15 17:07:53] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:07:53] [INFO ] Invariant cache hit.
[2023-03-15 17:07:55] [INFO ] Dead Transitions using invariants and state equation in 1874 ms found 0 transitions.
[2023-03-15 17:07:55] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:07:55] [INFO ] Invariant cache hit.
[2023-03-15 17:07:57] [INFO ] Implicit Places using invariants in 1319 ms returned []
[2023-03-15 17:07:57] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:07:57] [INFO ] Invariant cache hit.
[2023-03-15 17:07:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:08:12] [INFO ] Implicit Places using invariants and state equation in 15061 ms returned []
Implicit Place search using SMT with State Equation took 16386 ms to find 0 implicit places.
[2023-03-15 17:08:12] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:08:12] [INFO ] Invariant cache hit.
[2023-03-15 17:08:14] [INFO ] Dead Transitions using invariants and state equation in 1913 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20228 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 559 ms :[(NOT p3), true, (AND (NOT p1) p3), p3, p3, (AND (NOT p2) p3), true, (AND (NOT p1) p3), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) p3), (NOT p2), (AND (NOT p1) (NOT p2) p3), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=p3, acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 10}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 12}], [{ cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=10 dest: 6}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=10 dest: 13}], [{ cond=(NOT p2), acceptance={0} source=11 dest: 11}], [{ cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 11}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={} source=12 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=14 dest: 14}]], initial=0, aps=[p3:(OR (AND (GEQ s110 1) (GEQ s305 1) (GEQ s835 1)) (AND (GEQ s305 1) (GEQ s807 1) (GEQ s835 1)) (AND (GEQ s305 1) (GEQ s495 1) (GEQ s835 1)) (AND (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 773 steps with 81 reset in 28 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-05 finished in 20849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 904 transition count 1156
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 840 transition count 1155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 130 place count 839 transition count 1091
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 258 place count 775 transition count 1091
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 3 with 4 rules applied. Total rules applied 262 place count 773 transition count 1089
Applied a total of 262 rules in 90 ms. Remains 773 /905 variables (removed 132) and now considering 1089/1220 (removed 131) transitions.
[2023-03-15 17:08:14] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
// Phase 1: matrix 1085 rows 773 cols
[2023-03-15 17:08:14] [INFO ] Computed 137 place invariants in 19 ms
[2023-03-15 17:08:15] [INFO ] Dead Transitions using invariants and state equation in 1160 ms found 0 transitions.
[2023-03-15 17:08:15] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-15 17:08:15] [INFO ] Invariant cache hit.
[2023-03-15 17:08:17] [INFO ] Implicit Places using invariants in 1352 ms returned []
[2023-03-15 17:08:17] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-15 17:08:17] [INFO ] Invariant cache hit.
[2023-03-15 17:08:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:08:31] [INFO ] Implicit Places using invariants and state equation in 14342 ms returned []
Implicit Place search using SMT with State Equation took 15696 ms to find 0 implicit places.
[2023-03-15 17:08:31] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-15 17:08:31] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-15 17:08:31] [INFO ] Invariant cache hit.
[2023-03-15 17:08:32] [INFO ] Dead Transitions using invariants and state equation in 1063 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 773/905 places, 1089/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18074 ms. Remains : 773/905 places, 1089/1220 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s396 1) (GEQ s687 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 35 steps with 2 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-06 finished in 18117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(X(p0) U ((p1 U p2)||F(p1))))||G(F(p3))))'
Support contains 7 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 46 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-15 17:08:32] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-15 17:08:32] [INFO ] Computed 137 place invariants in 23 ms
[2023-03-15 17:08:34] [INFO ] Dead Transitions using invariants and state equation in 1864 ms found 0 transitions.
[2023-03-15 17:08:34] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:08:34] [INFO ] Invariant cache hit.
[2023-03-15 17:08:36] [INFO ] Implicit Places using invariants in 1383 ms returned []
[2023-03-15 17:08:36] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:08:36] [INFO ] Invariant cache hit.
[2023-03-15 17:08:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:08:53] [INFO ] Implicit Places using invariants and state equation in 17086 ms returned []
Implicit Place search using SMT with State Equation took 18472 ms to find 0 implicit places.
[2023-03-15 17:08:53] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:08:53] [INFO ] Invariant cache hit.
[2023-03-15 17:08:55] [INFO ] Dead Transitions using invariants and state equation in 1905 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22290 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1) p2 p0), (AND (NOT p3) p1)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(OR p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s158 1) (GEQ s835 1) (GEQ s866 1)), p3:(LT s689 1), p2:(AND (GEQ s90 1) (GEQ s345 1)), p0:(GEQ s208 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]]
Product exploration explored 100000 steps with 11418 reset in 399 ms.
Product exploration explored 100000 steps with 11529 reset in 412 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) p3 (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (OR p1 p2))), (X (X p3)), true, (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 553 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) p1)]
Incomplete random walk after 10000 steps, including 686 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:08:57] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:08:57] [INFO ] Invariant cache hit.
[2023-03-15 17:08:57] [INFO ] [Real]Absence check using 112 positive place invariants in 21 ms returned sat
[2023-03-15 17:08:57] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 43 ms returned sat
[2023-03-15 17:08:57] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (OR p1 p2))), (X (X p3)), true, (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p1))), (G (NOT (AND (NOT p3) p1)))]
False Knowledge obtained : [(F p1), (F (NOT p3)), (F (AND p0 (NOT p1))), (F (AND (NOT p3) (NOT p1)))]
Knowledge based reduction with 12 factoid took 616 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (NOT p3), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) p1)]
Stuttering acceptance computed with spot in 214 ms :[(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (NOT p3), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) p1)]
Support contains 5 out of 903 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1219/1219 transitions.
Applied a total of 0 rules in 25 ms. Remains 903 /903 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
[2023-03-15 17:08:58] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:08:58] [INFO ] Invariant cache hit.
[2023-03-15 17:09:00] [INFO ] Dead Transitions using invariants and state equation in 1900 ms found 0 transitions.
[2023-03-15 17:09:00] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:09:00] [INFO ] Invariant cache hit.
[2023-03-15 17:09:01] [INFO ] Implicit Places using invariants in 1370 ms returned []
[2023-03-15 17:09:01] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:09:01] [INFO ] Invariant cache hit.
[2023-03-15 17:09:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:09:18] [INFO ] Implicit Places using invariants and state equation in 16712 ms returned []
Implicit Place search using SMT with State Equation took 18084 ms to find 0 implicit places.
[2023-03-15 17:09:18] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:09:18] [INFO ] Invariant cache hit.
[2023-03-15 17:09:20] [INFO ] Dead Transitions using invariants and state equation in 1937 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21949 ms. Remains : 903/903 places, 1219/1219 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 p3 (NOT p0) (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), (NOT p3), (AND (NOT p3) p1)]
Finished random walk after 2264 steps, including 159 resets, run visited all 2 properties in 21 ms. (steps per millisecond=107 )
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p3)), (F p1)]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), (NOT p3), (AND (NOT p3) p1)]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), (NOT p3), (AND (NOT p3) p1)]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), (NOT p3), (AND (NOT p3) p1)]
Product exploration explored 100000 steps with 6995 reset in 301 ms.
Product exploration explored 100000 steps with 6999 reset in 344 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), (NOT p3), (AND (NOT p3) p1)]
Support contains 4 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1219/1219 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 903 transition count 1219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 64 place count 903 transition count 1220
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 903 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 902 transition count 1219
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 902 transition count 1219
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 130 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 133 place count 902 transition count 1219
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 197 place count 838 transition count 1155
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 64 rules applied. Total rules applied 261 place count 838 transition count 1155
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 261 rules in 210 ms. Remains 838 /903 variables (removed 65) and now considering 1155/1219 (removed 64) transitions.
[2023-03-15 17:09:22] [INFO ] Flow matrix only has 1151 transitions (discarded 4 similar events)
// Phase 1: matrix 1151 rows 838 cols
[2023-03-15 17:09:22] [INFO ] Computed 137 place invariants in 24 ms
[2023-03-15 17:09:23] [INFO ] Dead Transitions using invariants and state equation in 1097 ms found 0 transitions.
[2023-03-15 17:09:23] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-15 17:09:23] [INFO ] Flow matrix only has 1151 transitions (discarded 4 similar events)
[2023-03-15 17:09:23] [INFO ] Invariant cache hit.
[2023-03-15 17:09:24] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 838/903 places, 1155/1219 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2348 ms. Remains : 838/903 places, 1155/1219 transitions.
Support contains 4 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1219/1219 transitions.
Applied a total of 0 rules in 19 ms. Remains 903 /903 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
[2023-03-15 17:09:24] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-15 17:09:24] [INFO ] Computed 137 place invariants in 24 ms
[2023-03-15 17:09:26] [INFO ] Dead Transitions using invariants and state equation in 1829 ms found 0 transitions.
[2023-03-15 17:09:26] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:09:26] [INFO ] Invariant cache hit.
[2023-03-15 17:09:27] [INFO ] Implicit Places using invariants in 1441 ms returned []
[2023-03-15 17:09:27] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:09:27] [INFO ] Invariant cache hit.
[2023-03-15 17:09:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:09:45] [INFO ] Implicit Places using invariants and state equation in 17755 ms returned []
Implicit Place search using SMT with State Equation took 19199 ms to find 0 implicit places.
[2023-03-15 17:09:45] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:09:45] [INFO ] Invariant cache hit.
[2023-03-15 17:09:47] [INFO ] Dead Transitions using invariants and state equation in 1930 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22981 ms. Remains : 903/903 places, 1219/1219 transitions.
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-10 finished in 74977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||F((G(p1)||(F(p3)&&p2)))) U (p4 U p1)))'
Support contains 10 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 905 transition count 1157
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 842 transition count 1156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 841 transition count 1156
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 128 place count 841 transition count 1094
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 252 place count 779 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 253 place count 778 transition count 1093
Iterating global reduction 3 with 1 rules applied. Total rules applied 254 place count 778 transition count 1093
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 256 place count 777 transition count 1092
Applied a total of 256 rules in 125 ms. Remains 777 /905 variables (removed 128) and now considering 1092/1220 (removed 128) transitions.
[2023-03-15 17:09:48] [INFO ] Flow matrix only has 1088 transitions (discarded 4 similar events)
// Phase 1: matrix 1088 rows 777 cols
[2023-03-15 17:09:48] [INFO ] Computed 138 place invariants in 17 ms
[2023-03-15 17:09:49] [INFO ] Dead Transitions using invariants and state equation in 1213 ms found 0 transitions.
[2023-03-15 17:09:49] [INFO ] Flow matrix only has 1088 transitions (discarded 4 similar events)
[2023-03-15 17:09:49] [INFO ] Invariant cache hit.
[2023-03-15 17:09:50] [INFO ] Implicit Places using invariants in 1235 ms returned []
[2023-03-15 17:09:50] [INFO ] Flow matrix only has 1088 transitions (discarded 4 similar events)
[2023-03-15 17:09:50] [INFO ] Invariant cache hit.
[2023-03-15 17:09:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:10:05] [INFO ] Implicit Places using invariants and state equation in 15127 ms returned []
Implicit Place search using SMT with State Equation took 16365 ms to find 0 implicit places.
[2023-03-15 17:10:05] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 17:10:05] [INFO ] Flow matrix only has 1088 transitions (discarded 4 similar events)
[2023-03-15 17:10:05] [INFO ] Invariant cache hit.
[2023-03-15 17:10:06] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 777/905 places, 1092/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18894 ms. Remains : 777/905 places, 1092/1220 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p4) p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p4) p0 p2 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p4 p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p4 p0 p2 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p4) (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p4 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p4 (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p4) (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p4) (NOT p2) (NOT p3))), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p1) p4 (NOT p0) (NOT p3)) (AND (NOT p1) p4 (NOT p2) (NOT p3))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s602 1), p4:(GEQ s691 1), p0:(AND (GEQ s57 1) (GEQ s70 1) (GEQ s612 1) (GEQ s636 1)), p2:(AND (GEQ s125 1) (GEQ s261 1)), p3:(AND (GEQ s80 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-11 finished in 19159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0&&X(G(p1))) U p2))))'
Support contains 4 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 904 transition count 1157
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 128 place count 841 transition count 1155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 130 place count 839 transition count 1092
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 256 place count 776 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 257 place count 775 transition count 1091
Iterating global reduction 3 with 1 rules applied. Total rules applied 258 place count 775 transition count 1091
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 3 with 4 rules applied. Total rules applied 262 place count 773 transition count 1089
Applied a total of 262 rules in 97 ms. Remains 773 /905 variables (removed 132) and now considering 1089/1220 (removed 131) transitions.
[2023-03-15 17:10:07] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
// Phase 1: matrix 1085 rows 773 cols
[2023-03-15 17:10:07] [INFO ] Computed 137 place invariants in 16 ms
[2023-03-15 17:10:08] [INFO ] Dead Transitions using invariants and state equation in 1149 ms found 0 transitions.
[2023-03-15 17:10:08] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-15 17:10:08] [INFO ] Invariant cache hit.
[2023-03-15 17:10:09] [INFO ] Implicit Places using invariants in 1257 ms returned []
[2023-03-15 17:10:09] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-15 17:10:09] [INFO ] Invariant cache hit.
[2023-03-15 17:10:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:10:27] [INFO ] Implicit Places using invariants and state equation in 17725 ms returned []
Implicit Place search using SMT with State Equation took 18985 ms to find 0 implicit places.
[2023-03-15 17:10:27] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-15 17:10:27] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-15 17:10:27] [INFO ] Invariant cache hit.
[2023-03-15 17:10:28] [INFO ] Dead Transitions using invariants and state equation in 1101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 773/905 places, 1089/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21365 ms. Remains : 773/905 places, 1089/1220 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s599 1), p0:(GEQ s598 1), p1:(AND (GEQ s221 1) (GEQ s371 1))], nbAcceptance=2, 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 23 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-13 finished in 21484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1155
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 839 transition count 1090
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 774 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 773 transition count 1089
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 773 transition count 1089
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 2 with 4 rules applied. Total rules applied 266 place count 771 transition count 1087
Applied a total of 266 rules in 94 ms. Remains 771 /905 variables (removed 134) and now considering 1087/1220 (removed 133) transitions.
[2023-03-15 17:10:28] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 17:10:28] [INFO ] Computed 137 place invariants in 15 ms
[2023-03-15 17:10:29] [INFO ] Dead Transitions using invariants and state equation in 1108 ms found 0 transitions.
[2023-03-15 17:10:29] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-15 17:10:29] [INFO ] Invariant cache hit.
[2023-03-15 17:10:30] [INFO ] Implicit Places using invariants in 1271 ms returned []
[2023-03-15 17:10:30] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-15 17:10:30] [INFO ] Invariant cache hit.
[2023-03-15 17:10:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:10:42] [INFO ] Implicit Places using invariants and state equation in 11123 ms returned []
Implicit Place search using SMT with State Equation took 12397 ms to find 0 implicit places.
[2023-03-15 17:10:42] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-15 17:10:42] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-15 17:10:42] [INFO ] Invariant cache hit.
[2023-03-15 17:10:43] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 771/905 places, 1087/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14733 ms. Remains : 771/905 places, 1087/1220 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s75 1) (GEQ s707 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 21 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-14 finished in 14777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(!p1&&X(X(F(p2)))))))'
Support contains 6 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 48 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-15 17:10:43] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-15 17:10:43] [INFO ] Computed 137 place invariants in 26 ms
[2023-03-15 17:10:45] [INFO ] Dead Transitions using invariants and state equation in 1845 ms found 0 transitions.
[2023-03-15 17:10:45] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:10:45] [INFO ] Invariant cache hit.
[2023-03-15 17:10:46] [INFO ] Implicit Places using invariants in 1451 ms returned []
[2023-03-15 17:10:46] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:10:46] [INFO ] Invariant cache hit.
[2023-03-15 17:10:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:11:03] [INFO ] Implicit Places using invariants and state equation in 16801 ms returned []
Implicit Place search using SMT with State Equation took 18254 ms to find 0 implicit places.
[2023-03-15 17:11:03] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-15 17:11:03] [INFO ] Invariant cache hit.
[2023-03-15 17:11:05] [INFO ] Dead Transitions using invariants and state equation in 1894 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22044 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=1, aps=[p2:(GEQ s379 1), p0:(AND (GEQ s305 1) (GEQ s664 1) (GEQ s835 1)), p1:(AND (GEQ s158 1) (GEQ s835 1) (GEQ s866 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-15 finished in 22333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(X(p0) U ((p1 U p2)||F(p1))))||G(F(p3))))'
[2023-03-15 17:11:05] [INFO ] Flatten gal took : 74 ms
[2023-03-15 17:11:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-15 17:11:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 905 places, 1220 transitions and 5836 arcs took 6 ms.
Total runtime 313312 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBNT-PT-S05J60
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/366
LTLFireability

BK_STOP 1678900301980

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/366/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/366/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/366/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: RELEASE
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: RELEASE
lola: RELEASE
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 PolyORBNT-PT-S05J60-LTLFireability-10
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J60-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3599 5/32 PolyORBNT-PT-S05J60-LTLFireability-10 329044 m, 65808 m/sec, 854576 t fired, .

Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J60-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/3599 10/32 PolyORBNT-PT-S05J60-LTLFireability-10 661076 m, 66406 m/sec, 1725009 t fired, .

Time elapsed: 10 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J60-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/3599 15/32 PolyORBNT-PT-S05J60-LTLFireability-10 1002597 m, 68304 m/sec, 2592855 t fired, .

Time elapsed: 15 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J60-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3599 21/32 PolyORBNT-PT-S05J60-LTLFireability-10 1341083 m, 67697 m/sec, 3456914 t fired, .

Time elapsed: 20 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J60-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3599 25/32 PolyORBNT-PT-S05J60-LTLFireability-10 1660868 m, 63957 m/sec, 4286735 t fired, .

Time elapsed: 25 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J60-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3599 29/32 PolyORBNT-PT-S05J60-LTLFireability-10 1968568 m, 61540 m/sec, 5106425 t fired, .

Time elapsed: 30 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for PolyORBNT-PT-S05J60-LTLFireability-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J60-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J60-LTLFireability-10: LTL unknown AGGR


Time elapsed: 35 secs. Pages in use: 32

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="PolyORBNT-PT-S05J60"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is PolyORBNT-PT-S05J60, 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 r295-tall-167873948300740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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