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-171649588000364.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-C01M01P01D01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649588000364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.1K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 63K 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-C01M01P01D01-LTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717286753072

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-C01M01P01D01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 00:05:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 00:05:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 00:05:55] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-02 00:05:55] [INFO ] Transformed 111 places.
[2024-06-02 00:05:55] [INFO ] Transformed 45 transitions.
[2024-06-02 00:05:55] [INFO ] Found NUPN structural information;
[2024-06-02 00:05:55] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 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 25 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 81 transition count 45
Applied a total of 30 rules in 120 ms. Remains 81 /111 variables (removed 30) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 81 cols
[2024-06-02 00:05:55] [INFO ] Computed 37 invariants in 19 ms
[2024-06-02 00:05:55] [INFO ] Implicit Places using invariants in 450 ms returned [14, 31, 38, 44, 45, 48, 50]
[2024-06-02 00:05:55] [INFO ] Actually due to overlaps returned [31, 14, 38, 44, 45, 48]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 508 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/111 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 657 ms. Remains : 75/111 places, 45/45 transitions.
Support contains 51 out of 75 places after structural reductions.
[2024-06-02 00:05:56] [INFO ] Flatten gal took : 33 ms
[2024-06-02 00:05:56] [INFO ] Flatten gal took : 17 ms
[2024-06-02 00:05:56] [INFO ] Input system was already deterministic with 45 transitions.
Reduction of identical properties reduced properties to check from 31 to 27
RANDOM walk for 171 steps (0 resets) in 94 ms. (1 steps per ms) remains 0/27 properties
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-11 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' '!(X((p0&&X(F(p1))&&F((!p2 U (p3||G(!p2)))))))'
Support contains 7 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 64 transition count 45
Applied a total of 11 rules in 5 ms. Remains 64 /75 variables (removed 11) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2024-06-02 00:05:56] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 00:05:56] [INFO ] Implicit Places using invariants in 123 ms returned [10, 17, 18, 28, 29, 30, 31, 32, 33, 35]
[2024-06-02 00:05:56] [INFO ] Actually due to overlaps returned [10, 17, 18, 28, 30, 31, 33, 35]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 140 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/75 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 56/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 419 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), true, (NOT p1), (AND (NOT p3) p2)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 436 ms.
Product exploration explored 100000 steps with 33333 reset in 189 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p3 p1 (NOT p2)), (X p0), (X p3), (X (NOT (AND p0 (NOT p3)))), (X (X (NOT p2))), (X (X p3)), (X (X p1)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 22 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-00 finished in 1324 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 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 11 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 61 transition count 30
Reduce places removed 17 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 21 rules applied. Total rules applied 39 place count 44 transition count 26
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 40 transition count 26
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 43 place count 40 transition count 17
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 67 place count 25 transition count 17
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 3 with 1 rules applied. Total rules applied 68 place count 25 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 24 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 69 place count 24 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 77 place count 20 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 78 place count 19 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 78 place count 19 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 80 place count 18 transition count 11
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 6 with 14 rules applied. Total rules applied 94 place count 10 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 97 place count 8 transition count 4
Applied a total of 97 rules in 33 ms. Remains 8 /75 variables (removed 67) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 8 cols
[2024-06-02 00:05:58] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 00:05:58] [INFO ] Implicit Places using invariants in 38 ms returned [2, 4, 5]
[2024-06-02 00:05:58] [INFO ] Actually due to overlaps returned [2, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/75 places, 4/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 81 ms. Remains : 6/75 places, 4/45 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 327 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-01 finished in 473 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)||G(p1))))'
Support contains 7 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 64 transition count 32
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 49 transition count 29
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 46 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 45 transition count 28
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 39 place count 45 transition count 20
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 59 place count 33 transition count 20
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 60 place count 33 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 61 place count 32 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 61 place count 32 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 65 place count 30 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 9 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 80 place count 21 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 81 place count 20 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 81 place count 20 transition count 10
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 19 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 89 place count 15 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 90 place count 14 transition count 8
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 8 with 5 rules applied. Total rules applied 95 place count 11 transition count 6
Applied a total of 95 rules in 22 ms. Remains 11 /75 variables (removed 64) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 11 cols
[2024-06-02 00:05:58] [INFO ] Computed 6 invariants in 0 ms
[2024-06-02 00:05:58] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-02 00:05:58] [INFO ] Invariant cache hit.
[2024-06-02 00:05:58] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-06-02 00:05:58] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-02 00:05:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 6/17 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/17 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 28 constraints, problems are : Problem set: 0 solved, 5 unsolved in 138 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 6/17 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/17 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 33 constraints, problems are : Problem set: 0 solved, 5 unsolved in 98 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 262ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 270ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/75 places, 6/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 378 ms. Remains : 11/75 places, 6/45 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 152 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-02 finished in 582 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||X(p1))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 11 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 62 transition count 45
Applied a total of 13 rules in 3 ms. Remains 62 /75 variables (removed 13) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2024-06-02 00:05:59] [INFO ] Computed 18 invariants in 2 ms
[2024-06-02 00:05:59] [INFO ] Implicit Places using invariants in 91 ms returned [9, 12, 15, 16, 26, 27, 28, 29, 30, 31, 32, 33]
[2024-06-02 00:05:59] [INFO ] Actually due to overlaps returned [9, 12, 15, 16, 26, 28, 29, 31, 33]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 92 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/75 places, 45/45 transitions.
Applied a total of 0 rules in 18 ms. Remains 53 /53 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 53/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-06
Product exploration explored 100000 steps with 16666 reset in 136 ms.
Product exploration explored 100000 steps with 16666 reset in 108 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 700 ms. (57 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
// Phase 1: matrix 45 rows 53 cols
[2024-06-02 00:06:00] [INFO ] Computed 9 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 43/47 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/52 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/53 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 45/98 variables, 53/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/98 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 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/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 47/98 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 43 ms.
Refiners :[Domain max(s): 4/53 constraints, Positive P Invariants (semi-flows): 5/8 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/53 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 158ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 334 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-02 00:06:01] [INFO ] Invariant cache hit.
[2024-06-02 00:06:01] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-06-02 00:06:01] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 00:06:01] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-02 00:06:01] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-02 00:06:01] [INFO ] Added : 43 causal constraints over 9 iterations in 146 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 45/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 53 transition count 21
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 29 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 28 transition count 20
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 50 place count 28 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 61 place count 22 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 61 place count 22 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 21 transition count 14
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 78 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 3 with 1 rules applied. Total rules applied 79 place count 12 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 11 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 82 place count 10 transition count 6
Applied a total of 82 rules in 8 ms. Remains 10 /53 variables (removed 43) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 10 cols
[2024-06-02 00:06:01] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 00:06:01] [INFO ] Implicit Places using invariants in 31 ms returned [4, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/53 places, 6/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41 ms. Remains : 8/53 places, 6/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 17 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-06 finished in 2287 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 X(p1))&&X(F(p2))&&F(p3)))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 11 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 61 transition count 45
Applied a total of 14 rules in 3 ms. Remains 61 /75 variables (removed 14) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 61 cols
[2024-06-02 00:06:01] [INFO ] Computed 17 invariants in 1 ms
[2024-06-02 00:06:01] [INFO ] Implicit Places using invariants in 84 ms returned [9, 12, 15, 16, 25, 26, 27, 28, 29, 30, 31, 32]
[2024-06-02 00:06:01] [INFO ] Actually due to overlaps returned [9, 12, 15, 16, 25, 27, 28, 30, 32]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 86 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/75 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 52/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p3) (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p3), (NOT p1), true]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-07 finished in 333 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((p0 U X(G((G(p1) U p2))))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 11 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 61 transition count 45
Applied a total of 14 rules in 6 ms. Remains 61 /75 variables (removed 14) and now considering 45/45 (removed 0) transitions.
[2024-06-02 00:06:01] [INFO ] Invariant cache hit.
[2024-06-02 00:06:01] [INFO ] Implicit Places using invariants in 82 ms returned [9, 12, 15, 16, 25, 26, 27, 29, 30, 31, 32]
[2024-06-02 00:06:01] [INFO ] Actually due to overlaps returned [9, 12, 15, 16, 25, 27, 30, 32]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 84 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/75 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 53/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 360 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-08
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-08 finished in 478 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((G(!p0)||X(p1)))&&F(p2))) U p3))'
Support contains 8 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 8 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 64 transition count 45
Applied a total of 11 rules in 3 ms. Remains 64 /75 variables (removed 11) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2024-06-02 00:06:02] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 00:06:02] [INFO ] Implicit Places using invariants in 79 ms returned [9, 12, 16, 17, 28, 29, 31, 32, 34, 35]
[2024-06-02 00:06:02] [INFO ] Actually due to overlaps returned [9, 12, 16, 17, 28, 31, 35]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 80 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/75 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 57/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p3), (OR (NOT p3) (NOT p2) (AND p0 (NOT p1))), (NOT p1), (AND p0 (NOT p1)), (NOT p2), (AND p0 (NOT p1)), true, p0]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-10
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-10 finished in 401 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 (!p1&&X(p2))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 63 transition count 45
Applied a total of 12 rules in 3 ms. Remains 63 /75 variables (removed 12) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2024-06-02 00:06:02] [INFO ] Computed 19 invariants in 1 ms
[2024-06-02 00:06:02] [INFO ] Implicit Places using invariants in 65 ms returned [10, 13, 16, 17, 27, 28, 29, 30, 31, 32, 33, 34]
[2024-06-02 00:06:02] [INFO ] Actually due to overlaps returned [10, 13, 16, 17, 27, 29, 30, 32, 34]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 75 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/75 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 54/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) p1), p0, (NOT p2), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 259 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) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 118 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-C01M01P01D01-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-12 finished in 790 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(p0)&&(!p1 U (G(!p1)||(!p1&&G(!p2))))) U X(p1)))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 64 transition count 45
Applied a total of 11 rules in 3 ms. Remains 64 /75 variables (removed 11) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2024-06-02 00:06:03] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 00:06:03] [INFO ] Implicit Places using invariants in 84 ms returned [10, 13, 16, 17, 27, 28, 29, 30, 31, 32, 33, 34]
[2024-06-02 00:06:03] [INFO ] Actually due to overlaps returned [10, 13, 16, 17, 27, 29, 30, 32, 34]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 86 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/75 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 55/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 281 ms :[p2, (OR (NOT p1) p2), true, (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-13
Entered a terminal (fully accepting) state of product in 43 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-13 finished in 396 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(X((G(F(p0))&&(X(p2)||p1)))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 11 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 62 transition count 45
Applied a total of 13 rules in 3 ms. Remains 62 /75 variables (removed 13) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2024-06-02 00:06:03] [INFO ] Computed 18 invariants in 1 ms
[2024-06-02 00:06:03] [INFO ] Implicit Places using invariants in 85 ms returned [9, 12, 15, 16, 25, 26, 27, 28, 29, 30, 31, 32]
[2024-06-02 00:06:03] [INFO ] Actually due to overlaps returned [9, 12, 15, 16, 25, 27, 28, 30, 32]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 87 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/75 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 53/75 places, 45/45 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p2), true]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-14
Product exploration explored 100000 steps with 5263 reset in 88 ms.
Product exploration explored 100000 steps with 5263 reset in 89 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 72 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 124 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 72 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 45 rows 53 cols
[2024-06-02 00:06:04] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 00:06:04] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 00:06:04] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 00:06:04] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-02 00:06:04] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-02 00:06:05] [INFO ] Added : 16 causal constraints over 4 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 53 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 : 53/53 places, 45/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 53 transition count 22
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 30 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 29 transition count 21
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 48 place count 29 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 61 place count 22 transition count 15
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 3 with 1 rules applied. Total rules applied 62 place count 22 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 21 transition count 14
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 13 rules applied. Total rules applied 76 place count 13 transition count 9
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 4 places and 0 transitions.
Iterating global reduction 5 with 7 rules applied. Total rules applied 83 place count 9 transition count 6
Applied a total of 83 rules in 9 ms. Remains 9 /53 variables (removed 44) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-06-02 00:06:05] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 00:06:05] [INFO ] Implicit Places using invariants in 26 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/53 places, 6/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37 ms. Remains : 8/53 places, 6/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 6 rows 8 cols
[2024-06-02 00:06:05] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 00:06:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-02 00:06:05] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-02 00:06:05] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-02 00:06:05] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22182 reset in 143 ms.
Product exploration explored 100000 steps with 22209 reset in 162 ms.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 5 transition count 4
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 5 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 4 transition count 3
Applied a total of 7 rules in 2 ms. Remains 4 /8 variables (removed 4) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 4 cols
[2024-06-02 00:06:06] [INFO ] Computed 2 invariants in 0 ms
[2024-06-02 00:06:06] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-02 00:06:06] [INFO ] Invariant cache hit.
[2024-06-02 00:06:06] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-02 00:06:06] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-02 00:06:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/7 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 10 constraints, problems are : Problem set: 0 solved, 2 unsolved in 58 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/7 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/7 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 12 constraints, problems are : Problem set: 0 solved, 2 unsolved in 40 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/8 places, 3/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 4/8 places, 3/6 transitions.
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-14 finished in 2439 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||X(F((p0&&F(p1))))))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 11 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 61 transition count 31
Reduce places removed 15 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 16 rules applied. Total rules applied 33 place count 46 transition count 30
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 45 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 44 transition count 29
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 36 place count 44 transition count 19
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 62 place count 28 transition count 19
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 63 place count 28 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 64 place count 27 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 64 place count 27 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 70 place count 24 transition count 15
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 71 place count 23 transition count 15
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 85 place count 15 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 7 with 3 rules applied. Total rules applied 88 place count 13 transition count 8
Applied a total of 88 rules in 7 ms. Remains 13 /75 variables (removed 62) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 13 cols
[2024-06-02 00:06:06] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 00:06:06] [INFO ] Implicit Places using invariants in 32 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/75 places, 8/45 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 8 transition count 6
Applied a total of 5 rules in 2 ms. Remains 8 /11 variables (removed 3) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-02 00:06:06] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 00:06:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-02 00:06:06] [INFO ] Invariant cache hit.
[2024-06-02 00:06:06] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/75 places, 6/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 8/75 places, 6/45 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-15
Product exploration explored 100000 steps with 21759 reset in 85 ms.
Product exploration explored 100000 steps with 21778 reset in 104 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 236 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-06-02 00:06:07] [INFO ] Invariant cache hit.
[2024-06-02 00:06:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 00:06:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-02 00:06:07] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-02 00:06:07] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-02 00:06:07] [INFO ] Invariant cache hit.
[2024-06-02 00:06:07] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-02 00:06:07] [INFO ] Invariant cache hit.
[2024-06-02 00:06:07] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-06-02 00:06:07] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-02 00:06:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 6/14 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 19 constraints, problems are : Problem set: 0 solved, 5 unsolved in 77 ms.
Refiners :[Domain max(s): 8/8 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 6/14 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/14 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/14 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 24 constraints, problems are : Problem set: 0 solved, 5 unsolved in 75 ms.
Refiners :[Domain max(s): 8/8 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 157ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 245 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-06-02 00:06:08] [INFO ] Invariant cache hit.
[2024-06-02 00:06:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 00:06:08] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-02 00:06:08] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-02 00:06:08] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 21944 reset in 66 ms.
Product exploration explored 100000 steps with 21836 reset in 89 ms.
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-02 00:06:08] [INFO ] Invariant cache hit.
[2024-06-02 00:06:08] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-02 00:06:08] [INFO ] Invariant cache hit.
[2024-06-02 00:06:08] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-06-02 00:06:08] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-02 00:06:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 6/14 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 19 constraints, problems are : Problem set: 0 solved, 5 unsolved in 158 ms.
Refiners :[Domain max(s): 8/8 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 6/14 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/14 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/14 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 24 constraints, problems are : Problem set: 0 solved, 5 unsolved in 95 ms.
Refiners :[Domain max(s): 8/8 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 260ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 260ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 355 ms. Remains : 8/8 places, 6/6 transitions.
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-15 finished in 2890 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(X((G(F(p0))&&(X(p2)||p1)))))'
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||X(F((p0&&F(p1))))))))'
[2024-06-02 00:06:09] [INFO ] Flatten gal took : 8 ms
[2024-06-02 00:06:09] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-02 00:06:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 75 places, 45 transitions and 150 arcs took 5 ms.
Total runtime 14863 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717286769979

--------------------
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-C01M01P01D01-LTLFireability-14
ltl formula formula --ltl=/tmp/1208/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 75 places, 45 transitions and 150 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1208/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1208/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1208/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1208/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 77 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 76, there are 70 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( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 207
pnml2lts-mc( 0/ 4): unique states count: 410
pnml2lts-mc( 0/ 4): unique transitions count: 2099
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2082
pnml2lts-mc( 0/ 4): - claim found count: 407
pnml2lts-mc( 0/ 4): - claim success count: 785
pnml2lts-mc( 0/ 4): - cum. max stack depth: 296
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 854 states 4362 transitions, fanout: 5.108
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 85400, Transitions per second: 436200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 24.6 B/state, compr.: 8.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.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: 0.0MB (~256.0MB paged-in)
ltl formula name IOTPpurchase-PT-C01M01P01D01-LTLFireability-15
ltl formula formula --ltl=/tmp/1208/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 75 places, 45 transitions and 150 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( 2/ 4): LTL layer: formula: /tmp/1208/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1208/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1208/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1208/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 76 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 76, there are 98 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( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 413
pnml2lts-mc( 0/ 4): unique states count: 616
pnml2lts-mc( 0/ 4): unique transitions count: 3036
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3026
pnml2lts-mc( 0/ 4): - claim found count: 347
pnml2lts-mc( 0/ 4): - claim success count: 990
pnml2lts-mc( 0/ 4): - cum. max stack depth: 284
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1042 states 5232 transitions, fanout: 5.021
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 104200, Transitions per second: 523200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 22.9 B/state, compr.: 7.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.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: 0.0MB (~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-C01M01P01D01"
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-C01M01P01D01, 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-171649588000364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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