Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r219-smll-171649598200232.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r219-smll-171649598200232
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 11 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 13 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 60K May 18 16:42 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-LTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716715929087

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C03M03P03D03
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-26 09:32:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 09:32:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 09:32:12] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-26 09:32:12] [INFO ] Transformed 111 places.
[2024-05-26 09:32:12] [INFO ] Transformed 45 transitions.
[2024-05-26 09:32:12] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 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 31 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 75 transition count 45
Applied a total of 36 rules in 30 ms. Remains 75 /111 variables (removed 36) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 75 cols
[2024-05-26 09:32:13] [INFO ] Computed 31 invariants in 13 ms
[2024-05-26 09:32:13] [INFO ] Implicit Places using invariants in 342 ms returned [10, 22, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 404 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 72/111 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 72 /72 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 441 ms. Remains : 72/111 places, 45/45 transitions.
Support contains 29 out of 72 places after structural reductions.
[2024-05-26 09:32:13] [INFO ] Flatten gal took : 57 ms
[2024-05-26 09:32:13] [INFO ] Flatten gal took : 21 ms
[2024-05-26 09:32:14] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 27 out of 72 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 23) seen :21
Finished Best-First random walk after 3532 steps, including 1 resets, run visited all 2 properties in 19 ms. (steps per millisecond=185 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 3 places :
Implicit places reduction removed 3 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 12 rules applied. Total rules applied 12 place count 64 transition count 36
Reduce places removed 15 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 26 rules applied. Total rules applied 38 place count 49 transition count 25
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 49 place count 38 transition count 25
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 49 place count 38 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 69 place count 26 transition count 17
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 26 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 25 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 71 place count 25 transition count 14
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 75 place count 23 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 8 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 89 place count 15 transition count 8
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 8
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 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 93 place count 12 transition count 7
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 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 96 place count 10 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 96 place count 10 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 99 place count 8 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 99 place count 8 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 102 place count 6 transition count 4
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 8 with 3 rules applied. Total rules applied 105 place count 4 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 106 place count 4 transition count 2
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 108 place count 2 transition count 2
Applied a total of 108 rules in 28 ms. Remains 2 /72 variables (removed 70) and now considering 2/45 (removed 43) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-26 09:32:15] [INFO ] Computed 1 invariants in 1 ms
[2024-05-26 09:32:15] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-26 09:32:15] [INFO ] Invariant cache hit.
[2024-05-26 09:32:15] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-26 09:32:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-26 09:32:15] [INFO ] Invariant cache hit.
[2024-05-26 09:32:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/72 places, 2/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 2/72 places, 2/45 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 273 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 416 ms.
Product exploration explored 100000 steps with 50000 reset in 224 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 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-00 finished in 1148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0)||G(p1)||F(p2))))))'
Support contains 6 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 2 places :
Implicit places reduction removed 2 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 4 ms. Remains 65 /72 variables (removed 7) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2024-05-26 09:32:16] [INFO ] Computed 21 invariants in 2 ms
[2024-05-26 09:32:16] [INFO ] Implicit Places using invariants in 93 ms returned [14, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 94 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/72 places, 45/45 transitions.
Applied a total of 0 rules in 3 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 101 ms. Remains : 63/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GT s13 s47) (GT s45 s24)), p1:(LEQ 1 s57), p2:(GT 1 s61)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 890 reset in 315 ms.
Product exploration explored 100000 steps with 887 reset in 385 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) p2), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Finished random walk after 6201 steps, including 1 resets, run visited all 5 properties in 49 ms. (steps per millisecond=126 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 368 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Support contains 6 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 6 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2024-05-26 09:32:18] [INFO ] Computed 19 invariants in 2 ms
[2024-05-26 09:32:18] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-26 09:32:18] [INFO ] Invariant cache hit.
[2024-05-26 09:32:19] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-05-26 09:32:19] [INFO ] Invariant cache hit.
[2024-05-26 09:32:19] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 440 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) (NOT p1) p2), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Finished random walk after 1790 steps, including 0 resets, run visited all 5 properties in 20 ms. (steps per millisecond=89 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 369 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Product exploration explored 100000 steps with 896 reset in 313 ms.
Product exploration explored 100000 steps with 901 reset in 503 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 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 63 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 7 place count 63 transition count 45
Deduced a syphon composed of 18 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 18 place count 63 transition count 45
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 63 transition count 45
Deduced a syphon composed of 23 places in 1 ms
Applied a total of 23 rules in 29 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-26 09:32:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 63 cols
[2024-05-26 09:32:22] [INFO ] Computed 19 invariants in 3 ms
[2024-05-26 09:32:22] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/63 places, 45/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 63/63 places, 45/45 transitions.
Built C files in :
/tmp/ltsmin600333889176508295
[2024-05-26 09:32:22] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin600333889176508295
Running compilation step : cd /tmp/ltsmin600333889176508295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 468 ms.
Running link step : cd /tmp/ltsmin600333889176508295;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin600333889176508295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14999845741446362615.hoa' '--buchi-type=spotba'
LTSmin run took 567 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-01 finished in 7944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 64 transition count 45
Applied a total of 8 rules in 8 ms. Remains 64 /72 variables (removed 8) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2024-05-26 09:32:24] [INFO ] Computed 20 invariants in 1 ms
[2024-05-26 09:32:24] [INFO ] Implicit Places using invariants in 105 ms returned [15, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 108 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/72 places, 45/45 transitions.
Applied a total of 0 rules in 5 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 121 ms. Remains : 62/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT s5 s40), p0:(LEQ s18 s55)], 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 1026 reset in 200 ms.
Product exploration explored 100000 steps with 1018 reset in 253 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Finished random walk after 93 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=46 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 175 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 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
// Phase 1: matrix 45 rows 62 cols
[2024-05-26 09:32:25] [INFO ] Computed 18 invariants in 1 ms
[2024-05-26 09:32:25] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-26 09:32:25] [INFO ] [Real]Absence check using 16 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-26 09:32:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 09:32:25] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-26 09:32:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 09:32:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-26 09:32:25] [INFO ] [Nat]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 09:32:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 09:32:25] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-26 09:32:25] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-26 09:32:25] [INFO ] Added : 37 causal constraints over 8 iterations in 153 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 62 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 : 62/62 places, 45/45 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 0 with 8 rules applied. Total rules applied 8 place count 62 transition count 37
Reduce places removed 14 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 26 rules applied. Total rules applied 34 place count 48 transition count 25
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 47 place count 36 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 35 transition count 24
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 48 place count 35 transition count 19
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 60 place count 28 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 60 place count 28 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 62 place count 27 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 9 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 77 place count 18 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 4 rules applied. Total rules applied 81 place count 17 transition count 9
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 84 place count 14 transition count 9
Applied a total of 84 rules in 21 ms. Remains 14 /62 variables (removed 48) and now considering 9/45 (removed 36) transitions.
// Phase 1: matrix 9 rows 14 cols
[2024-05-26 09:32:25] [INFO ] Computed 6 invariants in 1 ms
[2024-05-26 09:32:25] [INFO ] Implicit Places using invariants in 40 ms returned [2, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/62 places, 9/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66 ms. Remains : 12/62 places, 9/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 p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 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 50 ms :[(NOT p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 139 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 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
// Phase 1: matrix 9 rows 12 cols
[2024-05-26 09:32:26] [INFO ] Computed 4 invariants in 1 ms
[2024-05-26 09:32:26] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-26 09:32:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 09:32:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-26 09:32:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 09:32:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-26 09:32:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 09:32:26] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-26 09:32:26] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 09:32:26] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Product exploration explored 100000 steps with 5428 reset in 138 ms.
Stack based approach found an accepted trace after 59 steps with 2 reset with depth 26 and stack size 26 in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-02 finished in 2551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||((p1 U (p2||G(p1))) U ((p0&&(p1 U (p2||G(p1))))||G((p1 U (p2||G(p1)))))))))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 64 transition count 45
Applied a total of 8 rules in 6 ms. Remains 64 /72 variables (removed 8) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2024-05-26 09:32:26] [INFO ] Computed 20 invariants in 1 ms
[2024-05-26 09:32:26] [INFO ] Implicit Places using invariants in 78 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/72 places, 45/45 transitions.
Applied a total of 0 rules in 5 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 92 ms. Remains : 63/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 402 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p0 p2), acceptance={} source=6 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(GT 2 s21), p2:(AND (GT s9 s14) (LEQ s60 s21)), p1:(LEQ s60 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9636 steps with 0 reset in 55 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-03 finished in 587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 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 64 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 51 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 42 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 45 place count 40 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 45 place count 40 transition count 19
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 19 rules applied. Total rules applied 64 place count 29 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 64 place count 29 transition count 17
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 68 place count 27 transition count 17
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 10 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 84 place count 17 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 16 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 16 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 15 transition count 10
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 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 95 place count 10 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 5 with 2 rules applied. Total rules applied 97 place count 9 transition count 6
Applied a total of 97 rules in 22 ms. Remains 9 /72 variables (removed 63) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-05-26 09:32:27] [INFO ] Computed 4 invariants in 0 ms
[2024-05-26 09:32:27] [INFO ] Implicit Places using invariants in 33 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/72 places, 6/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57 ms. Remains : 8/72 places, 6/45 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 3 s1), p0:(LEQ s6 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10770 reset in 240 ms.
Stack based approach found an accepted trace after 88 steps with 11 reset with depth 10 and stack size 10 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-06 finished in 426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p1))&&F(G(p2)))))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 64 transition count 45
Applied a total of 8 rules in 6 ms. Remains 64 /72 variables (removed 8) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2024-05-26 09:32:27] [INFO ] Computed 20 invariants in 1 ms
[2024-05-26 09:32:27] [INFO ] Implicit Places using invariants in 106 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/72 places, 45/45 transitions.
Applied a total of 0 rules in 4 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 121 ms. Remains : 63/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s50 s33), p1:(LEQ s60 s50), p2:(LEQ 2 s16)], 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 2 reset in 220 ms.
Stack based approach found an accepted trace after 224 steps with 0 reset with depth 225 and stack size 225 in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-07 finished in 670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((p1||G(F(p0))))))'
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 66 transition count 41
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 60 transition count 37
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 20 place count 56 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 21 place count 55 transition count 36
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 21 place count 55 transition count 22
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 35 rules applied. Total rules applied 56 place count 34 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 56 place count 34 transition count 19
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 62 place count 31 transition count 19
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 88 place count 14 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 90 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 91 place count 12 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 12 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 94 place count 10 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 94 place count 10 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 97 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 100 place count 6 transition count 6
Applied a total of 100 rules in 18 ms. Remains 6 /72 variables (removed 66) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-26 09:32:28] [INFO ] Computed 1 invariants in 0 ms
[2024-05-26 09:32:28] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-26 09:32:28] [INFO ] Invariant cache hit.
[2024-05-26 09:32:28] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-26 09:32:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-26 09:32:28] [INFO ] Invariant cache hit.
[2024-05-26 09:32:28] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/72 places, 6/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 6/72 places, 6/45 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-09 automaton TGBA Formula[mat=[[{ 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={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s2 s4), p1:(GT 3 s1)], 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 50000 reset in 73 ms.
Product exploration explored 100000 steps with 50000 reset in 87 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 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-09 finished in 523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 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 64 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 51 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 42 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 40 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 39 transition count 26
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 47 place count 39 transition count 20
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 62 place count 30 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 62 place count 30 transition count 18
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 66 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 11 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 84 place count 17 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 86 place count 16 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 87 place count 15 transition count 10
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 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 95 place count 10 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 96 place count 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 97 place count 9 transition count 6
Applied a total of 97 rules in 12 ms. Remains 9 /72 variables (removed 63) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-05-26 09:32:28] [INFO ] Computed 4 invariants in 1 ms
[2024-05-26 09:32:28] [INFO ] Implicit Places using invariants in 29 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/72 places, 6/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43 ms. Remains : 7/72 places, 6/45 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s1 s6), p0:(LEQ 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 476 reset in 138 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-10 finished in 299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(G(p1))))))'
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 64 transition count 45
Applied a total of 8 rules in 2 ms. Remains 64 /72 variables (removed 8) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2024-05-26 09:32:29] [INFO ] Computed 20 invariants in 1 ms
[2024-05-26 09:32:29] [INFO ] Implicit Places using invariants in 69 ms returned [14, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/72 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 74 ms. Remains : 62/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(LEQ 2 s43), p1:(LEQ s15 s17)], 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, null, null][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-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-11 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 64 transition count 45
Applied a total of 8 rules in 2 ms. Remains 64 /72 variables (removed 8) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2024-05-26 09:32:29] [INFO ] Computed 20 invariants in 1 ms
[2024-05-26 09:32:29] [INFO ] Implicit Places using invariants in 78 ms returned [15, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 81 ms to find 2 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 62/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT 2 s59), p0:(GT 2 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Product exploration explored 100000 steps with 50000 reset in 222 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-12 finished in 685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 3 places :
Implicit places reduction removed 3 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 12 rules applied. Total rules applied 12 place count 64 transition count 36
Reduce places removed 15 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 26 rules applied. Total rules applied 38 place count 49 transition count 25
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 49 place count 38 transition count 25
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 49 place count 38 transition count 17
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 3 with 21 rules applied. Total rules applied 70 place count 25 transition count 17
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 25 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 72 place count 24 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 72 place count 24 transition count 14
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 76 place count 22 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 10 places and 0 transitions.
Iterating global reduction 5 with 17 rules applied. Total rules applied 93 place count 12 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 95 place count 11 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 96 place count 10 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 96 place count 10 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 99 place count 8 transition count 5
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 1 rules applied. Total rules applied 100 place count 8 transition count 4
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 8 with 3 rules applied. Total rules applied 103 place count 6 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 105 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 105 place count 4 transition count 2
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 10 with 3 rules applied. Total rules applied 108 place count 2 transition count 2
Applied a total of 108 rules in 10 ms. Remains 2 /72 variables (removed 70) and now considering 2/45 (removed 43) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-26 09:32:30] [INFO ] Computed 1 invariants in 0 ms
[2024-05-26 09:32:30] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-26 09:32:30] [INFO ] Invariant cache hit.
[2024-05-26 09:32:30] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-26 09:32:30] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-26 09:32:30] [INFO ] Invariant cache hit.
[2024-05-26 09:32:30] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/72 places, 2/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 2/72 places, 2/45 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s0)], 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 87 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-15 finished in 249 ms.
All properties solved by simple procedures.
Total runtime 17746 ms.

BK_STOP 1716715951338

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r219-smll-171649598200232"
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 ;