Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075406900364.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is IOTPpurchase-PT-C03M03P03D03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406900364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 60K May 5 16:51 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-C03M03P03D03-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-15

=== Now, execution of the tool begins

BK_START 1620838211146

Running Version 0
[2021-05-12 16:50:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 16:50:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:50:20] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2021-05-12 16:50:20] [INFO ] Transformed 111 places.
[2021-05-12 16:50:20] [INFO ] Transformed 45 transitions.
[2021-05-12 16:50:20] [INFO ] Parsed PT model containing 111 places and 45 transitions in 94 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 16:50:20] [INFO ] Initial state test concluded for 3 properties.
Support contains 40 out of 111 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 32 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 74 transition count 45
Applied a total of 37 rules in 16 ms. Remains 74 /111 variables (removed 37) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 74 cols
[2021-05-12 16:50:20] [INFO ] Computed 30 place invariants in 7 ms
[2021-05-12 16:50:21] [INFO ] Implicit Places using invariants in 103 ms returned [11, 24]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 129 ms to find 2 implicit places.
// Phase 1: matrix 45 rows 72 cols
[2021-05-12 16:50:21] [INFO ] Computed 28 place invariants in 3 ms
[2021-05-12 16:50:21] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Starting structural reductions, iteration 1 : 72/111 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 72 /72 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 72 cols
[2021-05-12 16:50:21] [INFO ] Computed 28 place invariants in 2 ms
[2021-05-12 16:50:21] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 2 iterations. Remains : 72/111 places, 45/45 transitions.
[2021-05-12 16:50:21] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-12 16:50:21] [INFO ] Flatten gal took : 26 ms
FORMULA IOTPpurchase-PT-C03M03P03D03-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:50:21] [INFO ] Flatten gal took : 9 ms
[2021-05-12 16:50:21] [INFO ] Input system was already deterministic with 45 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=340 ) properties (out of 24) seen :22
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 72 cols
[2021-05-12 16:50:21] [INFO ] Computed 28 place invariants in 6 ms
[2021-05-12 16:50:21] [INFO ] [Real]Absence check using 17 positive place invariants in 1 ms returned unsat
[2021-05-12 16:50:21] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2021-05-12 16:50:21] [INFO ] [Real]Absence check using 17 positive and 11 generalized place invariants in 1 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p1)||p0) U (G((F(p1)||p2))||(p3&&(F(p1)||p4)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 3 places :
Implicit places reduction removed 3 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 9 rules applied. Total rules applied 9 place count 65 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 27 place count 55 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 36 place count 47 transition count 30
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 39 place count 45 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 40 place count 44 transition count 29
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 40 place count 44 transition count 20
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 23 rules applied. Total rules applied 63 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 63 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 65 place count 29 transition count 19
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 5 with 15 rules applied. Total rules applied 80 place count 20 transition count 13
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 19 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 86 place count 16 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 87 place count 16 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 88 place count 15 transition count 10
Applied a total of 88 rules in 22 ms. Remains 15 /72 variables (removed 57) and now considering 10/45 (removed 35) transitions.
// Phase 1: matrix 10 rows 15 cols
[2021-05-12 16:50:21] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 16:50:21] [INFO ] Implicit Places using invariants in 19 ms returned [1, 3, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 20 ms to find 3 implicit places.
[2021-05-12 16:50:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-12 16:50:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:50:21] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 12/72 places, 10/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 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 2 with 2 rules applied. Total rules applied 6 place count 9 transition count 7
Applied a total of 6 rules in 2 ms. Remains 9 /12 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-12 16:50:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:50:21] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-12 16:50:21] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-12 16:50:21] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/72 places, 7/45 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (NOT p1), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-00 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p4) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p3) p0) (AND (NOT p1) p3 (NOT p4) p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 (NOT p1) (NOT p3) (NOT p0)) (AND p2 (NOT p1) (NOT p4) (NOT p0))), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p4) (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p3) p0) (AND (NOT p2) (NOT p1) (NOT p4) p0)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p2 (NOT p1) (NOT p3) p0) (AND p2 (NOT p1) (NOT p4) p0)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p2 (NOT p1) (NOT p3) (NOT p0)) (AND p2 (NOT p1) (NOT p4) (NOT p0))), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(GT 1 s2), p2:(OR (LEQ 3 s6) (LEQ 1 s2)), p1:(LEQ s4 s5), p0:(OR (LEQ 3 s6) (LEQ 1 s2)), p4:(OR (LEQ 3 s6) (LEQ 1 s2))], 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 4105 reset in 235 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-00 finished in 642 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(((p0 U p1)||(p2 U p1)))&&F(G(p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 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 9 rules applied. Total rules applied 9 place count 66 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 18 rules applied. Total rules applied 27 place count 55 transition count 31
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 35 place count 48 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 47 transition count 30
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 36 place count 47 transition count 20
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 4 with 26 rules applied. Total rules applied 62 place count 31 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 62 place count 31 transition count 18
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 66 place count 29 transition count 18
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 80 place count 21 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 20 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 81 place count 20 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 84 place count 18 transition count 11
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 1 rules applied. Total rules applied 85 place count 18 transition count 10
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 6 with 3 rules applied. Total rules applied 88 place count 16 transition count 9
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 90 place count 15 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 91 place count 14 transition count 8
Applied a total of 91 rules in 9 ms. Remains 14 /72 variables (removed 58) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 14 cols
[2021-05-12 16:50:22] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:50:22] [INFO ] Implicit Places using invariants in 23 ms returned [1, 4, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
[2021-05-12 16:50:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 11 cols
[2021-05-12 16:50:22] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:50:22] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 11/72 places, 8/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-12 16:50:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 11 cols
[2021-05-12 16:50:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 16:50:22] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/72 places, 8/45 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p3)), true, (NOT p1), (NOT p1), (NOT p1), (NOT p3)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-01 automaton TGBA [mat=[[{ cond=(OR p1 p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 4}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s3 s6), p0:(LEQ 2 s8), p2:(LEQ 2 s7), p3:(GT 1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 170 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-01 finished in 417 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((G(p0)||X(p1)) U p2)))], workingDir=/home/mcc/execution]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 45
Applied a total of 7 rules in 3 ms. Remains 65 /72 variables (removed 7) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:50:22] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-12 16:50:22] [INFO ] Implicit Places using invariants in 64 ms returned [17, 20, 27]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:50:22] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-12 16:50:22] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 62/72 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.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:50:22] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-12 16:50:22] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 62/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 1 s25), p0:(LEQ 1 s47), p1:(LEQ 3 s47)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-02 finished in 314 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 3 places :
Implicit places reduction removed 3 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 11 rules applied. Total rules applied 11 place count 65 transition count 37
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 22 rules applied. Total rules applied 33 place count 52 transition count 28
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 43 place count 43 transition count 27
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 46 place count 41 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 47 place count 40 transition count 26
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 47 place count 40 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 68 place count 27 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 68 place count 27 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 25 transition count 16
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 10 places and 0 transitions.
Iterating global reduction 5 with 17 rules applied. Total rules applied 89 place count 15 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 90 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 90 place count 14 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 93 place count 12 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 94 place count 12 transition count 7
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 7 with 3 rules applied. Total rules applied 97 place count 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 99 place count 9 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 100 place count 8 transition count 5
Applied a total of 100 rules in 10 ms. Remains 8 /72 variables (removed 64) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 8 cols
[2021-05-12 16:50:23] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 16:50:23] [INFO ] Implicit Places using invariants in 14 ms returned [1, 3, 6]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 15 ms to find 3 implicit places.
[2021-05-12 16:50:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-12 16:50:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:50:23] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 5/72 places, 5/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 5 transition count 3
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 2 transition count 2
Applied a total of 6 rules in 1 ms. Remains 2 /5 variables (removed 3) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 16:50:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:50:23] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 16:50:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:50:23] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/72 places, 2/45 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), p0]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s1)], 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 19978 reset in 163 ms.
Stack based approach found an accepted trace after 11 steps with 2 reset with depth 8 and stack size 6 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-03 finished in 316 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 3 places :
Implicit places reduction removed 3 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 9 rules applied. Total rules applied 9 place count 65 transition count 39
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 17 rules applied. Total rules applied 26 place count 55 transition count 32
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 34 place count 48 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 47 transition count 31
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 35 place count 47 transition count 24
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 53 place count 36 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 53 place count 36 transition count 23
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 55 place count 35 transition count 23
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 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 72 place count 25 transition count 16
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 24 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 73 place count 24 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 23 transition count 15
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 5 with 3 rules applied. Total rules applied 78 place count 21 transition count 14
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 5 with 3 rules applied. Total rules applied 81 place count 19 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 82 place count 19 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 84 place count 17 transition count 12
Applied a total of 84 rules in 8 ms. Remains 17 /72 variables (removed 55) and now considering 12/45 (removed 33) transitions.
// Phase 1: matrix 12 rows 17 cols
[2021-05-12 16:50:23] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 16:50:23] [INFO ] Implicit Places using invariants in 29 ms returned [2, 4, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
[2021-05-12 16:50:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 14 cols
[2021-05-12 16:50:23] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:50:23] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 14/72 places, 12/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 11 transition count 9
Applied a total of 6 rules in 2 ms. Remains 11 /14 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 11 cols
[2021-05-12 16:50:23] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:50:23] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-12 16:50:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:50:23] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/72 places, 9/45 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s7 s6), p0:(LEQ 2 s1), p2:(LEQ s3 s4)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1581 reset in 149 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-05 finished in 328 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 66 transition count 45
Applied a total of 6 rules in 2 ms. Remains 66 /72 variables (removed 6) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2021-05-12 16:50:23] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-12 16:50:23] [INFO ] Implicit Places using invariants in 47 ms returned [17, 20, 27]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:50:23] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-12 16:50:23] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 63/72 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
[2021-05-12 16:50:23] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:50:23] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, true, true, p0]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-08 automaton TGBA [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: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT s57 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-08 finished in 230 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 3 places :
Implicit places reduction removed 3 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 10 rules applied. Total rules applied 10 place count 65 transition count 38
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 21 rules applied. Total rules applied 31 place count 53 transition count 29
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 41 place count 44 transition count 28
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 44 place count 42 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 45 place count 41 transition count 27
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 45 place count 41 transition count 21
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 60 place count 32 transition count 21
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 10 places and 0 transitions.
Iterating global reduction 5 with 17 rules applied. Total rules applied 77 place count 22 transition count 14
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 78 place count 21 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 78 place count 21 transition count 13
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 80 place count 20 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 85 place count 17 transition count 11
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 88 place count 15 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 89 place count 15 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 91 place count 13 transition count 9
Applied a total of 91 rules in 6 ms. Remains 13 /72 variables (removed 59) and now considering 9/45 (removed 36) transitions.
// Phase 1: matrix 9 rows 13 cols
[2021-05-12 16:50:24] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:50:24] [INFO ] Implicit Places using invariants in 11 ms returned [1, 3, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 12 ms to find 3 implicit places.
[2021-05-12 16:50:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-12 16:50:24] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:50:24] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 10/72 places, 9/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 7 transition count 6
Applied a total of 6 rules in 2 ms. Remains 7 /10 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-12 16:50:24] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:50:24] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-12 16:50:24] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:50:24] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/72 places, 6/45 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 2 s2) (LEQ s5 s3))], 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 77 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 23 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-10 finished in 159 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 45
Applied a total of 7 rules in 2 ms. Remains 65 /72 variables (removed 7) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:50:24] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-12 16:50:24] [INFO ] Implicit Places using invariants in 40 ms returned [20, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:50:24] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-12 16:50:24] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 63/72 places, 45/45 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:50:24] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-12 16:50:24] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-11 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GT 3 s1) (GT s29 s52) (GT s17 s7)), p0:(LEQ s17 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 93 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-11 finished in 191 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 45
Applied a total of 7 rules in 3 ms. Remains 65 /72 variables (removed 7) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:50:24] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-12 16:50:24] [INFO ] Implicit Places using invariants in 28 ms returned [17, 20, 27]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:50:24] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-12 16:50:24] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 62/72 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.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:50:24] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-12 16:50:24] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 62/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 62/62 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 62 transition count 45
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 8 place count 62 transition count 45
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 23 place count 62 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 62 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 61 transition count 44
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 61 transition count 44
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 32 rules in 10 ms. Remains 61 /62 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:50:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 61 cols
[2021-05-12 16:50:25] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:50:25] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/62 places, 44/45 transitions.
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Product exploration explored 100000 steps with 50000 reset in 359 ms.
[2021-05-12 16:50:26] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:50:26] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:50:26] [INFO ] Time to serialize gal into /tmp/LTL10896992579953399759.gal : 7 ms
[2021-05-12 16:50:26] [INFO ] Time to serialize properties into /tmp/LTL10754710750703793876.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10896992579953399759.gal, -t, CGAL, -LTL, /tmp/LTL10754710750703793876.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10896992579953399759.gal -t CGAL -LTL /tmp/LTL10754710750703793876.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(BrandSelection_p11_5<1)"))))
Formula 0 simplified : !XF"(BrandSelection_p11_5<1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
16 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.187114,20172,1,0,6,25726,20,0,1373,21651,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IOTPpurchase-PT-C03M03P03D03-12 finished in 1982 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 3 places :
Implicit places reduction removed 3 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 11 rules applied. Total rules applied 11 place count 65 transition count 37
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 22 rules applied. Total rules applied 33 place count 52 transition count 28
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 43 place count 43 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 44 place count 42 transition count 27
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 44 place count 42 transition count 19
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 65 place count 29 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 65 place count 29 transition count 18
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 67 place count 28 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 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 84 place count 18 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 85 place count 17 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 85 place count 17 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 87 place count 16 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
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 92 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 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 95 place count 11 transition count 7
Applied a total of 95 rules in 5 ms. Remains 11 /72 variables (removed 61) and now considering 7/45 (removed 38) transitions.
// Phase 1: matrix 7 rows 11 cols
[2021-05-12 16:50:26] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:50:26] [INFO ] Implicit Places using invariants in 45 ms returned [1, 3, 6]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
[2021-05-12 16:50:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-12 16:50:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:50:26] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 8/72 places, 7/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 5 transition count 4
Applied a total of 6 rules in 1 ms. Remains 5 /8 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 5 cols
[2021-05-12 16:50:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:50:26] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-12 16:50:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:50:26] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/72 places, 4/45 transitions.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s4 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-13 finished in 187 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 3 places :
Implicit places reduction removed 3 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 10 rules applied. Total rules applied 10 place count 65 transition count 38
Reduce places removed 13 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 25 rules applied. Total rules applied 35 place count 52 transition count 26
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 49 place count 40 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 38 transition count 24
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 51 place count 38 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 19 rules applied. Total rules applied 70 place count 26 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 70 place count 26 transition count 15
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 74 place count 24 transition count 15
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 86 place count 17 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 16 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 15 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 15 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 13 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 92 place count 13 transition count 7
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 95 place count 11 transition count 7
Applied a total of 95 rules in 4 ms. Remains 11 /72 variables (removed 61) and now considering 7/45 (removed 38) transitions.
// Phase 1: matrix 7 rows 11 cols
[2021-05-12 16:50:26] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:50:26] [INFO ] Implicit Places using invariants in 11 ms returned [1, 4, 6]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 12 ms to find 3 implicit places.
[2021-05-12 16:50:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-12 16:50:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:50:26] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 8/72 places, 7/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 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 6
Applied a total of 2 rules in 1 ms. Remains 7 /8 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-12 16:50:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:50:26] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-12 16:50:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:50:26] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/72 places, 6/45 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-14 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s4), p0:(GT s6 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 83 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-14 finished in 200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 3 places :
Implicit places reduction removed 3 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 10 rules applied. Total rules applied 10 place count 65 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 29 place count 54 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 37 place count 46 transition count 30
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 37 place count 46 transition count 21
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 60 place count 32 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 60 place count 32 transition count 19
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 64 place count 30 transition count 19
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 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 81 place count 20 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 19 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 82 place count 19 transition count 11
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 85 place count 17 transition count 11
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 86 place count 17 transition count 10
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 89 place count 15 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 90 place count 14 transition count 9
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 92 place count 13 transition count 8
Applied a total of 92 rules in 5 ms. Remains 13 /72 variables (removed 59) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 13 cols
[2021-05-12 16:50:26] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 16:50:26] [INFO ] Implicit Places using invariants in 21 ms returned [2, 4, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 22 ms to find 3 implicit places.
[2021-05-12 16:50:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-12 16:50:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:50:26] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 10/72 places, 8/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
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 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 5
Applied a total of 6 rules in 2 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-12 16:50:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:50:26] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-12 16:50:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:50:26] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/72 places, 5/45 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s2 s4) (LEQ 2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7368 reset in 64 ms.
Stack based approach found an accepted trace after 1006 steps with 70 reset with depth 41 and stack size 24 in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-15 finished in 211 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620838236354

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-C03M03P03D03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is IOTPpurchase-PT-C03M03P03D03, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075406900364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C03M03P03D03.tgz
mv IOTPpurchase-PT-C03M03P03D03 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;