About the Execution of LTSMin+red for PolyORBLF-PT-S02J06T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 807.600 | 232162.00 | 265787.00 | 1076.20 | T?FTFFFTFFTFFFFT | normal |
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.r297-tall-167873950600532.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 ltsminxred
Input is PolyORBLF-PT-S02J06T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950600532
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 16K Feb 26 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 26 13:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 204K Feb 26 13:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 26 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 59K Feb 26 13:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 299K Feb 26 13:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 PolyORBLF-PT-S02J06T10-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679556503226
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 07:28:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 07:28:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:28:25] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-23 07:28:25] [INFO ] Transformed 844 places.
[2023-03-23 07:28:25] [INFO ] Transformed 1812 transitions.
[2023-03-23 07:28:25] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
[2023-03-23 07:28:25] [INFO ] Reduced 110 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 309 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Applied a total of 22 rules in 111 ms. Remains 832 /844 variables (removed 12) and now considering 1642/1652 (removed 10) transitions.
[2023-03-23 07:28:25] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
// Phase 1: matrix 1622 rows 832 cols
[2023-03-23 07:28:25] [INFO ] Computed 56 place invariants in 99 ms
[2023-03-23 07:28:28] [INFO ] Dead Transitions using invariants and state equation in 2581 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
[2023-03-23 07:28:28] [INFO ] Flow matrix only has 1512 transitions (discarded 20 similar events)
// Phase 1: matrix 1512 rows 832 cols
[2023-03-23 07:28:28] [INFO ] Computed 56 place invariants in 59 ms
[2023-03-23 07:28:28] [INFO ] Implicit Places using invariants in 589 ms returned []
[2023-03-23 07:28:28] [INFO ] Flow matrix only has 1512 transitions (discarded 20 similar events)
[2023-03-23 07:28:28] [INFO ] Invariant cache hit.
[2023-03-23 07:28:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 07:28:41] [INFO ] Implicit Places using invariants and state equation in 12836 ms returned []
Implicit Place search using SMT with State Equation took 13429 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 832/844 places, 1532/1652 transitions.
Reduce places removed 2 places and 20 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 830 transition count 1512
Reduce places removed 20 places and 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 22 place count 810 transition count 1492
Applied a total of 22 rules in 27 ms. Remains 810 /832 variables (removed 22) and now considering 1492/1532 (removed 40) transitions.
[2023-03-23 07:28:41] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
// Phase 1: matrix 1472 rows 810 cols
[2023-03-23 07:28:41] [INFO ] Computed 56 place invariants in 29 ms
[2023-03-23 07:28:42] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-23 07:28:42] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-23 07:28:42] [INFO ] Invariant cache hit.
[2023-03-23 07:28:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 07:28:52] [INFO ] Implicit Places using invariants and state equation in 9713 ms returned []
Implicit Place search using SMT with State Equation took 10300 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 810/844 places, 1492/1652 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26483 ms. Remains : 810/844 places, 1492/1652 transitions.
Support contains 309 out of 810 places after structural reductions.
[2023-03-23 07:28:52] [INFO ] Flatten gal took : 143 ms
[2023-03-23 07:28:52] [INFO ] Flatten gal took : 103 ms
[2023-03-23 07:28:52] [INFO ] Input system was already deterministic with 1492 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 23) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 07:28:53] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-23 07:28:53] [INFO ] Invariant cache hit.
[2023-03-23 07:28:54] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-23 07:28:54] [INFO ] [Real]Absence check using 15 positive and 41 generalized place invariants in 47 ms returned sat
[2023-03-23 07:28:55] [INFO ] After 1591ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-23 07:28:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-23 07:28:55] [INFO ] [Nat]Absence check using 15 positive and 41 generalized place invariants in 30 ms returned sat
[2023-03-23 07:28:56] [INFO ] After 1142ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-23 07:28:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 07:28:58] [INFO ] After 1443ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2023-03-23 07:28:58] [INFO ] After 1568ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 347 ms.
[2023-03-23 07:28:58] [INFO ] After 3258ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 1492/1492 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 810 transition count 1422
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 740 transition count 1422
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 140 place count 740 transition count 1322
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 place count 640 transition count 1322
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 520 place count 550 transition count 1232
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 540 place count 550 transition count 1212
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 560 place count 530 transition count 1212
Applied a total of 560 rules in 223 ms. Remains 530 /810 variables (removed 280) and now considering 1212/1492 (removed 280) transitions.
[2023-03-23 07:28:58] [INFO ] Flow matrix only has 1192 transitions (discarded 20 similar events)
// Phase 1: matrix 1192 rows 530 cols
[2023-03-23 07:28:58] [INFO ] Computed 56 place invariants in 18 ms
[2023-03-23 07:29:00] [INFO ] Dead Transitions using invariants and state equation in 1270 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1494 ms. Remains : 530/810 places, 1212/1492 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Finished probabilistic random walk after 105325 steps, run visited all 1 properties in 2211 ms. (steps per millisecond=47 )
Probabilistic random walk after 105325 steps, saw 72529 distinct states, run finished after 2211 ms. (steps per millisecond=47 ) properties seen :1
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 91 out of 810 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 810/810 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 800 transition count 1482
Applied a total of 20 rules in 37 ms. Remains 800 /810 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-23 07:29:02] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
// Phase 1: matrix 1462 rows 800 cols
[2023-03-23 07:29:03] [INFO ] Computed 56 place invariants in 37 ms
[2023-03-23 07:29:05] [INFO ] Dead Transitions using invariants and state equation in 2166 ms found 0 transitions.
[2023-03-23 07:29:05] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:29:05] [INFO ] Invariant cache hit.
[2023-03-23 07:29:05] [INFO ] Implicit Places using invariants in 792 ms returned [101, 199, 247, 438, 511, 551, 554, 607, 756, 797]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 808 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 790/810 places, 1482/1492 transitions.
Applied a total of 0 rules in 13 ms. Remains 790 /790 variables (removed 0) and now considering 1482/1482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3027 ms. Remains : 790/810 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s41 1) (LT s227 1)) (OR (LT s533 1) (LT s536 1)) (OR (LT s135 1) (LT s665 1)) (OR (LT s210 1) (LT s580 1)) (OR (LT s54 1) (LT s68 1)) (OR ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1215 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 : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-00 finished in 5709 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(X(F((p0 U (p1||G(p0))))))))'
Support contains 21 out of 810 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 810/810 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 800 transition count 1482
Applied a total of 20 rules in 32 ms. Remains 800 /810 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-23 07:29:08] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:29:08] [INFO ] Invariant cache hit.
[2023-03-23 07:29:10] [INFO ] Dead Transitions using invariants and state equation in 1959 ms found 0 transitions.
[2023-03-23 07:29:10] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:29:10] [INFO ] Invariant cache hit.
[2023-03-23 07:29:11] [INFO ] Implicit Places using invariants in 884 ms returned [101, 199, 247, 438, 511, 551, 554, 607, 756, 797]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 886 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 790/810 places, 1482/1492 transitions.
Applied a total of 0 rules in 13 ms. Remains 790 /790 variables (removed 0) and now considering 1482/1482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2897 ms. Remains : 790/810 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (OR (GEQ s579 1) (GEQ s303 1) (GEQ s179 1) (GEQ s253 1) (GEQ s178 1) (GEQ s468 1) (GEQ s479 1) (GEQ s710 1) (GEQ s358 1) (GEQ s46 1))) (OR (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2727 reset in 752 ms.
Product exploration explored 100000 steps with 2733 reset in 778 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 07:29:13] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
// Phase 1: matrix 1462 rows 790 cols
[2023-03-23 07:29:13] [INFO ] Computed 46 place invariants in 29 ms
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 30 ms returned sat
[2023-03-23 07:29:13] [INFO ] After 168ms 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) (NOT p0)), true, (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-23 07:29:14] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:29:14] [INFO ] Invariant cache hit.
[2023-03-23 07:29:15] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2023-03-23 07:29:15] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 91 ms returned sat
[2023-03-23 07:29:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:18] [INFO ] [Real]Absence check using state equation in 2768 ms returned sat
[2023-03-23 07:29:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-23 07:29:19] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 140 ms returned sat
[2023-03-23 07:29:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:24] [INFO ] [Nat]Absence check using state equation in 4662 ms returned sat
[2023-03-23 07:29:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 07:29:25] [INFO ] [Nat]Added 120 Read/Feed constraints in 1271 ms returned sat
[2023-03-23 07:29:25] [INFO ] Deduced a trap composed of 70 places in 307 ms of which 1 ms to minimize.
[2023-03-23 07:29:26] [INFO ] Deduced a trap composed of 314 places in 299 ms of which 1 ms to minimize.
[2023-03-23 07:29:26] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 1 ms to minimize.
[2023-03-23 07:29:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1293 ms
[2023-03-23 07:29:26] [INFO ] Computed and/alt/rep : 770/1508/760 causal constraints (skipped 700 transitions) in 150 ms.
[2023-03-23 07:29:30] [INFO ] Added : 139 causal constraints over 28 iterations in 3173 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 21 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1482/1482 transitions.
Applied a total of 0 rules in 17 ms. Remains 790 /790 variables (removed 0) and now considering 1482/1482 (removed 0) transitions.
[2023-03-23 07:29:30] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:29:30] [INFO ] Invariant cache hit.
[2023-03-23 07:29:32] [INFO ] Dead Transitions using invariants and state equation in 2119 ms found 0 transitions.
[2023-03-23 07:29:32] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:29:32] [INFO ] Invariant cache hit.
[2023-03-23 07:29:32] [INFO ] Implicit Places using invariants in 796 ms returned []
[2023-03-23 07:29:32] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:29:32] [INFO ] Invariant cache hit.
[2023-03-23 07:29:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 07:29:47] [INFO ] Implicit Places using invariants and state equation in 14279 ms returned []
Implicit Place search using SMT with State Equation took 15077 ms to find 0 implicit places.
[2023-03-23 07:29:47] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:29:47] [INFO ] Invariant cache hit.
[2023-03-23 07:29:49] [INFO ] Dead Transitions using invariants and state equation in 2021 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19237 ms. Remains : 790/790 places, 1482/1482 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-23 07:29:49] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:29:49] [INFO ] Invariant cache hit.
[2023-03-23 07:29:51] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2023-03-23 07:29:51] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 85 ms returned sat
[2023-03-23 07:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:53] [INFO ] [Real]Absence check using state equation in 2813 ms returned sat
[2023-03-23 07:29:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-03-23 07:29:55] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 128 ms returned sat
[2023-03-23 07:29:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:59] [INFO ] [Nat]Absence check using state equation in 4710 ms returned sat
[2023-03-23 07:29:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 07:30:01] [INFO ] [Nat]Added 120 Read/Feed constraints in 1291 ms returned sat
[2023-03-23 07:30:01] [INFO ] Deduced a trap composed of 70 places in 275 ms of which 1 ms to minimize.
[2023-03-23 07:30:01] [INFO ] Deduced a trap composed of 314 places in 279 ms of which 1 ms to minimize.
[2023-03-23 07:30:02] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 0 ms to minimize.
[2023-03-23 07:30:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1225 ms
[2023-03-23 07:30:02] [INFO ] Computed and/alt/rep : 770/1508/760 causal constraints (skipped 700 transitions) in 103 ms.
[2023-03-23 07:30:05] [INFO ] Added : 139 causal constraints over 28 iterations in 2919 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2720 reset in 525 ms.
Product exploration explored 100000 steps with 2723 reset in 565 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 21 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1482/1482 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 790 transition count 1482
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 50 place count 790 transition count 1592
Deduced a syphon composed of 160 places in 1 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 160 place count 790 transition count 1592
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 1 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 230 place count 790 transition count 1592
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 259 place count 761 transition count 1563
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 288 place count 761 transition count 1563
Deduced a syphon composed of 210 places in 1 ms
Applied a total of 288 rules in 165 ms. Remains 761 /790 variables (removed 29) and now considering 1563/1482 (removed -81) transitions.
[2023-03-23 07:30:07] [INFO ] Flow matrix only has 1543 transitions (discarded 20 similar events)
// Phase 1: matrix 1543 rows 761 cols
[2023-03-23 07:30:07] [INFO ] Computed 46 place invariants in 27 ms
[2023-03-23 07:30:08] [INFO ] Dead Transitions using invariants and state equation in 1577 ms found 0 transitions.
[2023-03-23 07:30:08] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-23 07:30:08] [INFO ] Flow matrix only has 1543 transitions (discarded 20 similar events)
[2023-03-23 07:30:08] [INFO ] Invariant cache hit.
[2023-03-23 07:30:10] [INFO ] Dead Transitions using invariants and state equation in 1683 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 761/790 places, 1563/1482 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3545 ms. Remains : 761/790 places, 1563/1482 transitions.
Support contains 21 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1482/1482 transitions.
Applied a total of 0 rules in 20 ms. Remains 790 /790 variables (removed 0) and now considering 1482/1482 (removed 0) transitions.
[2023-03-23 07:30:10] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
// Phase 1: matrix 1462 rows 790 cols
[2023-03-23 07:30:10] [INFO ] Computed 46 place invariants in 25 ms
[2023-03-23 07:30:12] [INFO ] Dead Transitions using invariants and state equation in 1911 ms found 0 transitions.
[2023-03-23 07:30:12] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:30:12] [INFO ] Invariant cache hit.
[2023-03-23 07:30:13] [INFO ] Implicit Places using invariants in 902 ms returned []
[2023-03-23 07:30:13] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:30:13] [INFO ] Invariant cache hit.
[2023-03-23 07:30:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 07:30:18] [INFO ] Implicit Places using invariants and state equation in 4871 ms returned []
Implicit Place search using SMT with State Equation took 5775 ms to find 0 implicit places.
[2023-03-23 07:30:18] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:30:18] [INFO ] Invariant cache hit.
[2023-03-23 07:30:20] [INFO ] Dead Transitions using invariants and state equation in 2140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9850 ms. Remains : 790/790 places, 1482/1482 transitions.
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-01 finished in 71903 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&&G((!p1&&X(!p0)))) U X(X(X(G(!p2))))))'
Support contains 43 out of 810 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 810/810 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 800 transition count 1482
Applied a total of 20 rules in 34 ms. Remains 800 /810 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-23 07:30:20] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
// Phase 1: matrix 1462 rows 800 cols
[2023-03-23 07:30:20] [INFO ] Computed 56 place invariants in 22 ms
[2023-03-23 07:30:22] [INFO ] Dead Transitions using invariants and state equation in 2019 ms found 0 transitions.
[2023-03-23 07:30:22] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:30:22] [INFO ] Invariant cache hit.
[2023-03-23 07:30:23] [INFO ] Implicit Places using invariants in 831 ms returned []
[2023-03-23 07:30:23] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:30:23] [INFO ] Invariant cache hit.
[2023-03-23 07:30:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 07:30:31] [INFO ] Implicit Places using invariants and state equation in 8331 ms returned []
Implicit Place search using SMT with State Equation took 9166 ms to find 0 implicit places.
[2023-03-23 07:30:31] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:30:31] [INFO ] Invariant cache hit.
[2023-03-23 07:30:33] [INFO ] Dead Transitions using invariants and state equation in 2136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 800/810 places, 1482/1492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13362 ms. Remains : 800/810 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 380 ms :[true, p2, (OR p2 p0 p1), p2, p2, p2, p2, p2, p2]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 8}], [{ cond=(OR p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(OR p0 p1), acceptance={} source=3 dest: 8}], [{ cond=(OR (NOT p0) p1), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(OR p0 p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=p2, acceptance={} source=8 dest: 0}, { cond=(NOT p2), acceptance={} source=8 dest: 8}]], initial=4, aps=[p0:(OR (AND (GEQ s422 1) (GEQ s557 1)) (AND (GEQ s422 1) (GEQ s601 1)) (AND (GEQ s422 1) (GEQ s558 1)) (AND (GEQ s422 1) (GEQ s456 1)) (AND (GEQ s422 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 59 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-02 finished in 13790 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(F(p0))))'
Support contains 71 out of 810 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 810/810 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 800 transition count 1482
Applied a total of 20 rules in 36 ms. Remains 800 /810 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-23 07:30:34] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:30:34] [INFO ] Invariant cache hit.
[2023-03-23 07:30:36] [INFO ] Dead Transitions using invariants and state equation in 1998 ms found 0 transitions.
[2023-03-23 07:30:36] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:30:36] [INFO ] Invariant cache hit.
[2023-03-23 07:30:37] [INFO ] Implicit Places using invariants in 817 ms returned [101, 199, 247, 438, 511, 551, 554, 607, 756, 797]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 820 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 790/810 places, 1482/1492 transitions.
Applied a total of 0 rules in 10 ms. Remains 790 /790 variables (removed 0) and now considering 1482/1482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2868 ms. Remains : 790/810 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s376 1) (LT s400 1)) (OR (LT s292 1) (LT s400 1)) (OR (LT s400 1) (LT s670 1)) (OR (LT s63 1) (LT s400 1)) (OR (LT s394 1) (LT s400 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 754 ms.
Product exploration explored 100000 steps with 33333 reset in 779 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 54 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-03 finished in 4610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U G(!p1)))'
Support contains 98 out of 810 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 810/810 places, 1492/1492 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 810 transition count 1422
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 740 transition count 1422
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 140 place count 740 transition count 1322
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 place count 640 transition count 1322
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 520 place count 550 transition count 1232
Applied a total of 520 rules in 80 ms. Remains 550 /810 variables (removed 260) and now considering 1232/1492 (removed 260) transitions.
[2023-03-23 07:30:38] [INFO ] Flow matrix only has 1212 transitions (discarded 20 similar events)
// Phase 1: matrix 1212 rows 550 cols
[2023-03-23 07:30:38] [INFO ] Computed 56 place invariants in 27 ms
[2023-03-23 07:30:40] [INFO ] Dead Transitions using invariants and state equation in 1148 ms found 0 transitions.
[2023-03-23 07:30:40] [INFO ] Flow matrix only has 1212 transitions (discarded 20 similar events)
[2023-03-23 07:30:40] [INFO ] Invariant cache hit.
[2023-03-23 07:30:40] [INFO ] Implicit Places using invariants in 557 ms returned [63, 132, 163, 290, 338, 365, 368, 406, 518, 548]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 560 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 540/810 places, 1232/1492 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 531 transition count 1223
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 531 transition count 1223
Applied a total of 18 rules in 31 ms. Remains 531 /540 variables (removed 9) and now considering 1223/1232 (removed 9) transitions.
[2023-03-23 07:30:40] [INFO ] Flow matrix only has 1203 transitions (discarded 20 similar events)
// Phase 1: matrix 1203 rows 531 cols
[2023-03-23 07:30:40] [INFO ] Computed 46 place invariants in 23 ms
[2023-03-23 07:30:41] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-03-23 07:30:41] [INFO ] Flow matrix only has 1203 transitions (discarded 20 similar events)
[2023-03-23 07:30:41] [INFO ] Invariant cache hit.
[2023-03-23 07:30:41] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 07:30:54] [INFO ] Implicit Places using invariants and state equation in 13196 ms returned []
Implicit Place search using SMT with State Equation took 13764 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 531/810 places, 1223/1492 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15587 ms. Remains : 531/810 places, 1223/1492 transitions.
Stuttering acceptance computed with spot in 81 ms :[p1, p0]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s243 1) (LT s263 1)) (OR (LT s190 1) (LT s263 1)) (OR (LT s263 1) (LT s445 1)) (OR (LT s43 1) (LT s263 1)) (OR (LT s257 1) (LT s263 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4629 steps with 169 reset in 124 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-04 finished in 15830 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&&X(F(p0))) U X(G((X(p0)||p1))))))'
Support contains 81 out of 810 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 810/810 places, 1492/1492 transitions.
Applied a total of 0 rules in 15 ms. Remains 810 /810 variables (removed 0) and now considering 1492/1492 (removed 0) transitions.
[2023-03-23 07:30:54] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
// Phase 1: matrix 1472 rows 810 cols
[2023-03-23 07:30:54] [INFO ] Computed 56 place invariants in 26 ms
[2023-03-23 07:30:56] [INFO ] Dead Transitions using invariants and state equation in 2063 ms found 0 transitions.
[2023-03-23 07:30:56] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-23 07:30:56] [INFO ] Invariant cache hit.
[2023-03-23 07:30:57] [INFO ] Implicit Places using invariants in 838 ms returned [101, 199, 247, 441, 516, 557, 560, 614, 765, 807]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 841 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 800/810 places, 1492/1492 transitions.
Applied a total of 0 rules in 11 ms. Remains 800 /800 variables (removed 0) and now considering 1492/1492 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2934 ms. Remains : 800/810 places, 1492/1492 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-06 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: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}, { cond=(NOT p1), acceptance={0} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=(AND p0 p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(OR (GEQ s231 1) (GEQ s79 1) (GEQ s712 1) (GEQ s427 1) (GEQ s275 1) (GEQ s172 1) (GEQ s100 1) (GEQ s551 1) (GEQ s56 1) (GEQ s315 1)), p1:(OR (AND (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-06 finished in 3222 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((X(X((p0 U G(X(X((p1 U p2))))))) U X(p0))))'
Support contains 2 out of 810 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 810/810 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 800 transition count 1482
Applied a total of 20 rules in 24 ms. Remains 800 /810 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-23 07:30:57] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
// Phase 1: matrix 1462 rows 800 cols
[2023-03-23 07:30:57] [INFO ] Computed 56 place invariants in 24 ms
[2023-03-23 07:31:00] [INFO ] Dead Transitions using invariants and state equation in 2173 ms found 0 transitions.
[2023-03-23 07:31:00] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:31:00] [INFO ] Invariant cache hit.
[2023-03-23 07:31:01] [INFO ] Implicit Places using invariants in 899 ms returned [101, 199, 247, 438, 511, 551, 554, 607, 756, 797]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 901 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 790/810 places, 1482/1492 transitions.
Applied a total of 0 rules in 11 ms. Remains 790 /790 variables (removed 0) and now considering 1482/1482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3115 ms. Remains : 790/810 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s458 1) (GEQ s521 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][false, false]]
Stuttering criterion allowed to conclude after 4480 steps with 0 reset in 23 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-12 finished in 3243 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 G((p1&&(p2 U p3)))))))'
Support contains 8 out of 810 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 810/810 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 800 transition count 1482
Applied a total of 20 rules in 27 ms. Remains 800 /810 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-23 07:31:01] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:31:01] [INFO ] Invariant cache hit.
[2023-03-23 07:31:03] [INFO ] Dead Transitions using invariants and state equation in 2095 ms found 0 transitions.
[2023-03-23 07:31:03] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-23 07:31:03] [INFO ] Invariant cache hit.
[2023-03-23 07:31:04] [INFO ] Implicit Places using invariants in 839 ms returned [101, 199, 247, 438, 511, 551, 554, 607, 756, 797]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 841 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 790/810 places, 1482/1492 transitions.
Applied a total of 0 rules in 10 ms. Remains 790 /790 variables (removed 0) and now considering 1482/1482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2978 ms. Remains : 790/810 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), true, (NOT p3), (OR (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p1 p3 p0) (AND p1 p2 p0)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0))), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LT s520 1), p3:(AND (GEQ s442 1) (GEQ s613 1) (GEQ s767 1)), p0:(AND (GEQ s38 1) (GEQ s43 1)), p2:(AND (GEQ s260 1) (GEQ s676 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-13 finished in 3358 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(X(F((p0 U (p1||G(p0))))))))'
Found a Shortening insensitive property : PolyORBLF-PT-S02J06T10-LTLFireability-01
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 21 out of 810 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 810/810 places, 1492/1492 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 810 transition count 1452
Reduce places removed 40 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 50 rules applied. Total rules applied 90 place count 770 transition count 1442
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 100 place count 760 transition count 1442
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 100 place count 760 transition count 1332
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 320 place count 650 transition count 1332
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 480 place count 570 transition count 1252
Applied a total of 480 rules in 76 ms. Remains 570 /810 variables (removed 240) and now considering 1252/1492 (removed 240) transitions.
[2023-03-23 07:31:04] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
// Phase 1: matrix 1232 rows 570 cols
[2023-03-23 07:31:04] [INFO ] Computed 56 place invariants in 24 ms
[2023-03-23 07:31:06] [INFO ] Dead Transitions using invariants and state equation in 1206 ms found 0 transitions.
[2023-03-23 07:31:06] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
[2023-03-23 07:31:06] [INFO ] Invariant cache hit.
[2023-03-23 07:31:06] [INFO ] Implicit Places using invariants in 695 ms returned [65, 137, 169, 302, 354, 382, 385, 424, 537, 568]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 697 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 560/810 places, 1252/1492 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 551 transition count 1243
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 551 transition count 1243
Applied a total of 18 rules in 24 ms. Remains 551 /560 variables (removed 9) and now considering 1243/1252 (removed 9) transitions.
[2023-03-23 07:31:06] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
// Phase 1: matrix 1223 rows 551 cols
[2023-03-23 07:31:06] [INFO ] Computed 46 place invariants in 20 ms
[2023-03-23 07:31:07] [INFO ] Implicit Places using invariants in 660 ms returned []
[2023-03-23 07:31:07] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
[2023-03-23 07:31:07] [INFO ] Invariant cache hit.
[2023-03-23 07:31:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 07:31:16] [INFO ] Implicit Places using invariants and state equation in 8831 ms returned []
Implicit Place search using SMT with State Equation took 9494 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 551/810 places, 1243/1492 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 11497 ms. Remains : 551/810 places, 1243/1492 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (OR (GEQ s399 1) (GEQ s203 1) (GEQ s124 1) (GEQ s172 1) (GEQ s123 1) (GEQ s321 1) (GEQ s328 1) (GEQ s494 1) (GEQ s243 1) (GEQ s34 1))) (OR (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3796 reset in 778 ms.
Product exploration explored 100000 steps with 3814 reset in 774 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 07:31:18] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
[2023-03-23 07:31:18] [INFO ] Invariant cache hit.
[2023-03-23 07:31:18] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-23 07:31:18] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 24 ms returned sat
[2023-03-23 07:31:18] [INFO ] After 135ms 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) (NOT p0)), true, (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 284 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-23 07:31:19] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
[2023-03-23 07:31:19] [INFO ] Invariant cache hit.
[2023-03-23 07:31:19] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-23 07:31:19] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 105 ms returned sat
[2023-03-23 07:31:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:31:21] [INFO ] [Real]Absence check using state equation in 1782 ms returned sat
[2023-03-23 07:31:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:31:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-23 07:31:22] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 78 ms returned sat
[2023-03-23 07:31:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:31:25] [INFO ] [Nat]Absence check using state equation in 2948 ms returned sat
[2023-03-23 07:31:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 07:31:25] [INFO ] [Nat]Added 120 Read/Feed constraints in 409 ms returned sat
[2023-03-23 07:31:26] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 1 ms to minimize.
[2023-03-23 07:31:26] [INFO ] Deduced a trap composed of 46 places in 250 ms of which 0 ms to minimize.
[2023-03-23 07:31:26] [INFO ] Deduced a trap composed of 62 places in 245 ms of which 1 ms to minimize.
[2023-03-23 07:31:27] [INFO ] Deduced a trap composed of 46 places in 237 ms of which 1 ms to minimize.
[2023-03-23 07:31:27] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
[2023-03-23 07:31:27] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 1 ms to minimize.
[2023-03-23 07:31:27] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 0 ms to minimize.
[2023-03-23 07:31:27] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2023-03-23 07:31:28] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2023-03-23 07:31:28] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2192 ms
[2023-03-23 07:31:28] [INFO ] Computed and/alt/rep : 441/919/431 causal constraints (skipped 790 transitions) in 92 ms.
[2023-03-23 07:31:30] [INFO ] Added : 154 causal constraints over 31 iterations in 2421 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 21 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 1243/1243 transitions.
Applied a total of 0 rules in 8 ms. Remains 551 /551 variables (removed 0) and now considering 1243/1243 (removed 0) transitions.
[2023-03-23 07:31:30] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
[2023-03-23 07:31:30] [INFO ] Invariant cache hit.
[2023-03-23 07:31:31] [INFO ] Dead Transitions using invariants and state equation in 1104 ms found 0 transitions.
[2023-03-23 07:31:31] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
[2023-03-23 07:31:31] [INFO ] Invariant cache hit.
[2023-03-23 07:31:32] [INFO ] Implicit Places using invariants in 679 ms returned []
[2023-03-23 07:31:32] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
[2023-03-23 07:31:32] [INFO ] Invariant cache hit.
[2023-03-23 07:31:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 07:31:42] [INFO ] Implicit Places using invariants and state equation in 10523 ms returned []
Implicit Place search using SMT with State Equation took 11213 ms to find 0 implicit places.
[2023-03-23 07:31:42] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
[2023-03-23 07:31:42] [INFO ] Invariant cache hit.
[2023-03-23 07:31:44] [INFO ] Dead Transitions using invariants and state equation in 1159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13489 ms. Remains : 551/551 places, 1243/1243 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-23 07:31:44] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
[2023-03-23 07:31:44] [INFO ] Invariant cache hit.
[2023-03-23 07:31:45] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-23 07:31:45] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 106 ms returned sat
[2023-03-23 07:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:31:47] [INFO ] [Real]Absence check using state equation in 1858 ms returned sat
[2023-03-23 07:31:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:31:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-23 07:31:48] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 77 ms returned sat
[2023-03-23 07:31:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:31:51] [INFO ] [Nat]Absence check using state equation in 2963 ms returned sat
[2023-03-23 07:31:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 07:31:51] [INFO ] [Nat]Added 120 Read/Feed constraints in 410 ms returned sat
[2023-03-23 07:31:52] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 0 ms to minimize.
[2023-03-23 07:31:52] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 1 ms to minimize.
[2023-03-23 07:31:52] [INFO ] Deduced a trap composed of 62 places in 230 ms of which 1 ms to minimize.
[2023-03-23 07:31:53] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 1 ms to minimize.
[2023-03-23 07:31:53] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 0 ms to minimize.
[2023-03-23 07:31:53] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2023-03-23 07:31:53] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2023-03-23 07:31:53] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2023-03-23 07:31:53] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 0 ms to minimize.
[2023-03-23 07:31:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2143 ms
[2023-03-23 07:31:54] [INFO ] Computed and/alt/rep : 441/919/431 causal constraints (skipped 790 transitions) in 87 ms.
[2023-03-23 07:31:56] [INFO ] Added : 154 causal constraints over 31 iterations in 2368 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3802 reset in 602 ms.
Product exploration explored 100000 steps with 3815 reset in 611 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 21 out of 551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 1243/1243 transitions.
Applied a total of 0 rules in 33 ms. Remains 551 /551 variables (removed 0) and now considering 1243/1243 (removed 0) transitions.
[2023-03-23 07:31:57] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
[2023-03-23 07:31:58] [INFO ] Invariant cache hit.
[2023-03-23 07:31:59] [INFO ] Dead Transitions using invariants and state equation in 1130 ms found 0 transitions.
[2023-03-23 07:31:59] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-23 07:31:59] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
[2023-03-23 07:31:59] [INFO ] Invariant cache hit.
[2023-03-23 07:32:00] [INFO ] Dead Transitions using invariants and state equation in 1144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2383 ms. Remains : 551/551 places, 1243/1243 transitions.
Support contains 21 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 1243/1243 transitions.
Applied a total of 0 rules in 6 ms. Remains 551 /551 variables (removed 0) and now considering 1243/1243 (removed 0) transitions.
[2023-03-23 07:32:00] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
[2023-03-23 07:32:00] [INFO ] Invariant cache hit.
[2023-03-23 07:32:01] [INFO ] Dead Transitions using invariants and state equation in 1121 ms found 0 transitions.
[2023-03-23 07:32:01] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
[2023-03-23 07:32:01] [INFO ] Invariant cache hit.
[2023-03-23 07:32:02] [INFO ] Implicit Places using invariants in 670 ms returned []
[2023-03-23 07:32:02] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
[2023-03-23 07:32:02] [INFO ] Invariant cache hit.
[2023-03-23 07:32:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 07:32:12] [INFO ] Implicit Places using invariants and state equation in 10330 ms returned []
Implicit Place search using SMT with State Equation took 11001 ms to find 0 implicit places.
[2023-03-23 07:32:12] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
[2023-03-23 07:32:12] [INFO ] Invariant cache hit.
[2023-03-23 07:32:13] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13280 ms. Remains : 551/551 places, 1243/1243 transitions.
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-01 finished in 69228 ms.
[2023-03-23 07:32:13] [INFO ] Flatten gal took : 69 ms
[2023-03-23 07:32:13] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-23 07:32:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 810 places, 1492 transitions and 6370 arcs took 11 ms.
Total runtime 228671 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1325/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-LTLFireability-01
BK_STOP 1679556735388
--------------------
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
mcc2023
ltl formula name PolyORBLF-PT-S02J06T10-LTLFireability-01
ltl formula formula --ltl=/tmp/1325/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 810 places, 1492 transitions and 6370 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.080 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1325/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1325/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1325/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1325/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
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="PolyORBLF-PT-S02J06T10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S02J06T10, 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 r297-tall-167873950600532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T10.tgz
mv PolyORBLF-PT-S02J06T10 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 '
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 ;