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.r500-smll-171649588100388.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 ltsminxred
Input is IOTPpurchase-PT-C12M10P15D17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649588100388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.2K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K 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 68K 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-C12M10P15D17-LTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717287088657

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C12M10P15D17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 00:11:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 00:11:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 00:11:31] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-06-02 00:11:31] [INFO ] Transformed 111 places.
[2024-06-02 00:11:31] [INFO ] Transformed 45 transitions.
[2024-06-02 00:11:31] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 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 16 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 90 transition count 45
Applied a total of 21 rules in 52 ms. Remains 90 /111 variables (removed 21) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 90 cols
[2024-06-02 00:11:31] [INFO ] Computed 46 invariants in 26 ms
[2024-06-02 00:11:32] [INFO ] Implicit Places using invariants in 412 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 481 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/111 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 579 ms. Remains : 89/111 places, 45/45 transitions.
Support contains 60 out of 89 places after structural reductions.
[2024-06-02 00:11:32] [INFO ] Flatten gal took : 51 ms
[2024-06-02 00:11:32] [INFO ] Flatten gal took : 23 ms
[2024-06-02 00:11:32] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 52 out of 89 places (down from 60) after GAL structural reductions.
RANDOM walk for 1368 steps (0 resets) in 280 ms. (4 steps per ms) remains 0/22 properties
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U G(p1)))'
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 67 transition count 41
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 16 place count 61 transition count 37
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 57 transition count 37
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 20 place count 57 transition count 24
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 52 place count 38 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 52 place count 38 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 58 place count 35 transition count 21
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 79 place count 22 transition count 13
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 81 place count 20 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 81 place count 20 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 86 place count 17 transition count 11
Drop transitions (Trivial Post-Agglo cleanup.) 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 87 place count 17 transition count 10
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 90 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 91 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 93 place count 13 transition count 8
Applied a total of 93 rules in 55 ms. Remains 13 /89 variables (removed 76) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 13 cols
[2024-06-02 00:11:33] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 00:11:33] [INFO ] Implicit Places using invariants in 68 ms returned [1, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/89 places, 8/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 11 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 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 9 transition count 5
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 8 transition count 5
Applied a total of 6 rules in 6 ms. Remains 8 /11 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 8 cols
[2024-06-02 00:11:33] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 00:11:33] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 00:11:33] [INFO ] Invariant cache hit.
[2024-06-02 00:11:33] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/89 places, 5/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 8/89 places, 5/45 transitions.
Stuttering acceptance computed with spot in 363 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 704 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-00 finished in 1406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 45/45 transitions.
Ensure Unique test removed 17 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 69 transition count 45
Applied a total of 20 rules in 6 ms. Remains 69 /89 variables (removed 20) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 69 cols
[2024-06-02 00:11:34] [INFO ] Computed 25 invariants in 1 ms
[2024-06-02 00:11:34] [INFO ] Implicit Places using invariants in 89 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 92 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/89 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 66/89 places, 45/45 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-01
Entered a terminal (fully accepting) state of product in 285 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-01 finished in 202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 45/45 transitions.
Ensure Unique test removed 17 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 69 transition count 45
Applied a total of 20 rules in 6 ms. Remains 69 /89 variables (removed 20) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 69 cols
[2024-06-02 00:11:35] [INFO ] Computed 25 invariants in 1 ms
[2024-06-02 00:11:35] [INFO ] Implicit Places using invariants in 93 ms returned [9, 16, 24]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 95 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/89 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 66/89 places, 45/45 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-02
Entered a terminal (fully accepting) state of product in 108 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-02 finished in 201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 66 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 28 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 36 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 37 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 37 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 63 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 63 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 67 place count 29 transition count 18
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 87 place count 17 transition count 10
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 90 place count 15 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 14 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 91 place count 14 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 94 place count 12 transition count 8
Drop transitions (Trivial Post-Agglo cleanup.) 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 95 place count 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 98 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 100 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 101 place count 8 transition count 5
Applied a total of 101 rules in 12 ms. Remains 8 /89 variables (removed 81) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 8 cols
[2024-06-02 00:11:35] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 00:11:35] [INFO ] Implicit Places using invariants in 31 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/89 places, 5/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 6 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 2 transition count 2
Applied a total of 7 rules in 3 ms. Remains 2 /6 variables (removed 4) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-02 00:11:35] [INFO ] Computed 1 invariants in 0 ms
[2024-06-02 00:11:35] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-02 00:11:35] [INFO ] Invariant cache hit.
[2024-06-02 00:11:35] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/89 places, 2/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 2/89 places, 2/45 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Product exploration explored 100000 steps with 50000 reset in 217 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 22 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-C12M10P15D17-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-03 finished in 574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 67 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 56 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 49 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 48 transition count 30
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 36 place count 48 transition count 21
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 23 rules applied. Total rules applied 59 place count 34 transition count 21
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 61 place count 33 transition count 20
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 64 place count 31 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 65 place count 30 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 65 place count 30 transition count 18
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 67 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 7 with 14 rules applied. Total rules applied 81 place count 21 transition count 12
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 83 place count 20 transition count 11
Applied a total of 83 rules in 24 ms. Remains 20 /89 variables (removed 69) and now considering 11/45 (removed 34) transitions.
// Phase 1: matrix 11 rows 20 cols
[2024-06-02 00:11:35] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 00:11:35] [INFO ] Implicit Places using invariants in 75 ms returned [1, 4, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 77 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/89 places, 11/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 17 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 15 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 15 transition count 8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 13 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 12 transition count 8
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 3 with 8 rules applied. Total rules applied 16 place count 7 transition count 5
Applied a total of 16 rules in 7 ms. Remains 7 /17 variables (removed 10) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-06-02 00:11:35] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 00:11:36] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-02 00:11:36] [INFO ] Invariant cache hit.
[2024-06-02 00:11:36] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/89 places, 5/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 7/89 places, 5/45 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-04
Product exploration explored 100000 steps with 11954 reset in 291 ms.
Product exploration explored 100000 steps with 11942 reset in 166 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-02 00:11:37] [INFO ] Invariant cache hit.
[2024-06-02 00:11:37] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-02 00:11:37] [INFO ] Invariant cache hit.
[2024-06-02 00:11:37] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-02 00:11:37] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-02 00:11:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 221ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 7/7 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11896 reset in 141 ms.
Product exploration explored 100000 steps with 11894 reset in 144 ms.
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-02 00:11:38] [INFO ] Invariant cache hit.
[2024-06-02 00:11:38] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 00:11:38] [INFO ] Invariant cache hit.
[2024-06-02 00:11:38] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-06-02 00:11:38] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-02 00:11:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 172ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 7/7 places, 5/5 transitions.
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-04 finished in 2850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 66 transition count 40
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 15 rules applied. Total rules applied 23 place count 57 transition count 34
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 30 place count 51 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 50 transition count 33
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 31 place count 50 transition count 24
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 23 rules applied. Total rules applied 54 place count 36 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 54 place count 36 transition count 22
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 58 place count 34 transition count 22
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 75 place count 24 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 76 place count 24 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 77 place count 23 transition count 14
Applied a total of 77 rules in 18 ms. Remains 23 /89 variables (removed 66) and now considering 14/45 (removed 31) transitions.
// Phase 1: matrix 14 rows 23 cols
[2024-06-02 00:11:38] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 00:11:38] [INFO ] Implicit Places using invariants in 70 ms returned [3, 4, 8, 10]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 71 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/89 places, 14/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 19 transition count 12
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 17 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 16 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 16 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 9 place count 14 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 10 place count 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 10 place count 13 transition count 9
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 12 place count 12 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
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 15 place count 10 transition count 8
Applied a total of 15 rules in 5 ms. Remains 10 /19 variables (removed 9) and now considering 8/14 (removed 6) transitions.
// Phase 1: matrix 8 rows 10 cols
[2024-06-02 00:11:38] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 00:11:38] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 00:11:38] [INFO ] Invariant cache hit.
[2024-06-02 00:11:38] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/89 places, 8/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 163 ms. Remains : 10/89 places, 8/45 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-05
Product exploration explored 100000 steps with 6 reset in 210 ms.
Stack based approach found an accepted trace after 67 steps with 3 reset with depth 52 and stack size 52 in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-05 finished in 553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!p1&&X(!p2))))'
Support contains 9 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 45/45 transitions.
Ensure Unique test removed 17 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 69 transition count 45
Applied a total of 20 rules in 6 ms. Remains 69 /89 variables (removed 20) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 69 cols
[2024-06-02 00:11:39] [INFO ] Computed 25 invariants in 2 ms
[2024-06-02 00:11:39] [INFO ] Implicit Places using invariants in 106 ms returned [16, 17, 24]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 107 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/89 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 66/89 places, 45/45 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (OR p2 p1), p2, p2]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0 p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 28 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-07 finished in 803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p0))'
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 66 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 55 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 47 transition count 30
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 37 place count 47 transition count 19
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 65 place count 30 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 65 place count 30 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 27 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 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 89 place count 16 transition count 9
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 14 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 91 place count 14 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 96 place count 11 transition count 7
Drop transitions (Trivial Post-Agglo cleanup.) 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 97 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 100 place count 9 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 102 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 102 place count 7 transition count 4
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 104 place count 6 transition count 4
Applied a total of 104 rules in 10 ms. Remains 6 /89 variables (removed 83) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-06-02 00:11:40] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 00:11:40] [INFO ] Implicit Places using invariants in 31 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/89 places, 4/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 2 transition count 2
Applied a total of 5 rules in 2 ms. Remains 2 /5 variables (removed 3) and now considering 2/4 (removed 2) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-02 00:11:40] [INFO ] Computed 1 invariants in 0 ms
[2024-06-02 00:11:40] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-02 00:11:40] [INFO ] Invariant cache hit.
[2024-06-02 00:11:40] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/89 places, 2/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 2/89 places, 2/45 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-08
Product exploration explored 100000 steps with 2556 reset in 90 ms.
Product exploration explored 100000 steps with 2727 reset in 83 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))]
Knowledge based reduction with 2 factoid took 259 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
[2024-06-02 00:11:41] [INFO ] Invariant cache hit.
[2024-06-02 00:11:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-02 00:11:41] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-02 00:11:41] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-02 00:11:41] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-06-02 00:11:41] [INFO ] Invariant cache hit.
[2024-06-02 00:11:41] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-02 00:11:41] [INFO ] Invariant cache hit.
[2024-06-02 00:11:41] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-06-02 00:11:41] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-02 00:11:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 2/2 places, 2/2 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
[2024-06-02 00:11:42] [INFO ] Invariant cache hit.
[2024-06-02 00:11:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-02 00:11:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-02 00:11:42] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-02 00:11:42] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2659 reset in 70 ms.
Product exploration explored 100000 steps with 3032 reset in 83 ms.
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-06-02 00:11:42] [INFO ] Invariant cache hit.
[2024-06-02 00:11:42] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 00:11:42] [INFO ] Invariant cache hit.
[2024-06-02 00:11:42] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-06-02 00:11:42] [INFO ] Redundant transitions in 1 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-02 00:11:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 79ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 2/2 places, 2/2 transitions.
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-08 finished in 2569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(!p1)))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 67 transition count 41
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 62 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 61 transition count 40
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 13 place count 61 transition count 26
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 47 place count 41 transition count 26
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 47 place count 41 transition count 23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 53 place count 38 transition count 23
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 76 place count 24 transition count 14
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 22 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 78 place count 22 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 83 place count 19 transition count 12
Drop transitions (Trivial Post-Agglo cleanup.) 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 84 place count 19 transition count 11
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 87 place count 17 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 88 place count 16 transition count 10
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 90 place count 15 transition count 9
Applied a total of 90 rules in 21 ms. Remains 15 /89 variables (removed 74) and now considering 9/45 (removed 36) transitions.
// Phase 1: matrix 9 rows 15 cols
[2024-06-02 00:11:42] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 00:11:42] [INFO ] Implicit Places using invariants in 51 ms returned [2, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/89 places, 9/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 13 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 11 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 9 transition count 6
Applied a total of 7 rules in 3 ms. Remains 9 /13 variables (removed 4) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-06-02 00:11:42] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 00:11:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 00:11:42] [INFO ] Invariant cache hit.
[2024-06-02 00:11:42] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/89 places, 6/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 145 ms. Remains : 9/89 places, 6/45 transitions.
Stuttering acceptance computed with spot in 105 ms :[p1, (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-09
Product exploration explored 100000 steps with 8233 reset in 141 ms.
Stack based approach found an accepted trace after 149 steps with 11 reset with depth 12 and stack size 12 in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-09 finished in 413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(F(p1)&&X(G(p2)))))))'
Support contains 10 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 72 transition count 39
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 15 rules applied. Total rules applied 23 place count 63 transition count 33
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 29 place count 57 transition count 33
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 29 place count 57 transition count 23
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 54 place count 42 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 54 place count 42 transition count 21
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 58 place count 40 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 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 76 place count 29 transition count 14
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 27 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 78 place count 27 transition count 12
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 82 place count 25 transition count 12
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 4 with 5 rules applied. Total rules applied 87 place count 22 transition count 10
Applied a total of 87 rules in 13 ms. Remains 22 /89 variables (removed 67) and now considering 10/45 (removed 35) transitions.
// Phase 1: matrix 10 rows 22 cols
[2024-06-02 00:11:43] [INFO ] Computed 13 invariants in 1 ms
[2024-06-02 00:11:43] [INFO ] Implicit Places using invariants in 59 ms returned [2, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/89 places, 10/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 20 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 18 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 17 transition count 7
Applied a total of 6 rules in 3 ms. Remains 17 /20 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 17 cols
[2024-06-02 00:11:43] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 00:11:43] [INFO ] Implicit Places using invariants in 44 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/89 places, 7/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 126 ms. Remains : 16/89 places, 7/45 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 370 ms.
Stack based approach found an accepted trace after 43 steps with 3 reset with depth 14 and stack size 14 in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-10 finished in 693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(F(p2)&&(p0 U (p1||G(p0)))))))'
Support contains 13 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 45/45 transitions.
Ensure Unique test removed 12 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 74 transition count 39
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 15 rules applied. Total rules applied 24 place count 65 transition count 33
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 59 transition count 33
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 30 place count 59 transition count 23
Deduced a syphon composed of 10 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 55 place count 44 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 55 place count 44 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 41 transition count 20
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 78 place count 31 transition count 13
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 30 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 79 place count 30 transition count 12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 82 place count 28 transition count 12
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 4 with 2 rules applied. Total rules applied 84 place count 27 transition count 11
Applied a total of 84 rules in 18 ms. Remains 27 /89 variables (removed 62) and now considering 11/45 (removed 34) transitions.
// Phase 1: matrix 11 rows 27 cols
[2024-06-02 00:11:43] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 00:11:43] [INFO ] Implicit Places using invariants in 58 ms returned [2, 9, 10, 15, 22]
[2024-06-02 00:11:43] [INFO ] Actually due to overlaps returned [15, 2, 9, 22]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 61 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/89 places, 11/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 23 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 21 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
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 19 transition count 8
Applied a total of 7 rules in 4 ms. Remains 19 /23 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 19 cols
[2024-06-02 00:11:43] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 00:11:43] [INFO ] Implicit Places using invariants in 35 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/89 places, 8/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 122 ms. Remains : 18/89 places, 8/45 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Product exploration explored 100000 steps with 50000 reset in 249 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 p2) p0 p1), (X p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 28 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-12 finished in 879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 45/45 transitions.
Ensure Unique test removed 17 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 69 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 58 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 50 transition count 30
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 37 place count 50 transition count 19
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 65 place count 33 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 65 place count 33 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 30 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 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 89 place count 19 transition count 9
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 17 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 91 place count 17 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 96 place count 14 transition count 7
Drop transitions (Trivial Post-Agglo cleanup.) 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 97 place count 14 transition count 6
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 100 place count 12 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 102 place count 10 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 102 place count 10 transition count 4
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 104 place count 9 transition count 4
Applied a total of 104 rules in 7 ms. Remains 9 /89 variables (removed 80) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 9 cols
[2024-06-02 00:11:44] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 00:11:44] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 00:11:44] [INFO ] Invariant cache hit.
[2024-06-02 00:11:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 00:11:44] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-06-02 00:11:44] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-02 00:11:44] [INFO ] Invariant cache hit.
[2024-06-02 00:11:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2/9 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/13 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 16 constraints, problems are : Problem set: 0 solved, 3 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2/9 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/13 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 19 constraints, problems are : Problem set: 0 solved, 3 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 172ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 172ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/89 places, 4/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 9/89 places, 4/45 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 150 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-13 finished in 475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F(p1))))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 45/45 transitions.
Ensure Unique test removed 17 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 69 transition count 45
Applied a total of 20 rules in 5 ms. Remains 69 /89 variables (removed 20) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 69 cols
[2024-06-02 00:11:45] [INFO ] Computed 25 invariants in 2 ms
[2024-06-02 00:11:45] [INFO ] Implicit Places using invariants in 109 ms returned [10, 18, 19, 24]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 111 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/89 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 65/89 places, 45/45 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-15
Product exploration explored 100000 steps with 2161 reset in 200 ms.
Product exploration explored 100000 steps with 2189 reset in 234 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) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 234 steps (0 resets) in 13 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 45 rows 65 cols
[2024-06-02 00:11:46] [INFO ] Computed 21 invariants in 1 ms
[2024-06-02 00:11:46] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-06-02 00:11:46] [INFO ] [Real]Absence check using 16 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 00:11:46] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 00:11:46] [INFO ] Computed and/alt/rep : 44/48/44 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-02 00:11:46] [INFO ] Added : 11 causal constraints over 3 iterations in 59 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 65 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 : 65/65 places, 45/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 65 transition count 37
Reduce places removed 13 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 21 rules applied. Total rules applied 29 place count 52 transition count 29
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 38 place count 44 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 43 transition count 28
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 39 place count 43 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 63 place count 29 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 63 place count 29 transition count 15
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 69 place count 26 transition count 15
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 84 place count 17 transition count 9
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 9
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 8
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 88 place count 14 transition count 8
Drop transitions (Trivial Post-Agglo cleanup.) 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 89 place count 14 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 6 with 3 rules applied. Total rules applied 92 place count 12 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 93 place count 11 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 8 with 2 rules applied. Total rules applied 95 place count 10 transition count 5
Applied a total of 95 rules in 17 ms. Remains 10 /65 variables (removed 55) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 10 cols
[2024-06-02 00:11:46] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 00:11:46] [INFO ] Implicit Places using invariants in 36 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/65 places, 5/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56 ms. Remains : 9/65 places, 5/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 p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 5 rows 9 cols
[2024-06-02 00:11:47] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 00:11:47] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-06-02 00:11:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-02 00:11:47] [INFO ] Computed and/alt/rep : 4/7/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-02 00:11:47] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7675 reset in 115 ms.
Product exploration explored 100000 steps with 7457 reset in 140 ms.
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 5/5 transitions.
Ensure Unique test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5 transition count 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 2 with 3 rules applied. Total rules applied 5 place count 3 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 2 transition count 2
Applied a total of 7 rules in 3 ms. Remains 2 /9 variables (removed 7) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-02 00:11:47] [INFO ] Computed 1 invariants in 1 ms
[2024-06-02 00:11:47] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-02 00:11:47] [INFO ] Invariant cache hit.
[2024-06-02 00:11:47] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-02 00:11:47] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-02 00:11:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 74ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/9 places, 2/5 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 2/9 places, 2/5 transitions.
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-15 finished in 2981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F(p1))))))'
Found a Shortening insensitive property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-15
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 45/45 transitions.
Ensure Unique test removed 17 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 69 transition count 39
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 14 rules applied. Total rules applied 23 place count 60 transition count 34
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 29 place count 55 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 54 transition count 33
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 30 place count 54 transition count 22
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 59 place count 36 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 59 place count 36 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 65 place count 33 transition count 19
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 67 place count 32 transition count 18
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 70 place count 30 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 71 place count 29 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 8 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 85 place count 21 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 86 place count 20 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 86 place count 20 transition count 10
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 89 place count 18 transition count 10
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 90 place count 18 transition count 9
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 93 place count 16 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 94 place count 15 transition count 8
Applied a total of 94 rules in 8 ms. Remains 15 /89 variables (removed 74) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 15 cols
[2024-06-02 00:11:49] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 00:11:49] [INFO ] Implicit Places using invariants in 45 ms returned [2, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/89 places, 8/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 13 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 11 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 10 transition count 5
Applied a total of 6 rules in 2 ms. Remains 10 /13 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 10 cols
[2024-06-02 00:11:49] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 00:11:49] [INFO ] Implicit Places using invariants in 30 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 9/89 places, 5/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 88 ms. Remains : 9/89 places, 5/45 transitions.
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLFireability-15
Product exploration explored 100000 steps with 4218 reset in 125 ms.
Product exploration explored 100000 steps with 4108 reset in 141 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) p0), (X p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 5 rows 9 cols
[2024-06-02 00:11:50] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 00:11:50] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-02 00:11:50] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-02 00:11:50] [INFO ] Computed and/alt/rep : 4/7/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-02 00:11:50] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 9 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 : 9/9 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-02 00:11:50] [INFO ] Invariant cache hit.
[2024-06-02 00:11:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 00:11:50] [INFO ] Invariant cache hit.
[2024-06-02 00:11:50] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-06-02 00:11:50] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-02 00:11:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/14 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/14 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 18 constraints, problems are : Problem set: 0 solved, 4 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 175ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 176ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 9/9 places, 5/5 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 p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 255 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
[2024-06-02 00:11:51] [INFO ] Invariant cache hit.
[2024-06-02 00:11:51] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-02 00:11:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-02 00:11:51] [INFO ] Computed and/alt/rep : 4/7/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-02 00:11:51] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7747 reset in 121 ms.
Product exploration explored 100000 steps with 7692 reset in 140 ms.
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 5/5 transitions.
Ensure Unique test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5 transition count 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 2 with 3 rules applied. Total rules applied 5 place count 3 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 2 transition count 2
Applied a total of 7 rules in 2 ms. Remains 2 /9 variables (removed 7) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-02 00:11:51] [INFO ] Computed 1 invariants in 0 ms
[2024-06-02 00:11:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-02 00:11:51] [INFO ] Invariant cache hit.
[2024-06-02 00:11:51] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-02 00:11:51] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-02 00:11:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 71ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/9 places, 2/5 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 2/9 places, 2/5 transitions.
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLFireability-15 finished in 3172 ms.
[2024-06-02 00:11:51] [INFO ] Flatten gal took : 11 ms
[2024-06-02 00:11:51] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-02 00:11:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 89 places, 45 transitions and 180 arcs took 4 ms.
Total runtime 20761 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : IOTPpurchase-PT-C12M10P15D17-LTLFireability-04
Could not compute solution for formula : IOTPpurchase-PT-C12M10P15D17-LTLFireability-08
Could not compute solution for formula : IOTPpurchase-PT-C12M10P15D17-LTLFireability-15

BK_STOP 1717287165113

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name IOTPpurchase-PT-C12M10P15D17-LTLFireability-04
ltl formula formula --ltl=/tmp/1400/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 45 transitions and 180 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 91 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 90, there are 50 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~213 levels ~10000 states ~18296 transitions
pnml2lts-mc( 3/ 4): ~213 levels ~20000 states ~37580 transitions
pnml2lts-mc( 0/ 4): ~215 levels ~40000 states ~75296 transitions
pnml2lts-mc( 0/ 4): ~215 levels ~80000 states ~148460 transitions
pnml2lts-mc( 0/ 4): ~215 levels ~160000 states ~315752 transitions
pnml2lts-mc( 2/ 4): ~2284 levels ~320000 states ~616168 transitions
pnml2lts-mc( 2/ 4): ~2284 levels ~640000 states ~1316772 transitions
pnml2lts-mc( 2/ 4): ~2284 levels ~1280000 states ~2722960 transitions
pnml2lts-mc( 2/ 4): ~2284 levels ~2560000 states ~5533396 transitions
pnml2lts-mc( 2/ 4): ~2284 levels ~5120000 states ~11754012 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6788435
pnml2lts-mc( 0/ 4): unique states count: 6844574
pnml2lts-mc( 0/ 4): unique transitions count: 17202252
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 10240519
pnml2lts-mc( 0/ 4): - claim found count: 96542
pnml2lts-mc( 0/ 4): - claim success count: 6895837
pnml2lts-mc( 0/ 4): - cum. max stack depth: 56338
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6895837 states 17489687 transitions, fanout: 2.536
pnml2lts-mc( 0/ 4): Total exploration time 15.650 sec (15.640 sec minimum, 15.648 sec on average)
pnml2lts-mc( 0/ 4): States per second: 440629, Transitions per second: 1117552
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 117.2MB, 17.6 B/state, compr.: 4.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 45 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 117.2MB (~256.0MB paged-in)
ltl formula name IOTPpurchase-PT-C12M10P15D17-LTLFireability-08
ltl formula formula --ltl=/tmp/1400/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 45 transitions and 180 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 91 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 90, there are 50 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~527 levels ~10000 states ~22448 transitions
pnml2lts-mc( 3/ 4): ~527 levels ~20000 states ~51576 transitions
pnml2lts-mc( 3/ 4): ~527 levels ~40000 states ~111876 transitions
pnml2lts-mc( 1/ 4): ~525 levels ~80000 states ~202252 transitions
pnml2lts-mc( 1/ 4): ~525 levels ~160000 states ~431808 transitions
pnml2lts-mc( 1/ 4): ~525 levels ~320000 states ~893912 transitions
pnml2lts-mc( 1/ 4): ~525 levels ~640000 states ~1823392 transitions
pnml2lts-mc( 1/ 4): ~525 levels ~1280000 states ~3914916 transitions
pnml2lts-mc( 1/ 4): ~525 levels ~2560000 states ~7989208 transitions
pnml2lts-mc( 0/ 4): ~482 levels ~5120000 states ~17293092 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6613617
pnml2lts-mc( 0/ 4): unique states count: 6615241
pnml2lts-mc( 0/ 4): unique transitions count: 21687769
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 20470661
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 7987371
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2016
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7987371 states 29698717 transitions, fanout: 3.718
pnml2lts-mc( 0/ 4): Total exploration time 19.740 sec (19.730 sec minimum, 19.737 sec on average)
pnml2lts-mc( 0/ 4): States per second: 404629, Transitions per second: 1504494
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 114.5MB, 18.1 B/state, compr.: 5.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 19.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 45 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 114.5MB (~256.0MB paged-in)
ltl formula name IOTPpurchase-PT-C12M10P15D17-LTLFireability-15
ltl formula formula --ltl=/tmp/1400/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 45 transitions and 180 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1400/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1400/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1400/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1400/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 91 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 90, there are 53 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~116 levels ~10000 states ~20844 transitions
pnml2lts-mc( 3/ 4): ~116 levels ~20000 states ~44212 transitions
pnml2lts-mc( 3/ 4): ~116 levels ~40000 states ~94244 transitions
pnml2lts-mc( 2/ 4): ~565 levels ~80000 states ~201704 transitions
pnml2lts-mc( 2/ 4): ~565 levels ~160000 states ~431072 transitions
pnml2lts-mc( 2/ 4): ~565 levels ~320000 states ~868772 transitions
pnml2lts-mc( 2/ 4): ~565 levels ~640000 states ~1863052 transitions
pnml2lts-mc( 2/ 4): ~565 levels ~1280000 states ~3905728 transitions
pnml2lts-mc( 2/ 4): ~565 levels ~2560000 states ~8001408 transitions
pnml2lts-mc( 2/ 4): ~565 levels ~5120000 states ~16460204 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4791273
pnml2lts-mc( 0/ 4): unique states count: 5764449
pnml2lts-mc( 0/ 4): unique transitions count: 23813856
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 13231416
pnml2lts-mc( 0/ 4): - claim found count: 2482380
pnml2lts-mc( 0/ 4): - claim success count: 5764918
pnml2lts-mc( 0/ 4): - cum. max stack depth: 972704
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5764918 states 23815539 transitions, fanout: 4.131
pnml2lts-mc( 0/ 4): Total exploration time 16.380 sec (16.360 sec minimum, 16.372 sec on average)
pnml2lts-mc( 0/ 4): States per second: 351949, Transitions per second: 1453940
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 121.7MB, 16.9 B/state, compr.: 4.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 45 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 121.7MB (~256.0MB paged-in)

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-C12M10P15D17"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is IOTPpurchase-PT-C12M10P15D17, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r500-smll-171649588100388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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