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-167987246100036.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-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246100036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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 17K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:19 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 667K 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-08-LTLFireability-00
FORMULA_NAME Anderson-PT-08-LTLFireability-01
FORMULA_NAME Anderson-PT-08-LTLFireability-02
FORMULA_NAME Anderson-PT-08-LTLFireability-03
FORMULA_NAME Anderson-PT-08-LTLFireability-04
FORMULA_NAME Anderson-PT-08-LTLFireability-05
FORMULA_NAME Anderson-PT-08-LTLFireability-06
FORMULA_NAME Anderson-PT-08-LTLFireability-07
FORMULA_NAME Anderson-PT-08-LTLFireability-08
FORMULA_NAME Anderson-PT-08-LTLFireability-09
FORMULA_NAME Anderson-PT-08-LTLFireability-10
FORMULA_NAME Anderson-PT-08-LTLFireability-11
FORMULA_NAME Anderson-PT-08-LTLFireability-12
FORMULA_NAME Anderson-PT-08-LTLFireability-13
FORMULA_NAME Anderson-PT-08-LTLFireability-14
FORMULA_NAME Anderson-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680860382790

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-08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 09:39:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 09:39:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 09:39:45] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2023-04-07 09:39:45] [INFO ] Transformed 401 places.
[2023-04-07 09:39:45] [INFO ] Transformed 1328 transitions.
[2023-04-07 09:39:45] [INFO ] Found NUPN structural information;
[2023-04-07 09:39:45] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 391 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 321 transition count 828
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 321 transition count 828
Applied a total of 160 rules in 78 ms. Remains 321 /401 variables (removed 80) and now considering 828/1328 (removed 500) transitions.
// Phase 1: matrix 828 rows 321 cols
[2023-04-07 09:39:46] [INFO ] Computed 19 invariants in 73 ms
[2023-04-07 09:39:46] [INFO ] Implicit Places using invariants in 711 ms returned []
[2023-04-07 09:39:46] [INFO ] Invariant cache hit.
[2023-04-07 09:39:47] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:47] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1969 ms to find 0 implicit places.
[2023-04-07 09:39:47] [INFO ] Invariant cache hit.
[2023-04-07 09:39:48] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 321/401 places, 828/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2662 ms. Remains : 321/401 places, 828/1328 transitions.
Support contains 55 out of 321 places after structural reductions.
[2023-04-07 09:39:48] [INFO ] Flatten gal took : 208 ms
[2023-04-07 09:39:48] [INFO ] Flatten gal took : 99 ms
[2023-04-07 09:39:49] [INFO ] Input system was already deterministic with 828 transitions.
Support contains 53 out of 321 places (down from 55) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 37) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 11) seen :1
Running SMT prover for 10 properties.
[2023-04-07 09:39:49] [INFO ] Invariant cache hit.
[2023-04-07 09:39:50] [INFO ] [Real]Absence check using 9 positive place invariants in 50 ms returned sat
[2023-04-07 09:39:50] [INFO ] [Real]Absence check using 9 positive and 10 generalized place invariants in 22 ms returned sat
[2023-04-07 09:39:50] [INFO ] After 815ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-04-07 09:39:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 52 ms returned sat
[2023-04-07 09:39:51] [INFO ] [Nat]Absence check using 9 positive and 10 generalized place invariants in 47 ms returned sat
[2023-04-07 09:39:51] [INFO ] After 775ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-04-07 09:39:51] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:52] [INFO ] After 622ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :1 sat :9
[2023-04-07 09:39:53] [INFO ] After 1356ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 549 ms.
[2023-04-07 09:39:53] [INFO ] After 3042ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 1 properties in 31 ms.
Support contains 12 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 828/828 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 0 place count 321 transition count 773
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 110 place count 266 transition count 773
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 135 place count 241 transition count 468
Iterating global reduction 0 with 25 rules applied. Total rules applied 160 place count 241 transition count 468
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 162 place count 240 transition count 467
Applied a total of 162 rules in 52 ms. Remains 240 /321 variables (removed 81) and now considering 467/828 (removed 361) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 240/321 places, 467/828 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 467 rows 240 cols
[2023-04-07 09:39:54] [INFO ] Computed 19 invariants in 7 ms
[2023-04-07 09:39:54] [INFO ] [Real]Absence check using 8 positive place invariants in 57 ms returned sat
[2023-04-07 09:39:54] [INFO ] [Real]Absence check using 8 positive and 11 generalized place invariants in 36 ms returned sat
[2023-04-07 09:39:54] [INFO ] After 340ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-04-07 09:39:54] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:54] [INFO ] After 66ms SMT Verify possible using 56 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 09:39:54] [INFO ] After 760ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 09:39:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-04-07 09:39:55] [INFO ] [Nat]Absence check using 8 positive and 11 generalized place invariants in 13 ms returned sat
[2023-04-07 09:39:55] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 09:39:55] [INFO ] After 72ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 09:39:55] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-04-07 09:39:55] [INFO ] After 541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 467/467 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 236 transition count 407
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 236 transition count 407
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 235 transition count 406
Applied a total of 10 rules in 60 ms. Remains 235 /240 variables (removed 5) and now considering 406/467 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 235/240 places, 406/467 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Finished probabilistic random walk after 113907 steps, run visited all 2 properties in 660 ms. (steps per millisecond=172 )
Probabilistic random walk after 113907 steps, saw 80421 distinct states, run finished after 660 ms. (steps per millisecond=172 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Anderson-PT-08-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
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' '!(F((G((F(p1)&&p0))||G(p1))))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 321 transition count 772
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 265 transition count 772
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 142 place count 235 transition count 406
Iterating global reduction 0 with 30 rules applied. Total rules applied 172 place count 235 transition count 406
Applied a total of 172 rules in 31 ms. Remains 235 /321 variables (removed 86) and now considering 406/828 (removed 422) transitions.
// Phase 1: matrix 406 rows 235 cols
[2023-04-07 09:39:56] [INFO ] Computed 19 invariants in 4 ms
[2023-04-07 09:39:57] [INFO ] Implicit Places using invariants in 325 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 343 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/321 places, 406/828 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 234 transition count 344
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 172 transition count 344
Applied a total of 124 rules in 17 ms. Remains 172 /234 variables (removed 62) and now considering 344/406 (removed 62) transitions.
// Phase 1: matrix 344 rows 172 cols
[2023-04-07 09:39:57] [INFO ] Computed 18 invariants in 5 ms
[2023-04-07 09:39:57] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-04-07 09:39:57] [INFO ] Invariant cache hit.
[2023-04-07 09:39:57] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:57] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 172/321 places, 344/828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1201 ms. Remains : 172/321 places, 344/828 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 225 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-00 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}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s20 1) (EQ s24 1)), p1:(OR (EQ s17 0) (EQ s28 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 325 ms.
Stack based approach found an accepted trace after 23386 steps with 0 reset with depth 23387 and stack size 17581 in 55 ms.
FORMULA Anderson-PT-08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-00 finished in 1900 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((p0 U p1))))'
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 290 transition count 433
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 290 transition count 433
Applied a total of 62 rules in 11 ms. Remains 290 /321 variables (removed 31) and now considering 433/828 (removed 395) transitions.
// Phase 1: matrix 433 rows 290 cols
[2023-04-07 09:39:58] [INFO ] Computed 19 invariants in 6 ms
[2023-04-07 09:39:59] [INFO ] Implicit Places using invariants in 608 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 620 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 289/321 places, 433/828 transitions.
Applied a total of 0 rules in 3 ms. Remains 289 /289 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 636 ms. Remains : 289/321 places, 433/828 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s44 1), p0:(AND (EQ s0 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Anderson-PT-08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-01 finished in 888 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(p0))))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 321 transition count 772
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 265 transition count 772
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 143 place count 234 transition count 391
Iterating global reduction 0 with 31 rules applied. Total rules applied 174 place count 234 transition count 391
Applied a total of 174 rules in 22 ms. Remains 234 /321 variables (removed 87) and now considering 391/828 (removed 437) transitions.
// Phase 1: matrix 391 rows 234 cols
[2023-04-07 09:39:59] [INFO ] Computed 19 invariants in 4 ms
[2023-04-07 09:39:59] [INFO ] Implicit Places using invariants in 397 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 402 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 233/321 places, 391/828 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 233 transition count 328
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 170 transition count 328
Applied a total of 126 rules in 29 ms. Remains 170 /233 variables (removed 63) and now considering 328/391 (removed 63) transitions.
// Phase 1: matrix 328 rows 170 cols
[2023-04-07 09:39:59] [INFO ] Computed 18 invariants in 2 ms
[2023-04-07 09:40:00] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-04-07 09:40:00] [INFO ] Invariant cache hit.
[2023-04-07 09:40:00] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:40:00] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 170/321 places, 328/828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1152 ms. Remains : 170/321 places, 328/828 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s17 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 27 reset in 211 ms.
Stack based approach found an accepted trace after 129 steps with 0 reset with depth 130 and stack size 130 in 1 ms.
FORMULA Anderson-PT-08-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-02 finished in 1440 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&&G((p1||X(G(p2)))))))'
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 292 transition count 477
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 292 transition count 477
Applied a total of 58 rules in 7 ms. Remains 292 /321 variables (removed 29) and now considering 477/828 (removed 351) transitions.
// Phase 1: matrix 477 rows 292 cols
[2023-04-07 09:40:00] [INFO ] Computed 19 invariants in 3 ms
[2023-04-07 09:40:01] [INFO ] Implicit Places using invariants in 431 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 440 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/321 places, 477/828 transitions.
Applied a total of 0 rules in 4 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 451 ms. Remains : 291/321 places, 477/828 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 1}, { cond=true, acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(NOT p2), acceptance={1} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s26 0) (AND (EQ s8 1) (EQ s25 1))), p1:(AND (EQ s22 1) (EQ s31 1)), p2:(OR (EQ s16 0) (EQ s26 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Stack based approach found an accepted trace after 1342 steps with 0 reset with depth 1343 and stack size 819 in 3 ms.
FORMULA Anderson-PT-08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-03 finished in 921 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(X(p1))||G(p2))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 291 transition count 448
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 291 transition count 448
Applied a total of 60 rules in 10 ms. Remains 291 /321 variables (removed 30) and now considering 448/828 (removed 380) transitions.
// Phase 1: matrix 448 rows 291 cols
[2023-04-07 09:40:01] [INFO ] Computed 19 invariants in 4 ms
[2023-04-07 09:40:02] [INFO ] Implicit Places using invariants in 324 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 340 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 290/321 places, 448/828 transitions.
Applied a total of 0 rules in 3 ms. Remains 290 /290 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 354 ms. Remains : 290/321 places, 448/828 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s17 0) (EQ s26 0)), p2:(OR (NEQ s2 1) (NEQ s111 1)), p1:(EQ s49 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, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2079 steps with 0 reset in 3 ms.
FORMULA Anderson-PT-08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-04 finished in 635 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(p0)))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 290 transition count 447
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 290 transition count 447
Applied a total of 62 rules in 7 ms. Remains 290 /321 variables (removed 31) and now considering 447/828 (removed 381) transitions.
// Phase 1: matrix 447 rows 290 cols
[2023-04-07 09:40:02] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 09:40:02] [INFO ] Implicit Places using invariants in 228 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 238 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 289/321 places, 447/828 transitions.
Applied a total of 0 rules in 3 ms. Remains 289 /289 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 249 ms. Remains : 289/321 places, 447/828 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s14 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-05 finished in 339 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(F((!p0 U (G(!p0)||(!p0&&G(!p1)&&X(F(!p2))))))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 292 transition count 477
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 292 transition count 477
Applied a total of 58 rules in 7 ms. Remains 292 /321 variables (removed 29) and now considering 477/828 (removed 351) transitions.
// Phase 1: matrix 477 rows 292 cols
[2023-04-07 09:40:02] [INFO ] Computed 19 invariants in 4 ms
[2023-04-07 09:40:03] [INFO ] Implicit Places using invariants in 207 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 217 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/321 places, 477/828 transitions.
Applied a total of 0 rules in 3 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 227 ms. Remains : 291/321 places, 477/828 transitions.
Stuttering acceptance computed with spot in 204 ms :[p0, p0, (AND p0 p1), (AND p0 p2)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s13 1) (EQ s28 1)), p0:(AND (EQ s12 1) (EQ s25 1)), p2:(AND (EQ s13 1) (EQ s32 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 31 reset in 153 ms.
Product exploration explored 100000 steps with 25 reset in 171 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 136 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[p0, p0, (AND p0 p1), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 477 rows 291 cols
[2023-04-07 09:40:04] [INFO ] Computed 18 invariants in 3 ms
[2023-04-07 09:40:04] [INFO ] [Real]Absence check using 9 positive place invariants in 96 ms returned sat
[2023-04-07 09:40:04] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 41 ms returned sat
[2023-04-07 09:40:04] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (G (NOT (AND p1 p0))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND (NOT p0) p2)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 13 factoid took 307 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[p0, p0, (AND p1 p0)]
Stuttering acceptance computed with spot in 104 ms :[p0, p0, (AND p1 p0)]
Support contains 4 out of 291 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 477/477 transitions.
Applied a total of 0 rules in 3 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2023-04-07 09:40:04] [INFO ] Invariant cache hit.
[2023-04-07 09:40:05] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-04-07 09:40:05] [INFO ] Invariant cache hit.
[2023-04-07 09:40:05] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:40:05] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
[2023-04-07 09:40:05] [INFO ] Invariant cache hit.
[2023-04-07 09:40:06] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1346 ms. Remains : 291/291 places, 477/477 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 88 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[p0, p0, (AND p1 p0)]
Finished random walk after 7193 steps, including 2 resets, run visited all 4 properties in 44 ms. (steps per millisecond=163 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 8 factoid took 186 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[p0, p0, (AND p1 p0)]
Stuttering acceptance computed with spot in 105 ms :[p0, p0, (AND p1 p0)]
Stuttering acceptance computed with spot in 93 ms :[p0, p0, (AND p1 p0)]
Product exploration explored 100000 steps with 0 reset in 138 ms.
Stack based approach found an accepted trace after 10381 steps with 0 reset with depth 10382 and stack size 6693 in 17 ms.
FORMULA Anderson-PT-08-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-06 finished in 4400 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((F(p1)||p0))&&X((!p2 U (p3||G(!p2)))))))'
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 292 transition count 477
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 292 transition count 477
Applied a total of 58 rules in 8 ms. Remains 292 /321 variables (removed 29) and now considering 477/828 (removed 351) transitions.
// Phase 1: matrix 477 rows 292 cols
[2023-04-07 09:40:07] [INFO ] Computed 19 invariants in 11 ms
[2023-04-07 09:40:07] [INFO ] Implicit Places using invariants in 243 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 263 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/321 places, 477/828 transitions.
Applied a total of 0 rules in 3 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 274 ms. Remains : 291/321 places, 477/828 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p3) p2), true]
Running random walk in product with property : Anderson-PT-08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (NEQ s15 1) (NEQ s34 1)), p1:(OR (NEQ s21 1) (NEQ s29 1)), p3:(AND (NOT (AND (EQ s13 1) (EQ s26 1))) (NOT (AND (EQ s15 1) (EQ s34 1)))), p2:(AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 113 ms.
Product exploration explored 100000 steps with 5 reset in 197 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 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 168 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 477 rows 291 cols
[2023-04-07 09:40:08] [INFO ] Computed 18 invariants in 3 ms
[2023-04-07 09:40:08] [INFO ] [Real]Absence check using 10 positive place invariants in 94 ms returned sat
[2023-04-07 09:40:08] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 62 ms returned sat
[2023-04-07 09:40:08] [INFO ] After 357ms 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 p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 24 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-08-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-08-LTLFireability-07 finished in 1552 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)&&F(G(p1)))))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 321 transition count 772
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 265 transition count 772
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 142 place count 235 transition count 406
Iterating global reduction 0 with 30 rules applied. Total rules applied 172 place count 235 transition count 406
Applied a total of 172 rules in 19 ms. Remains 235 /321 variables (removed 86) and now considering 406/828 (removed 422) transitions.
// Phase 1: matrix 406 rows 235 cols
[2023-04-07 09:40:08] [INFO ] Computed 19 invariants in 3 ms
[2023-04-07 09:40:09] [INFO ] Implicit Places using invariants in 400 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 402 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/321 places, 406/828 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 234 transition count 344
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 172 transition count 344
Applied a total of 124 rules in 23 ms. Remains 172 /234 variables (removed 62) and now considering 344/406 (removed 62) transitions.
// Phase 1: matrix 344 rows 172 cols
[2023-04-07 09:40:09] [INFO ] Computed 18 invariants in 3 ms
[2023-04-07 09:40:09] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-04-07 09:40:09] [INFO ] Invariant cache hit.
[2023-04-07 09:40:09] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:40:09] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 172/321 places, 344/828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1100 ms. Remains : 172/321 places, 344/828 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-10 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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s14 0) (EQ s30 0)), p1:(OR (EQ s22 0) (EQ s28 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 4 reset in 179 ms.
Product exploration explored 100000 steps with 8 reset in 144 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 122 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 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 09:40:10] [INFO ] Invariant cache hit.
[2023-04-07 09:40:10] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 09:40:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-04-07 09:40:10] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2023-04-07 09:40:10] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 09:40:10] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:40:10] [INFO ] After 58ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 09:40:10] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-04-07 09:40:11] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 344/344 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 172 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 171 transition count 343
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 170 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 170 transition count 328
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 170 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 169 transition count 327
Applied a total of 6 rules in 17 ms. Remains 169 /172 variables (removed 3) and now considering 327/344 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 169/172 places, 327/344 transitions.
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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 50402 steps, run visited all 1 properties in 111 ms. (steps per millisecond=454 )
Probabilistic random walk after 50402 steps, saw 35295 distinct states, run finished after 111 ms. (steps per millisecond=454 ) properties seen :1
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 295 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 213 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 344/344 transitions.
Applied a total of 0 rules in 9 ms. Remains 172 /172 variables (removed 0) and now considering 344/344 (removed 0) transitions.
[2023-04-07 09:40:11] [INFO ] Invariant cache hit.
[2023-04-07 09:40:11] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-04-07 09:40:12] [INFO ] Invariant cache hit.
[2023-04-07 09:40:12] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:40:12] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2023-04-07 09:40:12] [INFO ] Redundant transitions in 22 ms returned []
[2023-04-07 09:40:12] [INFO ] Invariant cache hit.
[2023-04-07 09:40:12] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 859 ms. Remains : 172/172 places, 344/344 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 99 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 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 09:40:12] [INFO ] Invariant cache hit.
[2023-04-07 09:40:12] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 09:40:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-04-07 09:40:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2023-04-07 09:40:13] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 09:40:13] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:40:13] [INFO ] After 58ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 09:40:13] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-07 09:40:13] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 344/344 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 172 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 171 transition count 343
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 170 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 170 transition count 328
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 170 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 169 transition count 327
Applied a total of 6 rules in 17 ms. Remains 169 /172 variables (removed 3) and now considering 327/344 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 169/172 places, 327/344 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 50402 steps, run visited all 1 properties in 137 ms. (steps per millisecond=367 )
Probabilistic random walk after 50402 steps, saw 35295 distinct states, run finished after 137 ms. (steps per millisecond=367 ) properties seen :1
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 161 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 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 121 ms.
Product exploration explored 100000 steps with 7 reset in 159 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 344/344 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 344/344 (removed 0) transitions.
[2023-04-07 09:40:14] [INFO ] Invariant cache hit.
[2023-04-07 09:40:14] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-04-07 09:40:14] [INFO ] Invariant cache hit.
[2023-04-07 09:40:14] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:40:14] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2023-04-07 09:40:14] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 09:40:14] [INFO ] Invariant cache hit.
[2023-04-07 09:40:15] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 858 ms. Remains : 172/172 places, 344/344 transitions.
Treatment of property Anderson-PT-08-LTLFireability-10 finished in 6501 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(p0) U X((!p1 U p2))))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 292 transition count 449
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 292 transition count 449
Applied a total of 58 rules in 7 ms. Remains 292 /321 variables (removed 29) and now considering 449/828 (removed 379) transitions.
// Phase 1: matrix 449 rows 292 cols
[2023-04-07 09:40:15] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 09:40:15] [INFO ] Implicit Places using invariants in 421 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 433 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/321 places, 449/828 transitions.
Applied a total of 0 rules in 8 ms. Remains 291 /291 variables (removed 0) and now considering 449/449 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 448 ms. Remains : 291/321 places, 449/828 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s96 1), p2:(EQ s74 1), p1:(AND (EQ s16 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 77306 steps with 36 reset in 166 ms.
FORMULA Anderson-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-12 finished in 847 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(((p0 U G(p1))||X(F(p2)))))'
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 290 transition count 447
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 290 transition count 447
Applied a total of 62 rules in 7 ms. Remains 290 /321 variables (removed 31) and now considering 447/828 (removed 381) transitions.
// Phase 1: matrix 447 rows 290 cols
[2023-04-07 09:40:16] [INFO ] Computed 19 invariants in 3 ms
[2023-04-07 09:40:16] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-04-07 09:40:16] [INFO ] Invariant cache hit.
[2023-04-07 09:40:16] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:40:17] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1318 ms to find 0 implicit places.
[2023-04-07 09:40:17] [INFO ] Invariant cache hit.
[2023-04-07 09:40:17] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 290/321 places, 447/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1591 ms. Remains : 290/321 places, 447/828 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Anderson-PT-08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s15 1) (EQ s29 1)), p0:(AND (EQ s7 1) (EQ s195 1)), p2:(AND (EQ s0 1) (EQ s252 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 45 reset in 137 ms.
Stack based approach found an accepted trace after 78 steps with 0 reset with depth 79 and stack size 79 in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-13 finished in 1921 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(F(p0)))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 290 transition count 447
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 290 transition count 447
Applied a total of 62 rules in 12 ms. Remains 290 /321 variables (removed 31) and now considering 447/828 (removed 381) transitions.
// Phase 1: matrix 447 rows 290 cols
[2023-04-07 09:40:18] [INFO ] Computed 19 invariants in 3 ms
[2023-04-07 09:40:18] [INFO ] Implicit Places using invariants in 268 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 270 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 289/321 places, 447/828 transitions.
Applied a total of 0 rules in 3 ms. Remains 289 /289 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 287 ms. Remains : 289/321 places, 447/828 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s29 0) (AND (EQ s2 1) (EQ s166 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 50000 reset in 321 ms.
Product exploration explored 100000 steps with 50000 reset in 333 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-08-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-08-LTLFireability-14 finished in 1085 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(p0) U (p1||X(X(X(!p0))))))'
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 828/828 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 291 transition count 462
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 291 transition count 462
Applied a total of 60 rules in 11 ms. Remains 291 /321 variables (removed 30) and now considering 462/828 (removed 366) transitions.
// Phase 1: matrix 462 rows 291 cols
[2023-04-07 09:40:19] [INFO ] Computed 19 invariants in 3 ms
[2023-04-07 09:40:19] [INFO ] Implicit Places using invariants in 238 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 254 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 290/321 places, 462/828 transitions.
Applied a total of 0 rules in 3 ms. Remains 290 /290 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 270 ms. Remains : 290/321 places, 462/828 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), true, (AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0, p0]
Running random walk in product with property : Anderson-PT-08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 2}]], initial=0, aps=[p1:(AND (EQ s15 1) (EQ s25 1)), p0:(AND (EQ s15 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 237 ms.
Product exploration explored 100000 steps with 25000 reset in 233 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)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 76 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, p0, p0, p0, true]
Finished random walk after 1977 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=494 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 92 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 126 ms :[p0, p0, p0, p0, true]
Support contains 2 out of 290 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 290 /290 variables (removed 0) and now considering 462/462 (removed 0) transitions.
// Phase 1: matrix 462 rows 290 cols
[2023-04-07 09:40:20] [INFO ] Computed 18 invariants in 5 ms
[2023-04-07 09:40:20] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-04-07 09:40:21] [INFO ] Invariant cache hit.
[2023-04-07 09:40:21] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:40:21] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
[2023-04-07 09:40:21] [INFO ] Invariant cache hit.
[2023-04-07 09:40:22] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1357 ms. Remains : 290/290 places, 462/462 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 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[p0, p0, p0, p0, true]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 129 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 121 ms :[p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25000 reset in 231 ms.
Product exploration explored 100000 steps with 25000 reset in 234 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 126 ms :[p0, p0, p0, p0, true]
Support contains 2 out of 290 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 290/290 places, 462/462 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 290 transition count 462
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 56 Pre rules applied. Total rules applied 63 place count 290 transition count 462
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 1 with 56 rules applied. Total rules applied 119 place count 290 transition count 462
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 289 transition count 447
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 289 transition count 447
Deduced a syphon composed of 119 places in 0 ms
Applied a total of 121 rules in 41 ms. Remains 289 /290 variables (removed 1) and now considering 447/462 (removed 15) transitions.
[2023-04-07 09:40:23] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 447 rows 289 cols
[2023-04-07 09:40:23] [INFO ] Computed 18 invariants in 3 ms
[2023-04-07 09:40:24] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/290 places, 447/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 701 ms. Remains : 289/290 places, 447/462 transitions.
Support contains 2 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 462/462 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 289 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 289 transition count 447
Applied a total of 2 rules in 7 ms. Remains 289 /290 variables (removed 1) and now considering 447/462 (removed 15) transitions.
// Phase 1: matrix 447 rows 289 cols
[2023-04-07 09:40:24] [INFO ] Computed 18 invariants in 2 ms
[2023-04-07 09:40:24] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-04-07 09:40:24] [INFO ] Invariant cache hit.
[2023-04-07 09:40:24] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:40:25] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
[2023-04-07 09:40:25] [INFO ] Invariant cache hit.
[2023-04-07 09:40:25] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 289/290 places, 447/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1575 ms. Remains : 289/290 places, 447/462 transitions.
Treatment of property Anderson-PT-08-LTLFireability-15 finished in 6745 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)&&F(G(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' '!((X(p0) U (p1||X(X(X(!p0))))))'
[2023-04-07 09:40:26] [INFO ] Flatten gal took : 53 ms
[2023-04-07 09:40:26] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 09:40:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 321 places, 828 transitions and 3188 arcs took 9 ms.
Total runtime 41178 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1358/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1358/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Anderson-PT-08-LTLFireability-10
Could not compute solution for formula : Anderson-PT-08-LTLFireability-15

BK_STOP 1680860427962

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.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-08-LTLFireability-10
ltl formula formula --ltl=/tmp/1358/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 321 places, 828 transitions and 3188 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.150 real 0.020 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1358/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1358/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1358/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1358/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-08-LTLFireability-15
ltl formula formula --ltl=/tmp/1358/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: =============================================================================
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): 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 321 places, 828 transitions and 3188 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.090 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1358/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1358/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1358/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1358/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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:

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-08"
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-08, 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-167987246100036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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