fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r521-tall-167987246100028
Last Updated
May 14, 2023

About the Execution of LTSMin+red for Anderson-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
691.008 70782.00 136608.00 946.00 FTFFT??FFFTTF?FF 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.r521-tall-167987246100028.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 Anderson-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246100028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 924K
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 461K Mar 31 16:48 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 Anderson-PT-07-LTLFireability-00
FORMULA_NAME Anderson-PT-07-LTLFireability-01
FORMULA_NAME Anderson-PT-07-LTLFireability-02
FORMULA_NAME Anderson-PT-07-LTLFireability-03
FORMULA_NAME Anderson-PT-07-LTLFireability-04
FORMULA_NAME Anderson-PT-07-LTLFireability-05
FORMULA_NAME Anderson-PT-07-LTLFireability-06
FORMULA_NAME Anderson-PT-07-LTLFireability-07
FORMULA_NAME Anderson-PT-07-LTLFireability-08
FORMULA_NAME Anderson-PT-07-LTLFireability-09
FORMULA_NAME Anderson-PT-07-LTLFireability-10
FORMULA_NAME Anderson-PT-07-LTLFireability-11
FORMULA_NAME Anderson-PT-07-LTLFireability-12
FORMULA_NAME Anderson-PT-07-LTLFireability-13
FORMULA_NAME Anderson-PT-07-LTLFireability-14
FORMULA_NAME Anderson-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680856980445

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=Anderson-PT-07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 08:43:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 08:43:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 08:43:06] [INFO ] Load time of PNML (sax parser for PT used): 272 ms
[2023-04-07 08:43:06] [INFO ] Transformed 309 places.
[2023-04-07 08:43:06] [INFO ] Transformed 917 transitions.
[2023-04-07 08:43:06] [INFO ] Found NUPN structural information;
[2023-04-07 08:43:06] [INFO ] Parsed PT model containing 309 places and 917 transitions and 3500 arcs in 682 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Anderson-PT-07-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 917/917 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 236 transition count 472
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 236 transition count 472
Applied a total of 146 rules in 170 ms. Remains 236 /309 variables (removed 73) and now considering 472/917 (removed 445) transitions.
// Phase 1: matrix 472 rows 236 cols
[2023-04-07 08:43:06] [INFO ] Computed 17 invariants in 34 ms
[2023-04-07 08:43:07] [INFO ] Implicit Places using invariants in 1135 ms returned []
[2023-04-07 08:43:07] [INFO ] Invariant cache hit.
[2023-04-07 08:43:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:43:10] [INFO ] Implicit Places using invariants and state equation in 2344 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3558 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/309 places, 472/917 transitions.
Applied a total of 0 rules in 31 ms. Remains 235 /235 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3783 ms. Remains : 235/309 places, 472/917 transitions.
Support contains 28 out of 235 places after structural reductions.
[2023-04-07 08:43:11] [INFO ] Flatten gal took : 95 ms
[2023-04-07 08:43:11] [INFO ] Flatten gal took : 42 ms
[2023-04-07 08:43:11] [INFO ] Input system was already deterministic with 472 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 17) seen :9
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 472 rows 235 cols
[2023-04-07 08:43:12] [INFO ] Computed 16 invariants in 21 ms
[2023-04-07 08:43:12] [INFO ] [Real]Absence check using 9 positive place invariants in 44 ms returned sat
[2023-04-07 08:43:12] [INFO ] [Real]Absence check using 9 positive and 7 generalized place invariants in 13 ms returned sat
[2023-04-07 08:43:12] [INFO ] After 605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 08:43:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 60 ms returned sat
[2023-04-07 08:43:13] [INFO ] [Nat]Absence check using 9 positive and 7 generalized place invariants in 12 ms returned sat
[2023-04-07 08:43:13] [INFO ] After 614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 08:43:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:43:13] [INFO ] After 123ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 08:43:13] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-04-07 08:43:13] [INFO ] After 1128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 472/472 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 235 transition count 424
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 187 transition count 424
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 96 place count 187 transition count 382
Deduced a syphon composed of 42 places in 6 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 180 place count 145 transition count 382
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 190 place count 135 transition count 252
Iterating global reduction 2 with 10 rules applied. Total rules applied 200 place count 135 transition count 252
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 135 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 134 transition count 251
Applied a total of 202 rules in 156 ms. Remains 134 /235 variables (removed 101) and now considering 251/472 (removed 221) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 134/235 places, 251/472 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 55428 steps, run visited all 1 properties in 432 ms. (steps per millisecond=128 )
Probabilistic random walk after 55428 steps, saw 35587 distinct states, run finished after 432 ms. (steps per millisecond=128 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 472/472 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 226 transition count 355
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 226 transition count 355
Applied a total of 18 rules in 29 ms. Remains 226 /235 variables (removed 9) and now considering 355/472 (removed 117) transitions.
// Phase 1: matrix 355 rows 226 cols
[2023-04-07 08:43:15] [INFO ] Computed 16 invariants in 4 ms
[2023-04-07 08:43:19] [INFO ] Implicit Places using invariants in 4676 ms returned []
[2023-04-07 08:43:19] [INFO ] Invariant cache hit.
[2023-04-07 08:43:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:43:20] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 5820 ms to find 0 implicit places.
[2023-04-07 08:43:20] [INFO ] Invariant cache hit.
[2023-04-07 08:43:21] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/235 places, 355/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6343 ms. Remains : 226/235 places, 355/472 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 661 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s13 0) (EQ s21 0)), p1:(AND (EQ s18 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 155 steps with 0 reset in 15 ms.
FORMULA Anderson-PT-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-07-LTLFireability-00 finished in 7246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 472/472 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 235 transition count 437
Reduce places removed 35 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 42 rules applied. Total rules applied 77 place count 200 transition count 430
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 84 place count 193 transition count 430
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 84 place count 193 transition count 388
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 168 place count 151 transition count 388
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 179 place count 140 transition count 245
Iterating global reduction 3 with 11 rules applied. Total rules applied 190 place count 140 transition count 245
Applied a total of 190 rules in 82 ms. Remains 140 /235 variables (removed 95) and now considering 245/472 (removed 227) transitions.
// Phase 1: matrix 245 rows 140 cols
[2023-04-07 08:43:22] [INFO ] Computed 16 invariants in 3 ms
[2023-04-07 08:43:22] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-04-07 08:43:22] [INFO ] Invariant cache hit.
[2023-04-07 08:43:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:43:22] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2023-04-07 08:43:22] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-07 08:43:23] [INFO ] Invariant cache hit.
[2023-04-07 08:43:23] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/235 places, 245/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 941 ms. Remains : 140/235 places, 245/472 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s85 0)), p1:(AND (EQ s14 1) (EQ s34 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 409 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 1 ms.
FORMULA Anderson-PT-07-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-02 finished in 1452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(G((G((X(p1)||p2))&&p0)))) U p2)))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 472/472 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 225 transition count 342
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 225 transition count 342
Applied a total of 20 rules in 5 ms. Remains 225 /235 variables (removed 10) and now considering 342/472 (removed 130) transitions.
// Phase 1: matrix 342 rows 225 cols
[2023-04-07 08:43:23] [INFO ] Computed 16 invariants in 3 ms
[2023-04-07 08:43:23] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-04-07 08:43:23] [INFO ] Invariant cache hit.
[2023-04-07 08:43:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:43:24] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
[2023-04-07 08:43:24] [INFO ] Invariant cache hit.
[2023-04-07 08:43:25] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/235 places, 342/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1618 ms. Remains : 225/235 places, 342/472 transitions.
Stuttering acceptance computed with spot in 467 ms :[(NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Anderson-PT-07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 4}, { cond=(AND p2 p0), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s10 1) (EQ s21 1)), p0:(AND (EQ s19 1) (EQ s56 1)), p1:(AND (EQ s19 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-07-LTLFireability-03 finished in 2122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 472/472 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 226 transition count 355
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 226 transition count 355
Applied a total of 18 rules in 4 ms. Remains 226 /235 variables (removed 9) and now considering 355/472 (removed 117) transitions.
// Phase 1: matrix 355 rows 226 cols
[2023-04-07 08:43:25] [INFO ] Computed 16 invariants in 2 ms
[2023-04-07 08:43:26] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-04-07 08:43:26] [INFO ] Invariant cache hit.
[2023-04-07 08:43:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:43:27] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
[2023-04-07 08:43:27] [INFO ] Invariant cache hit.
[2023-04-07 08:43:27] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/235 places, 355/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1899 ms. Remains : 226/235 places, 355/472 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (OR (NEQ s8 1) (NEQ s28 1)) (OR (NEQ s14 1) (NEQ s26 1))), p0:(OR (EQ s5 0) (EQ s115 0))], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 608 ms.
Product exploration explored 100000 steps with 50000 reset in 492 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 p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 67 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-07-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-07-LTLFireability-04 finished in 3318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 472/472 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 235 transition count 425
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 188 transition count 425
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 94 place count 188 transition count 383
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 178 place count 146 transition count 383
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 187 place count 137 transition count 266
Iterating global reduction 2 with 9 rules applied. Total rules applied 196 place count 137 transition count 266
Applied a total of 196 rules in 33 ms. Remains 137 /235 variables (removed 98) and now considering 266/472 (removed 206) transitions.
// Phase 1: matrix 266 rows 137 cols
[2023-04-07 08:43:29] [INFO ] Computed 16 invariants in 2 ms
[2023-04-07 08:43:29] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-04-07 08:43:29] [INFO ] Invariant cache hit.
[2023-04-07 08:43:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:43:29] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2023-04-07 08:43:29] [INFO ] Redundant transitions in 13 ms returned []
[2023-04-07 08:43:29] [INFO ] Invariant cache hit.
[2023-04-07 08:43:30] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/235 places, 266/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1093 ms. Remains : 137/235 places, 266/472 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s14 0) (EQ s24 0)), p1:(OR (EQ s8 0) (EQ s29 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 28 reset in 190 ms.
Product exploration explored 100000 steps with 137 reset in 289 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Finished Best-First random walk after 71 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 342 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 266/266 transitions.
Applied a total of 0 rules in 7 ms. Remains 137 /137 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2023-04-07 08:43:32] [INFO ] Invariant cache hit.
[2023-04-07 08:43:34] [INFO ] Implicit Places using invariants in 1896 ms returned []
[2023-04-07 08:43:34] [INFO ] Invariant cache hit.
[2023-04-07 08:43:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:43:34] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 2406 ms to find 0 implicit places.
[2023-04-07 08:43:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 08:43:34] [INFO ] Invariant cache hit.
[2023-04-07 08:43:35] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2839 ms. Remains : 137/137 places, 266/266 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 313 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Finished Best-First random walk after 986 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=986 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 309 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 143 reset in 198 ms.
Product exploration explored 100000 steps with 94 reset in 226 ms.
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 266/266 transitions.
Applied a total of 0 rules in 23 ms. Remains 137 /137 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2023-04-07 08:43:37] [INFO ] Invariant cache hit.
[2023-04-07 08:43:37] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-04-07 08:43:37] [INFO ] Invariant cache hit.
[2023-04-07 08:43:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:43:37] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2023-04-07 08:43:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 08:43:37] [INFO ] Invariant cache hit.
[2023-04-07 08:43:38] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1141 ms. Remains : 137/137 places, 266/266 transitions.
Treatment of property Anderson-PT-07-LTLFireability-05 finished in 9470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 472/472 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 235 transition count 424
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 187 transition count 424
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 96 place count 187 transition count 382
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 180 place count 145 transition count 382
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 190 place count 135 transition count 252
Iterating global reduction 2 with 10 rules applied. Total rules applied 200 place count 135 transition count 252
Applied a total of 200 rules in 22 ms. Remains 135 /235 variables (removed 100) and now considering 252/472 (removed 220) transitions.
// Phase 1: matrix 252 rows 135 cols
[2023-04-07 08:43:38] [INFO ] Computed 16 invariants in 2 ms
[2023-04-07 08:43:42] [INFO ] Implicit Places using invariants in 3789 ms returned []
[2023-04-07 08:43:42] [INFO ] Invariant cache hit.
[2023-04-07 08:43:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:43:42] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 4369 ms to find 0 implicit places.
[2023-04-07 08:43:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 08:43:42] [INFO ] Invariant cache hit.
[2023-04-07 08:43:43] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/235 places, 252/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4887 ms. Remains : 135/235 places, 252/472 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s22 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12 reset in 130 ms.
Product exploration explored 100000 steps with 19 reset in 129 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2165 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=541 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 10 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2023-04-07 08:43:44] [INFO ] Invariant cache hit.
[2023-04-07 08:43:44] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-04-07 08:43:44] [INFO ] Invariant cache hit.
[2023-04-07 08:43:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:43:45] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2023-04-07 08:43:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 08:43:45] [INFO ] Invariant cache hit.
[2023-04-07 08:43:45] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1064 ms. Remains : 135/135 places, 252/252 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Finished Best-First random walk after 1190 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=595 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 288 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15 reset in 101 ms.
Product exploration explored 100000 steps with 14 reset in 205 ms.
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 13 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2023-04-07 08:43:47] [INFO ] Invariant cache hit.
[2023-04-07 08:43:47] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-04-07 08:43:47] [INFO ] Invariant cache hit.
[2023-04-07 08:43:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:43:48] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2023-04-07 08:43:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 08:43:48] [INFO ] Invariant cache hit.
[2023-04-07 08:43:48] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1009 ms. Remains : 135/135 places, 252/252 transitions.
Treatment of property Anderson-PT-07-LTLFireability-06 finished in 9847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 472/472 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 235 transition count 437
Reduce places removed 35 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 42 rules applied. Total rules applied 77 place count 200 transition count 430
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 84 place count 193 transition count 430
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 84 place count 193 transition count 389
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 166 place count 152 transition count 389
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 176 place count 142 transition count 259
Iterating global reduction 3 with 10 rules applied. Total rules applied 186 place count 142 transition count 259
Applied a total of 186 rules in 55 ms. Remains 142 /235 variables (removed 93) and now considering 259/472 (removed 213) transitions.
// Phase 1: matrix 259 rows 142 cols
[2023-04-07 08:43:48] [INFO ] Computed 16 invariants in 1 ms
[2023-04-07 08:43:48] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-04-07 08:43:48] [INFO ] Invariant cache hit.
[2023-04-07 08:43:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:43:50] [INFO ] Implicit Places using invariants and state equation in 1614 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
[2023-04-07 08:43:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 08:43:50] [INFO ] Invariant cache hit.
[2023-04-07 08:43:50] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/235 places, 259/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2218 ms. Remains : 142/235 places, 259/472 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s79 1) (EQ s7 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 151 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 0 ms.
FORMULA Anderson-PT-07-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-08 finished in 2447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 472/472 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 225 transition count 342
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 225 transition count 342
Applied a total of 20 rules in 6 ms. Remains 225 /235 variables (removed 10) and now considering 342/472 (removed 130) transitions.
// Phase 1: matrix 342 rows 225 cols
[2023-04-07 08:43:50] [INFO ] Computed 16 invariants in 7 ms
[2023-04-07 08:43:51] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-04-07 08:43:51] [INFO ] Invariant cache hit.
[2023-04-07 08:43:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:43:55] [INFO ] Implicit Places using invariants and state equation in 4295 ms returned []
Implicit Place search using SMT with State Equation took 4555 ms to find 0 implicit places.
[2023-04-07 08:43:55] [INFO ] Invariant cache hit.
[2023-04-07 08:43:55] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/235 places, 342/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4923 ms. Remains : 225/235 places, 342/472 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s82 1)), p1:(AND (EQ s13 1) (EQ s23 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]]
Product exploration explored 100000 steps with 65 reset in 130 ms.
Stack based approach found an accepted trace after 81 steps with 1 reset with depth 49 and stack size 49 in 0 ms.
FORMULA Anderson-PT-07-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-09 finished in 5261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 472/472 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 235 transition count 424
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 187 transition count 424
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 96 place count 187 transition count 382
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 180 place count 145 transition count 382
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 190 place count 135 transition count 252
Iterating global reduction 2 with 10 rules applied. Total rules applied 200 place count 135 transition count 252
Applied a total of 200 rules in 30 ms. Remains 135 /235 variables (removed 100) and now considering 252/472 (removed 220) transitions.
// Phase 1: matrix 252 rows 135 cols
[2023-04-07 08:43:56] [INFO ] Computed 16 invariants in 1 ms
[2023-04-07 08:43:57] [INFO ] Implicit Places using invariants in 1236 ms returned []
[2023-04-07 08:43:57] [INFO ] Invariant cache hit.
[2023-04-07 08:43:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:43:57] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 1703 ms to find 0 implicit places.
[2023-04-07 08:43:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 08:43:57] [INFO ] Invariant cache hit.
[2023-04-07 08:43:58] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/235 places, 252/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1984 ms. Remains : 135/235 places, 252/472 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s23 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 153 ms.
Product exploration explored 100000 steps with 0 reset in 192 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 231 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 18486 steps, run visited all 1 properties in 96 ms. (steps per millisecond=192 )
Probabilistic random walk after 18486 steps, saw 12512 distinct states, run finished after 110 ms. (steps per millisecond=168 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 353 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 16 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2023-04-07 08:43:59] [INFO ] Invariant cache hit.
[2023-04-07 08:44:00] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-04-07 08:44:00] [INFO ] Invariant cache hit.
[2023-04-07 08:44:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:44:00] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
[2023-04-07 08:44:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 08:44:00] [INFO ] Invariant cache hit.
[2023-04-07 08:44:00] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1111 ms. Remains : 135/135 places, 252/252 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 366 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 18486 steps, run visited all 1 properties in 55 ms. (steps per millisecond=336 )
Probabilistic random walk after 18486 steps, saw 12512 distinct states, run finished after 69 ms. (steps per millisecond=267 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 114 ms.
Product exploration explored 100000 steps with 0 reset in 172 ms.
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 21 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2023-04-07 08:44:02] [INFO ] Invariant cache hit.
[2023-04-07 08:44:02] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-04-07 08:44:02] [INFO ] Invariant cache hit.
[2023-04-07 08:44:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:44:03] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2023-04-07 08:44:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 08:44:03] [INFO ] Invariant cache hit.
[2023-04-07 08:44:06] [INFO ] Dead Transitions using invariants and state equation in 3315 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4001 ms. Remains : 135/135 places, 252/252 transitions.
Treatment of property Anderson-PT-07-LTLFireability-13 finished in 10443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 472/472 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 235 transition count 424
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 187 transition count 424
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 96 place count 187 transition count 382
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 180 place count 145 transition count 382
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 190 place count 135 transition count 252
Iterating global reduction 2 with 10 rules applied. Total rules applied 200 place count 135 transition count 252
Applied a total of 200 rules in 19 ms. Remains 135 /235 variables (removed 100) and now considering 252/472 (removed 220) transitions.
// Phase 1: matrix 252 rows 135 cols
[2023-04-07 08:44:06] [INFO ] Computed 16 invariants in 1 ms
[2023-04-07 08:44:06] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-04-07 08:44:06] [INFO ] Invariant cache hit.
[2023-04-07 08:44:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 08:44:07] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2023-04-07 08:44:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 08:44:07] [INFO ] Invariant cache hit.
[2023-04-07 08:44:07] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/235 places, 252/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1014 ms. Remains : 135/235 places, 252/472 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 135 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 1 ms.
FORMULA Anderson-PT-07-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-14 finished in 1236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-04-07 08:44:08] [INFO ] Flatten gal took : 79 ms
[2023-04-07 08:44:08] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 08:44:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 235 places, 472 transitions and 1706 arcs took 11 ms.
Total runtime 62984 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1128/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1128/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1128/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Anderson-PT-07-LTLFireability-05
Could not compute solution for formula : Anderson-PT-07-LTLFireability-06
Could not compute solution for formula : Anderson-PT-07-LTLFireability-13

BK_STOP 1680857051227

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Anderson-PT-07-LTLFireability-05
ltl formula formula --ltl=/tmp/1128/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 235 places, 472 transitions and 1706 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1128/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1128/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1128/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1128/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name Anderson-PT-07-LTLFireability-06
ltl formula formula --ltl=/tmp/1128/ltl_1_
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
pnml2lts-mc( 0/ 4): Petri net has 235 places, 472 transitions and 1706 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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( 3/ 4): LTL layer: formula: /tmp/1128/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1128/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1128/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1128/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name Anderson-PT-07-LTLFireability-13
ltl formula formula --ltl=/tmp/1128/ltl_2_
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
pnml2lts-mc( 0/ 4): Petri net has 235 places, 472 transitions and 1706 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.350 real 0.000 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1128/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1128/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1128/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1128/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="Anderson-PT-07"
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 Anderson-PT-07, 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 r521-tall-167987246100028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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