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.r233-tall-167856418400124.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 IOTPpurchase-PT-C05M04P03D02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418400124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.7K Feb 25 15:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 15:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 15:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 15:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 15:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 60K Mar 5 18:22 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 IOTPpurchase-PT-C05M04P03D02-LTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679451205436

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=IOTPpurchase-PT-C05M04P03D02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 02:13:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 02:13:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:13:27] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2023-03-22 02:13:27] [INFO ] Transformed 111 places.
[2023-03-22 02:13:27] [INFO ] Transformed 45 transitions.
[2023-03-22 02:13:27] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 97 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 17 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 91 transition count 45
Applied a total of 20 rules in 20 ms. Remains 91 /111 variables (removed 20) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 91 cols
[2023-03-22 02:13:27] [INFO ] Computed 47 place invariants in 12 ms
[2023-03-22 02:13:27] [INFO ] Implicit Places using invariants in 173 ms returned [12, 30, 41]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 198 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/111 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 220 ms. Remains : 88/111 places, 45/45 transitions.
Support contains 56 out of 88 places after structural reductions.
[2023-03-22 02:13:27] [INFO ] Flatten gal took : 24 ms
[2023-03-22 02:13:27] [INFO ] Flatten gal took : 8 ms
[2023-03-22 02:13:27] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 52 out of 88 places (down from 56) after GAL structural reductions.
Finished random walk after 122 steps, including 0 resets, run visited all 21 properties in 30 ms. (steps per millisecond=4 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 64 transition count 45
Applied a total of 24 rules in 4 ms. Remains 64 /88 variables (removed 24) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2023-03-22 02:13:28] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-22 02:13:28] [INFO ] Implicit Places using invariants in 54 ms returned [12, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/88 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 62/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-01 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 (LT s15 1) (LT s16 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 228 ms.
Product exploration explored 100000 steps with 50000 reset in 154 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 :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-01 finished in 771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0&&F(G(p0)))))))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 65 transition count 45
Applied a total of 23 rules in 3 ms. Remains 65 /88 variables (removed 23) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2023-03-22 02:13:28] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-22 02:13:28] [INFO ] Implicit Places using invariants in 78 ms returned [12, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/88 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 63/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, true, true, p0, (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 312 ms.
Stack based approach found an accepted trace after 1993 steps with 0 reset with depth 1994 and stack size 1659 in 13 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-03 finished in 607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 67 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 27 rules applied. Total rules applied 41 place count 52 transition count 24
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 53 place count 40 transition count 24
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 53 place count 40 transition count 16
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 73 place count 28 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 73 place count 28 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 77 place count 26 transition count 14
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 95 place count 15 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 14 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 96 place count 14 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 13 transition count 6
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 107 place count 7 transition count 3
Applied a total of 107 rules in 24 ms. Remains 7 /88 variables (removed 81) and now considering 3/45 (removed 42) transitions.
// Phase 1: matrix 3 rows 7 cols
[2023-03-22 02:13:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 02:13:29] [INFO ] Implicit Places using invariants in 27 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/88 places, 3/45 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5 transition count 2
Applied a total of 2 rules in 2 ms. Remains 5 /6 variables (removed 1) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 5 cols
[2023-03-22 02:13:29] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 02:13:29] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 02:13:29] [INFO ] Invariant cache hit.
[2023-03-22 02:13:29] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/88 places, 2/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 5/88 places, 2/45 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1) (LT s3 1) (LT s4 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 125 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-04 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 67 transition count 45
Applied a total of 21 rules in 4 ms. Remains 67 /88 variables (removed 21) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2023-03-22 02:13:29] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-22 02:13:29] [INFO ] Implicit Places using invariants in 46 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/88 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 66/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s5 1) (GEQ s13 1) (GEQ s14 1) (GEQ s21 1) (GEQ s36 1) (GEQ s57 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][false, false, false]]
Product exploration explored 100000 steps with 873 reset in 159 ms.
Product exploration explored 100000 steps with 879 reset in 214 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 45 rows 66 cols
[2023-03-22 02:13:31] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-22 02:13:31] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 02:13:31] [INFO ] [Real]Absence check using 16 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-22 02:13:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:13:31] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-22 02:13:31] [INFO ] Computed and/alt/rep : 44/49/44 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 02:13:31] [INFO ] Added : 37 causal constraints over 8 iterations in 66 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-22 02:13:31] [INFO ] Invariant cache hit.
[2023-03-22 02:13:31] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-22 02:13:31] [INFO ] Invariant cache hit.
[2023-03-22 02:13:31] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-22 02:13:31] [INFO ] Invariant cache hit.
[2023-03-22 02:13:31] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 66/66 places, 45/45 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), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 142 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=47 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 02:13:32] [INFO ] Invariant cache hit.
[2023-03-22 02:13:32] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 02:13:32] [INFO ] [Real]Absence check using 16 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-22 02:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:13:32] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 02:13:32] [INFO ] Computed and/alt/rep : 44/49/44 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 02:13:32] [INFO ] Added : 35 causal constraints over 7 iterations in 49 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 875 reset in 130 ms.
Product exploration explored 100000 steps with 877 reset in 130 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 66 transition count 45
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 9 place count 66 transition count 45
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 22 place count 66 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 66 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 65 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 65 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 30 rules in 20 ms. Remains 65 /66 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2023-03-22 02:13:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 65 cols
[2023-03-22 02:13:32] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-22 02:13:32] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/66 places, 44/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 65/66 places, 44/45 transitions.
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2023-03-22 02:13:32] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-22 02:13:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-22 02:13:32] [INFO ] Invariant cache hit.
[2023-03-22 02:13:32] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-22 02:13:32] [INFO ] Invariant cache hit.
[2023-03-22 02:13:32] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 66/66 places, 45/45 transitions.
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-05 finished in 3207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 65 transition count 37
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 25 rules applied. Total rules applied 37 place count 51 transition count 26
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 49 place count 40 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 39 transition count 25
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 50 place count 39 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 68 place count 28 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 68 place count 28 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 72 place count 26 transition count 16
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 86 place count 18 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 17 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 89 place count 16 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 89 place count 16 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 92 place count 14 transition count 8
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 93 place count 14 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 95 place count 12 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 95 place count 12 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 97 place count 11 transition count 6
Applied a total of 97 rules in 6 ms. Remains 11 /88 variables (removed 77) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 11 cols
[2023-03-22 02:13:33] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-22 02:13:33] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-22 02:13:33] [INFO ] Invariant cache hit.
[2023-03-22 02:13:33] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-22 02:13:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:13:33] [INFO ] Invariant cache hit.
[2023-03-22 02:13:33] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/88 places, 6/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 11/88 places, 6/45 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s4 1) (GEQ s9 1)), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8793 reset in 77 ms.
Product exploration explored 100000 steps with 8796 reset in 68 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0)]
Knowledge based reduction with 5 factoid took 388 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-22 02:13:34] [INFO ] Invariant cache hit.
[2023-03-22 02:13:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 02:13:34] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-22 02:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:13:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 02:13:34] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 02:13:34] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 11 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-22 02:13:34] [INFO ] Invariant cache hit.
[2023-03-22 02:13:34] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 02:13:34] [INFO ] Invariant cache hit.
[2023-03-22 02:13:34] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-22 02:13:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:13:34] [INFO ] Invariant cache hit.
[2023-03-22 02:13:34] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 11/11 places, 6/6 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-22 02:13:34] [INFO ] Invariant cache hit.
[2023-03-22 02:13:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 02:13:34] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-22 02:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:13:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 02:13:34] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 02:13:34] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8744 reset in 74 ms.
Product exploration explored 100000 steps with 8727 reset in 73 ms.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 6/6 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 11 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 9 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 9 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 8 transition count 4
Applied a total of 5 rules in 2 ms. Remains 8 /11 variables (removed 3) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 8 cols
[2023-03-22 02:13:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 02:13:34] [INFO ] Implicit Places using invariants in 27 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/11 places, 4/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31 ms. Remains : 7/11 places, 4/6 transitions.
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-06 finished in 1988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((!(G(p0) U !p0)||X(X(p1))))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 65 transition count 45
Applied a total of 23 rules in 13 ms. Remains 65 /88 variables (removed 23) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2023-03-22 02:13:35] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-22 02:13:35] [INFO ] Implicit Places using invariants in 43 ms returned [12, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/88 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 63/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s42 1)), p1:(OR (GEQ s46 1) (LT s13 1) (LT s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19962 reset in 94 ms.
Product exploration explored 100000 steps with 20040 reset in 107 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Finished random walk after 72 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2023-03-22 02:13:36] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-22 02:13:36] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-22 02:13:36] [INFO ] Invariant cache hit.
[2023-03-22 02:13:36] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-22 02:13:36] [INFO ] Invariant cache hit.
[2023-03-22 02:13:36] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 63/63 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Finished random walk after 72 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 215 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 20019 reset in 92 ms.
Product exploration explored 100000 steps with 19917 reset in 96 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 63 transition count 45
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 8 place count 63 transition count 45
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 22 place count 63 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 62 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 62 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 30 rules in 8 ms. Remains 62 /63 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2023-03-22 02:13:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 62 cols
[2023-03-22 02:13:38] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-22 02:13:38] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 44/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 62/63 places, 44/45 transitions.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2023-03-22 02:13:38] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-22 02:13:38] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-22 02:13:38] [INFO ] Invariant cache hit.
[2023-03-22 02:13:38] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-22 02:13:38] [INFO ] Invariant cache hit.
[2023-03-22 02:13:38] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 63/63 places, 45/45 transitions.
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-07 finished in 3267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(!p0)||X((X(G((F(p3)||p2)))&&p1))))))'
Support contains 9 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 68 transition count 45
Applied a total of 20 rules in 3 ms. Remains 68 /88 variables (removed 20) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 68 cols
[2023-03-22 02:13:38] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-22 02:13:38] [INFO ] Implicit Places using invariants in 42 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/88 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 67/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (AND p0 (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1)))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p3)), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p3)), acceptance={1} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(OR (LT s13 1) (LT s17 1) (LT s22 1) (LT s52 1)), p1:(AND (GEQ s10 1) (GEQ s14 1)), p2:(OR (LT s16 1) (LT s29 1) (LT s53 1)), p3:(AND (GEQ s10 1) (GEQ ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 742 reset in 160 ms.
Product exploration explored 100000 steps with 737 reset in 173 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 (NOT p1) p2 (NOT p3)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 312 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter sensitive) to 6 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (AND p0 (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 45 rows 67 cols
[2023-03-22 02:13:40] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-22 02:13:40] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2 (NOT p3)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (G (NOT (AND p0 p1 (NOT p3)))), (G (NOT (AND (NOT p0) p1 (NOT p3)))), (G (NOT (AND (NOT p2) p1 (NOT p3)))), (G (NOT (AND p0 (NOT p2) p1 (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))), (F (AND (NOT p2) (NOT p1) (NOT p3))), (F (NOT (AND p0 p2 (NOT p3)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p2 (NOT p3))), (F (AND p0 (NOT p2) (NOT p1) (NOT p3)))]
Knowledge based reduction with 9 factoid took 672 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) p0), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 222 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) p0), (AND p0 (NOT p1))]
[2023-03-22 02:13:41] [INFO ] Invariant cache hit.
[2023-03-22 02:13:41] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 02:13:41] [INFO ] [Real]Absence check using 16 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-22 02:13:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:13:41] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 02:13:41] [INFO ] Computed and/alt/rep : 44/50/44 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 02:13:41] [INFO ] Added : 20 causal constraints over 4 iterations in 32 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-22 02:13:41] [INFO ] Invariant cache hit.
[2023-03-22 02:13:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-22 02:13:41] [INFO ] Invariant cache hit.
[2023-03-22 02:13:41] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-22 02:13:41] [INFO ] Invariant cache hit.
[2023-03-22 02:13:41] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 67/67 places, 45/45 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 p3) p0 p2), (X (OR (NOT p1) p3)), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 02:13:41] [INFO ] Invariant cache hit.
[2023-03-22 02:13:41] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0 p2), (X (OR (NOT p1) p3)), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p3 (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p3) (NOT p2))), (F (NOT (AND (NOT p3) p0))), (F (AND (NOT p3) (NOT p0))), (F (AND (NOT p0) (NOT p1))), (F (AND p3 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 356 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (AND (NOT p3) (NOT p2) p0), (AND p0 (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1)))]
Stuttering acceptance computed with spot in 230 ms :[(OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (AND (NOT p3) (NOT p2) p0), (AND p0 (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1)))]
[2023-03-22 02:13:42] [INFO ] Invariant cache hit.
[2023-03-22 02:13:42] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 02:13:42] [INFO ] [Real]Absence check using 16 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-22 02:13:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:13:42] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 02:13:42] [INFO ] Computed and/alt/rep : 44/50/44 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 02:13:42] [INFO ] Added : 20 causal constraints over 4 iterations in 44 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 253 ms :[(OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (AND (NOT p3) (NOT p2) p0), (AND p0 (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1)))]
Product exploration explored 100000 steps with 727 reset in 152 ms.
Product exploration explored 100000 steps with 741 reset in 150 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 232 ms :[(OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (AND (NOT p3) (NOT p2) p0), (AND p0 (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1)))]
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 45/45 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 67 transition count 45
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 7 place count 67 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 21 place count 67 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 67 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 66 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 66 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 30 rules in 10 ms. Remains 66 /67 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2023-03-22 02:13:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 66 cols
[2023-03-22 02:13:43] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-22 02:13:43] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/67 places, 44/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 66/67 places, 44/45 transitions.
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 67 /67 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2023-03-22 02:13:43] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-22 02:13:43] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-22 02:13:43] [INFO ] Invariant cache hit.
[2023-03-22 02:13:43] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-22 02:13:43] [INFO ] Invariant cache hit.
[2023-03-22 02:13:44] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 67/67 places, 45/45 transitions.
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-08 finished in 5756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(G(!p0)) U p1)&&F(p2))))'
Support contains 9 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 69 transition count 39
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 18 rules applied. Total rules applied 29 place count 59 transition count 31
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 38 place count 51 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 50 transition count 30
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 39 place count 50 transition count 19
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 68 place count 32 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 68 place count 32 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 74 place count 29 transition count 16
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 89 place count 20 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 94 place count 17 transition count 8
Applied a total of 94 rules in 10 ms. Remains 17 /88 variables (removed 71) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 17 cols
[2023-03-22 02:13:44] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-22 02:13:44] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-22 02:13:44] [INFO ] Invariant cache hit.
[2023-03-22 02:13:44] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-22 02:13:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:13:44] [INFO ] Invariant cache hit.
[2023-03-22 02:13:44] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/88 places, 8/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 17/88 places, 8/45 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p2) (NOT p1)), p0, (NOT p1), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s14 1)), p2:(GEQ s12 1), p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s3 1) (GEQ s5 1) (GEQ s8 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-09 finished in 412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 65 transition count 38
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 22 rules applied. Total rules applied 33 place count 53 transition count 28
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 43 place count 43 transition count 28
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 43 place count 43 transition count 19
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 65 place count 30 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 65 place count 30 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 69 place count 28 transition count 17
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 85 place count 18 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 17 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 86 place count 17 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 91 place count 14 transition count 9
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 92 place count 14 transition count 8
Reduce places removed 2 places and 0 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 5 with 3 rules applied. Total rules applied 95 place count 12 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 96 place count 11 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 98 place count 10 transition count 6
Applied a total of 98 rules in 11 ms. Remains 10 /88 variables (removed 78) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 10 cols
[2023-03-22 02:13:44] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 02:13:44] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 02:13:44] [INFO ] Invariant cache hit.
[2023-03-22 02:13:44] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-22 02:13:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:13:44] [INFO ] Invariant cache hit.
[2023-03-22 02:13:44] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/88 places, 6/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 10/88 places, 6/45 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s0 1), p1:(AND (GEQ s5 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5332 reset in 75 ms.
Product exploration explored 100000 steps with 5365 reset in 79 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 (NOT p1)), (X (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 280 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 119 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 10 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 351 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 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-22 02:13:45] [INFO ] Invariant cache hit.
[2023-03-22 02:13:45] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 02:13:45] [INFO ] Invariant cache hit.
[2023-03-22 02:13:45] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-22 02:13:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:13:45] [INFO ] Invariant cache hit.
[2023-03-22 02:13:45] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 10/10 places, 6/6 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 (NOT p1)), (X (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 285 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 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 9 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 339 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 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 5347 reset in 73 ms.
Product exploration explored 100000 steps with 5330 reset in 77 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-22 02:13:47] [INFO ] Invariant cache hit.
[2023-03-22 02:13:47] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-22 02:13:47] [INFO ] Invariant cache hit.
[2023-03-22 02:13:47] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-22 02:13:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:13:47] [INFO ] Invariant cache hit.
[2023-03-22 02:13:47] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 10/10 places, 6/6 transitions.
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-10 finished in 2764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((G(p1)&&F(p2)))&&p0)))'
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 66 transition count 40
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 14 rules applied. Total rules applied 22 place count 58 transition count 34
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 28 place count 52 transition count 34
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 28 place count 52 transition count 22
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 57 place count 35 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 57 place count 35 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 32 transition count 19
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 84 place count 19 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 18 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 85 place count 18 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 88 place count 16 transition count 10
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 89 place count 16 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 91 place count 14 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 91 place count 14 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 93 place count 13 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 95 place count 12 transition count 7
Applied a total of 95 rules in 10 ms. Remains 12 /88 variables (removed 76) and now considering 7/45 (removed 38) transitions.
// Phase 1: matrix 7 rows 12 cols
[2023-03-22 02:13:47] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 02:13:47] [INFO ] Implicit Places using invariants in 20 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/88 places, 7/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31 ms. Remains : 11/88 places, 7/45 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s7 1)), p1:(AND (GEQ s2 1) (GEQ s3 1)), p2:(AND (GEQ s0 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 4950 reset in 93 ms.
Stack based approach found an accepted trace after 80 steps with 4 reset with depth 25 and stack size 25 in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-11 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 64 transition count 45
Applied a total of 24 rules in 2 ms. Remains 64 /88 variables (removed 24) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2023-03-22 02:13:47] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-22 02:13:47] [INFO ] Implicit Places using invariants in 41 ms returned [12, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/88 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 62/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-12 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:(LT s52 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 90 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-12 finished in 146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((!p1||(G(p2) U X(p1))))))'
Support contains 15 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 11 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 72 transition count 45
Applied a total of 16 rules in 3 ms. Remains 72 /88 variables (removed 16) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 72 cols
[2023-03-22 02:13:47] [INFO ] Computed 28 place invariants in 0 ms
[2023-03-22 02:13:47] [INFO ] Implicit Places using invariants in 47 ms returned [16, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/88 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 70/88 places, 45/45 transitions.
Stuttering acceptance computed with spot in 208 ms :[false, false, (NOT p1), (NOT p1), true, (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s18 1) (GEQ s24 1) (GEQ s43 1) (OR (AND (GEQ s10 1) (GEQ s11 1)) (AND (GEQ s35 1) (GEQ s47 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 107 ms.
Product exploration explored 100000 steps with 33333 reset in 118 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 6 factoid took 137 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-13 finished in 646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 64 transition count 37
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 23 rules applied. Total rules applied 36 place count 51 transition count 27
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 46 place count 41 transition count 27
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 46 place count 41 transition count 17
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 72 place count 25 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 72 place count 25 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 78 place count 22 transition count 14
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 93 place count 13 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 13 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 12 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 98 place count 10 transition count 6
Applied a total of 98 rules in 10 ms. Remains 10 /88 variables (removed 78) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 10 cols
[2023-03-22 02:13:48] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 02:13:48] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 02:13:48] [INFO ] Invariant cache hit.
[2023-03-22 02:13:48] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-22 02:13:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:13:48] [INFO ] Invariant cache hit.
[2023-03-22 02:13:48] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/88 places, 6/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 10/88 places, 6/45 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-15 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s9 1), p1:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 14669 reset in 62 ms.
Product exploration explored 100000 steps with 14650 reset in 67 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 328 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-22 02:13:49] [INFO ] Invariant cache hit.
[2023-03-22 02:13:49] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-22 02:13:49] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-22 02:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:13:49] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 02:13:49] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 02:13:49] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-22 02:13:49] [INFO ] Invariant cache hit.
[2023-03-22 02:13:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 02:13:49] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-22 02:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:13:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 02:13:49] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 02:13:49] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-22 02:13:49] [INFO ] Invariant cache hit.
[2023-03-22 02:13:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 02:13:49] [INFO ] Invariant cache hit.
[2023-03-22 02:13:49] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-22 02:13:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:13:49] [INFO ] Invariant cache hit.
[2023-03-22 02:13:49] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 10/10 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 233 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 233 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-22 02:13:50] [INFO ] Invariant cache hit.
[2023-03-22 02:13:50] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-22 02:13:50] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-22 02:13:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:13:50] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 02:13:50] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 02:13:50] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-22 02:13:50] [INFO ] Invariant cache hit.
[2023-03-22 02:13:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 02:13:50] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-22 02:13:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:13:50] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 02:13:50] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 02:13:50] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 14708 reset in 69 ms.
Product exploration explored 100000 steps with 14663 reset in 67 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-22 02:13:50] [INFO ] Invariant cache hit.
[2023-03-22 02:13:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-22 02:13:50] [INFO ] Invariant cache hit.
[2023-03-22 02:13:50] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-22 02:13:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:13:50] [INFO ] Invariant cache hit.
[2023-03-22 02:13:50] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 10/10 places, 6/6 transitions.
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-15 finished in 2627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-05
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 67 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 27 rules applied. Total rules applied 41 place count 52 transition count 24
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 53 place count 40 transition count 24
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 53 place count 40 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 70 place count 30 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 70 place count 30 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 28 transition count 15
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 88 place count 20 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 19 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 89 place count 19 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 92 place count 17 transition count 8
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 17 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 95 place count 15 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 95 place count 15 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 98 place count 13 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 98 place count 13 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 101 place count 11 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 104 place count 9 transition count 4
Applied a total of 104 rules in 14 ms. Remains 9 /88 variables (removed 79) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 9 cols
[2023-03-22 02:13:51] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-22 02:13:51] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 02:13:51] [INFO ] Invariant cache hit.
[2023-03-22 02:13:51] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-22 02:13:51] [INFO ] Invariant cache hit.
[2023-03-22 02:13:51] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 9/88 places, 4/45 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 87 ms. Remains : 9/88 places, 4/45 transitions.
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25377 reset in 63 ms.
Product exploration explored 100000 steps with 25293 reset in 65 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 : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 02:13:51] [INFO ] Invariant cache hit.
[2023-03-22 02:13:51] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 02:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:13:51] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 02:13:51] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 02:13:51] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-22 02:13:51] [INFO ] Invariant cache hit.
[2023-03-22 02:13:51] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 02:13:51] [INFO ] Invariant cache hit.
[2023-03-22 02:13:51] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-22 02:13:51] [INFO ] Invariant cache hit.
[2023-03-22 02:13:51] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 9/9 places, 4/4 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 02:13:52] [INFO ] Invariant cache hit.
[2023-03-22 02:13:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 02:13:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:13:52] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 02:13:52] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 02:13:52] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25431 reset in 64 ms.
Product exploration explored 100000 steps with 25393 reset in 64 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-22 02:13:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:13:53] [INFO ] Invariant cache hit.
[2023-03-22 02:13:53] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34 ms. Remains : 9/9 places, 4/4 transitions.
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-22 02:13:53] [INFO ] Invariant cache hit.
[2023-03-22 02:13:53] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 02:13:53] [INFO ] Invariant cache hit.
[2023-03-22 02:13:53] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-22 02:13:53] [INFO ] Invariant cache hit.
[2023-03-22 02:13:53] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 9/9 places, 4/4 transitions.
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-05 finished in 2231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((!(G(p0) U !p0)||X(X(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(!p0)||X((X(G((F(p3)||p2)))&&p1))))))'
Found a Shortening insensitive property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-08
Stuttering acceptance computed with spot in 288 ms :[(OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (AND p0 (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1)))]
Support contains 9 out of 88 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 88/88 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 68 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 30 place count 57 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 38 place count 49 transition count 30
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 38 place count 49 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 62 place count 35 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 62 place count 35 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 33 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 84 place count 22 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 19 transition count 9
Applied a total of 89 rules in 10 ms. Remains 19 /88 variables (removed 69) and now considering 9/45 (removed 36) transitions.
// Phase 1: matrix 9 rows 19 cols
[2023-03-22 02:13:53] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-22 02:13:53] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-22 02:13:53] [INFO ] Invariant cache hit.
[2023-03-22 02:13:53] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-22 02:13:53] [INFO ] Invariant cache hit.
[2023-03-22 02:13:53] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 19/88 places, 9/45 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 118 ms. Remains : 19/88 places, 9/45 transitions.
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p3)), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p3)), acceptance={1} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(OR (LT s2 1) (LT s6 1) (LT s9 1) (LT s16 1)), p1:(AND (GEQ s1 1) (GEQ s3 1)), p2:(OR (LT s5 1) (LT s12 1) (LT s17 1)), p3:(AND (GEQ s1 1) (GEQ s3 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4336 reset in 118 ms.
Product exploration explored 100000 steps with 4293 reset in 133 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 (NOT p1) p2 (NOT p3)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 496 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter sensitive) to 6 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (AND p0 (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 02:13:55] [INFO ] Invariant cache hit.
[2023-03-22 02:13:55] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2 (NOT p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p3) p0 p1))), (G (NOT (AND (NOT p3) (NOT p0) p1))), (G (NOT (AND (NOT p2) (NOT p3) p1))), (G (NOT (AND (NOT p2) (NOT p3) p0 p1))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p0) p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p3) (NOT p1))), (F (NOT (AND p2 (NOT p3) p0))), (F (NOT (AND (NOT p3) p0 (NOT p1)))), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND p2 (NOT p3) (NOT p0))), (F (AND (NOT p2) (NOT p3) p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 655 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) p0), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 231 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) p0), (AND p0 (NOT p1))]
[2023-03-22 02:13:56] [INFO ] Invariant cache hit.
[2023-03-22 02:13:56] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 02:13:56] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 02:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:13:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 02:13:56] [INFO ] Computed and/alt/rep : 8/14/8 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 02:13:56] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 9 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-22 02:13:56] [INFO ] Invariant cache hit.
[2023-03-22 02:13:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 02:13:56] [INFO ] Invariant cache hit.
[2023-03-22 02:13:56] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-22 02:13:56] [INFO ] Invariant cache hit.
[2023-03-22 02:13:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 19/19 places, 9/9 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 p3) p0 p2), (X (OR (NOT p1) p3)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 3 factoid took 245 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :6
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-03-22 02:13:57] [INFO ] Invariant cache hit.
[2023-03-22 02:13:57] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0 p2), (X (OR (NOT p1) p3)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p3 (NOT p1)))]
False Knowledge obtained : [(X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p3) (NOT p2))), (F (NOT (AND (NOT p3) p0))), (F (AND (NOT p3) (NOT p0))), (F (AND (NOT p0) (NOT p1))), (F (AND p3 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 378 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (AND (NOT p3) (NOT p2) p0), (AND p0 (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1)))]
Stuttering acceptance computed with spot in 217 ms :[(OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (AND (NOT p3) (NOT p2) p0), (AND p0 (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1)))]
[2023-03-22 02:13:57] [INFO ] Invariant cache hit.
[2023-03-22 02:13:57] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 02:13:57] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-22 02:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:13:57] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 02:13:57] [INFO ] Computed and/alt/rep : 8/14/8 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 02:13:57] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 232 ms :[(OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (AND (NOT p3) (NOT p2) p0), (AND p0 (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1)))]
Product exploration explored 100000 steps with 4392 reset in 119 ms.
Product exploration explored 100000 steps with 4308 reset in 129 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 242 ms :[(OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (AND (NOT p3) (NOT p2) p0), (AND p0 (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1)))]
Support contains 9 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-22 02:13:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:13:58] [INFO ] Invariant cache hit.
[2023-03-22 02:13:58] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42 ms. Remains : 19/19 places, 9/9 transitions.
Support contains 9 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-22 02:13:58] [INFO ] Invariant cache hit.
[2023-03-22 02:13:58] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-22 02:13:58] [INFO ] Invariant cache hit.
[2023-03-22 02:13:58] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-22 02:13:58] [INFO ] Invariant cache hit.
[2023-03-22 02:13:58] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 19/19 places, 9/9 transitions.
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLFireability-08 finished in 5587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
[2023-03-22 02:13:59] [INFO ] Flatten gal took : 8 ms
[2023-03-22 02:13:59] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-22 02:13:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 88 places, 45 transitions and 176 arcs took 0 ms.
Total runtime 31972 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2657/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2657/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2657/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2657/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2657/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2657/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : IOTPpurchase-PT-C05M04P03D02-LTLFireability-05
Could not compute solution for formula : IOTPpurchase-PT-C05M04P03D02-LTLFireability-06
Could not compute solution for formula : IOTPpurchase-PT-C05M04P03D02-LTLFireability-07
Could not compute solution for formula : IOTPpurchase-PT-C05M04P03D02-LTLFireability-08
Could not compute solution for formula : IOTPpurchase-PT-C05M04P03D02-LTLFireability-10
Could not compute solution for formula : IOTPpurchase-PT-C05M04P03D02-LTLFireability-15

BK_STOP 1679451240597

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name IOTPpurchase-PT-C05M04P03D02-LTLFireability-05
ltl formula formula --ltl=/tmp/2657/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 88 places, 45 transitions and 176 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2657/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2657/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2657/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2657/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
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:
0: pnml2lts-mc(+0xa23f4) [0x5619ed5b43f4]
1: pnml2lts-mc(+0xa2496) [0x5619ed5b4496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7ff74e210140]
3: pnml2lts-mc(+0x405be5) [0x5619ed917be5]
4: pnml2lts-mc(+0x16b3f9) [0x5619ed67d3f9]
5: pnml2lts-mc(+0x164ac4) [0x5619ed676ac4]
6: pnml2lts-mc(+0x272e0a) [0x5619ed784e0a]
7: pnml2lts-mc(+0xb61f0) [0x5619ed5c81f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7ff74e0634d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7ff74e06367a]
10: pnml2lts-mc(+0xa1581) [0x5619ed5b3581]
11: pnml2lts-mc(+0xa1910) [0x5619ed5b3910]
12: pnml2lts-mc(+0xa32a2) [0x5619ed5b52a2]
13: pnml2lts-mc(+0xa50f4) [0x5619ed5b70f4]
14: pnml2lts-mc(+0x3f34b3) [0x5619ed9054b3]
15: pnml2lts-mc(+0x7c63d) [0x5619ed58e63d]
16: pnml2lts-mc(+0x67d86) [0x5619ed579d86]
17: pnml2lts-mc(+0x60a8a) [0x5619ed572a8a]
18: pnml2lts-mc(+0x5eb15) [0x5619ed570b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7ff74e04bd0a]
20: pnml2lts-mc(+0x6075e) [0x5619ed57275e]
ltl formula name IOTPpurchase-PT-C05M04P03D02-LTLFireability-06
ltl formula formula --ltl=/tmp/2657/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 88 places, 45 transitions and 176 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2657/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2657/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2657/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2657/ltl_1_
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 IOTPpurchase-PT-C05M04P03D02-LTLFireability-07
ltl formula formula --ltl=/tmp/2657/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 88 places, 45 transitions and 176 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2657/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2657/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2657/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2657/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)
ltl formula name IOTPpurchase-PT-C05M04P03D02-LTLFireability-08
ltl formula formula --ltl=/tmp/2657/ltl_3_
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 88 places, 45 transitions and 176 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( 1/ 4): LTL layer: formula: /tmp/2657/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2657/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2657/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2657/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name IOTPpurchase-PT-C05M04P03D02-LTLFireability-10
ltl formula formula --ltl=/tmp/2657/ltl_4_
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 88 places, 45 transitions and 176 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.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2657/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2657/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2657/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2657/ltl_4_
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 IOTPpurchase-PT-C05M04P03D02-LTLFireability-15
ltl formula formula --ltl=/tmp/2657/ltl_5_
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
pnml2lts-mc( 0/ 4): Petri net has 88 places, 45 transitions and 176 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2657/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2657/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2657/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2657/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
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="IOTPpurchase-PT-C05M04P03D02"
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 IOTPpurchase-PT-C05M04P03D02, 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 r233-tall-167856418400124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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