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-171649588100387.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is IOTPpurchase-PT-C12M10P15D17, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649588100387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 13 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 60K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717287086974

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C12M10P15D17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 00:11:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 00:11:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 00:11:29] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-06-02 00:11:29] [INFO ] Transformed 111 places.
[2024-06-02 00:11:29] [INFO ] Transformed 45 transitions.
[2024-06-02 00:11:29] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 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 27 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 82 transition count 45
Applied a total of 29 rules in 35 ms. Remains 82 /111 variables (removed 29) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 82 cols
[2024-06-02 00:11:30] [INFO ] Computed 38 invariants in 15 ms
[2024-06-02 00:11:30] [INFO ] Implicit Places using invariants in 260 ms returned [12, 24]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 313 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/111 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 380 ms. Remains : 80/111 places, 45/45 transitions.
Support contains 49 out of 80 places after structural reductions.
[2024-06-02 00:11:30] [INFO ] Flatten gal took : 51 ms
[2024-06-02 00:11:30] [INFO ] Flatten gal took : 20 ms
[2024-06-02 00:11:30] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 40001 steps (8 resets) in 2318 ms. (17 steps per ms) remains 4/33 properties
BEST_FIRST walk for 40002 steps (8 resets) in 455 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
// Phase 1: matrix 45 rows 80 cols
[2024-06-02 00:11:32] [INFO ] Computed 36 invariants in 6 ms
[2024-06-02 00:11:32] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 6/11 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/45 variables, 4/8 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/52 variables, 4/12 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/54 variables, 2/14 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/79 variables, 21/35 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/80 variables, 1/36 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 0/36 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 45/125 variables, 80/116 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/125 variables, 1/117 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/125 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/125 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 117 constraints, problems are : Problem set: 3 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 80/80 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/41 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/50 variables, 6/11 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/52 variables, 2/13 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/78 variables, 21/34 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/80 variables, 2/36 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 0/36 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 45/125 variables, 80/116 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/125 variables, 1/117 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/125 variables, 1/118 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/125 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/125 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 118 constraints, problems are : Problem set: 3 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 80/80 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 421ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 752 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=57 )
Parikh walk visited 1 properties in 23 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 65 transition count 45
Applied a total of 15 rules in 7 ms. Remains 65 /80 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2024-06-02 00:11:33] [INFO ] Computed 21 invariants in 2 ms
[2024-06-02 00:11:33] [INFO ] Implicit Places using invariants in 125 ms returned [14, 15, 24]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 128 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/80 places, 45/45 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 62/80 places, 45/45 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-00
Product exploration explored 100000 steps with 1004 reset in 611 ms.
Product exploration explored 100000 steps with 1009 reset in 390 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 482 steps (0 resets) in 10 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 45 rows 62 cols
[2024-06-02 00:11:35] [INFO ] Computed 18 invariants in 2 ms
[2024-06-02 00:11:35] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-06-02 00:11:35] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 00:11:35] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-06-02 00:11:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 00:11:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-06-02 00:11:35] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 00:11:35] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-02 00:11:35] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-02 00:11:35] [INFO ] Added : 31 causal constraints over 7 iterations in 103 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 62 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 26 rules applied. Total rules applied 35 place count 47 transition count 25
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 46 place count 36 transition count 25
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 46 place count 36 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 67 place count 24 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 67 place count 24 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 22 transition count 14
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 87 place count 12 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 88 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 91 place count 9 transition count 7
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 92 place count 9 transition count 6
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 95 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 96 place count 6 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 98 place count 5 transition count 4
Applied a total of 98 rules in 19 ms. Remains 5 /62 variables (removed 57) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-06-02 00:11:35] [INFO ] Computed 2 invariants in 1 ms
[2024-06-02 00:11:35] [INFO ] Implicit Places using invariants in 27 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/62 places, 4/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49 ms. Remains : 4/62 places, 4/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 (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 141 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 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 4 rows 4 cols
[2024-06-02 00:11:36] [INFO ] Computed 1 invariants in 0 ms
[2024-06-02 00:11:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-02 00:11:36] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-02 00:11:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 00:11:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-02 00:11:36] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-02 00:11:36] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-02 00:11:36] [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 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2935 reset in 122 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-00 finished in 3272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U (p1&&F(p2)))||G(p3))))'
Support contains 6 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 66 transition count 45
Applied a total of 14 rules in 6 ms. Remains 66 /80 variables (removed 14) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2024-06-02 00:11:36] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 00:11:36] [INFO ] Implicit Places using invariants in 115 ms returned [14, 24]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 117 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/80 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 64/80 places, 45/45 transitions.
Stuttering acceptance computed with spot in 449 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-01
Product exploration explored 100000 steps with 835 reset in 292 ms.
Product exploration explored 100000 steps with 833 reset in 541 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p3 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p2)), (X p3), (X (AND p1 (NOT p2) p3)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT p0)), (X p1), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 197 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
RANDOM walk for 521 steps (0 resets) in 7 ms. (65 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p3 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p2)), (X p3), (X (AND p1 (NOT p2) p3)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT p0)), (X p1), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p2), (F (NOT p3)), (F (NOT (AND p3 (NOT p2)))), (F (NOT (OR p3 p2)))]
Knowledge based reduction with 27 factoid took 379 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 3 out of 64 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2024-06-02 00:11:38] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 00:11:39] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 00:11:39] [INFO ] Invariant cache hit.
[2024-06-02 00:11:39] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-02 00:11:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/109 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 84 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1486 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/109 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 44/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 128 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 2848ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2851ms
Finished structural reductions in LTL mode , in 1 iterations and 3113 ms. Remains : 64/64 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p3), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND p3 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
RANDOM walk for 581 steps (0 resets) in 9 ms. (58 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) p3), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND p3 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p3))), (F (NOT p3)), (F p2), (F (NOT (OR p2 p3)))]
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 832 reset in 281 ms.
Product exploration explored 100000 steps with 832 reset in 352 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 45/45 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 63 transition count 45
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 9 place count 63 transition count 45
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 24 place count 63 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 62 transition count 44
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 62 transition count 44
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 33 rules in 14 ms. Remains 62 /64 variables (removed 2) and now considering 44/45 (removed 1) transitions.
[2024-06-02 00:11:44] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 62 cols
[2024-06-02 00:11:44] [INFO ] Computed 19 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-02 00:11:44] [INFO ] Deduced a trap composed of 1 places in 42 ms of which 8 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-02 00:11:44] [INFO ] Deduced a trap composed of 1 places in 31 ms of which 1 ms to minimize.
[2024-06-02 00:11:44] [INFO ] Deduced a trap composed of 1 places in 30 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-02 00:11:44] [INFO ] Deduced a trap composed of 1 places in 28 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-02 00:11:44] [INFO ] Deduced a trap composed of 1 places in 26 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-02 00:11:44] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-02 00:11:44] [INFO ] Deduced a trap composed of 1 places in 31 ms of which 1 ms to minimize.
[2024-06-02 00:11:44] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-02 00:11:44] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-02 00:11:44] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-02 00:11:44] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 11/29 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/29 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/62 variables, 1/30 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/30 constraints. Problems are: Problem set: 11 solved, 32 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 6 (OVERLAPS) 44/106 variables, 62/92 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/92 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/92 constraints. Problems are: Problem set: 29 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 92 constraints, problems are : Problem set: 29 solved, 14 unsolved in 1203 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 29 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 10/12 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 14/44 variables, 12/24 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/25 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 17/61 variables, 3/28 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/62 variables, 1/29 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 1/30 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/30 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 44/106 variables, 62/92 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 14/106 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 29 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 0/106 variables, 0/106 constraints. Problems are: Problem set: 29 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 106 constraints, problems are : Problem set: 29 solved, 14 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 14/43 constraints, Known Traps: 11/11 constraints]
After SMT, in 1553ms problems are : Problem set: 29 solved, 14 unsolved
Search for dead transitions found 29 dead transitions in 1554ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/64 places, 15/45 transitions.
Graph (complete) has 71 edges and 62 vertex of which 33 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 20 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 8 place count 20 transition count 15
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 20 transition count 15
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 17 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 17 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 17 transition count 12
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 16 transition count 11
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 16 transition count 11
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 20 rules in 7 ms. Remains 16 /62 variables (removed 46) and now considering 11/15 (removed 4) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/64 places, 11/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1582 ms. Remains : 16/64 places, 11/45 transitions.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 45/45 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 45
Applied a total of 1 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2024-06-02 00:11:45] [INFO ] Computed 19 invariants in 1 ms
[2024-06-02 00:11:45] [INFO ] Implicit Places using invariants in 65 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/64 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 62/64 places, 45/45 transitions.
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-01 finished in 9627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(!p0 U p1)||X(p2))))'
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 65 transition count 45
Applied a total of 15 rules in 3 ms. Remains 65 /80 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2024-06-02 00:11:45] [INFO ] Computed 21 invariants in 2 ms
[2024-06-02 00:11:46] [INFO ] Implicit Places using invariants in 73 ms returned [15, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/80 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 63/80 places, 45/45 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 3792 steps with 1092 reset in 4 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-03 finished in 221 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 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 65 transition count 37
Reduce places removed 13 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 22 rules applied. Total rules applied 36 place count 52 transition count 28
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 46 place count 43 transition count 27
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 49 place count 41 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 50 place count 40 transition count 26
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 50 place count 40 transition count 18
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 71 place count 27 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 71 place count 27 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 75 place count 25 transition count 16
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 17 rules applied. Total rules applied 92 place count 15 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 93 place count 14 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 93 place count 14 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 96 place count 12 transition count 8
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 97 place count 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 100 place count 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 102 place count 9 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 103 place count 8 transition count 5
Applied a total of 103 rules in 14 ms. Remains 8 /80 variables (removed 72) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 8 cols
[2024-06-02 00:11:46] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 00:11:46] [INFO ] Implicit Places using invariants in 28 ms returned [1, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/80 places, 5/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 2 transition count 2
Applied a total of 7 rules in 2 ms. Remains 2 /6 variables (removed 4) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-02 00:11:46] [INFO ] Computed 1 invariants in 0 ms
[2024-06-02 00:11:46] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-02 00:11:46] [INFO ] Invariant cache hit.
[2024-06-02 00:11:46] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/80 places, 2/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 2/80 places, 2/45 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 52 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 3 in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-04 finished in 182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 65 transition count 45
Applied a total of 15 rules in 4 ms. Remains 65 /80 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2024-06-02 00:11:46] [INFO ] Computed 21 invariants in 1 ms
[2024-06-02 00:11:46] [INFO ] Implicit Places using invariants in 73 ms returned [15, 16, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 75 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/80 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 62/80 places, 45/45 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-07 finished in 207 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 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 65 transition count 38
Reduce places removed 13 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 24 rules applied. Total rules applied 37 place count 52 transition count 27
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 49 place count 41 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 40 transition count 26
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 50 place count 40 transition count 19
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 19 rules applied. Total rules applied 69 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 70 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 71 place count 27 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 71 place count 27 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 75 place count 25 transition count 16
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 87 place count 18 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 88 place count 18 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 89 place count 17 transition count 10
Applied a total of 89 rules in 12 ms. Remains 17 /80 variables (removed 63) and now considering 10/45 (removed 35) transitions.
// Phase 1: matrix 10 rows 17 cols
[2024-06-02 00:11:46] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 00:11:46] [INFO ] Implicit Places using invariants in 53 ms returned [1, 5, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/80 places, 10/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 12 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 9 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 13 place count 6 transition count 5
Applied a total of 13 rules in 2 ms. Remains 6 /14 variables (removed 8) and now considering 5/10 (removed 5) transitions.
// Phase 1: matrix 5 rows 6 cols
[2024-06-02 00:11:46] [INFO ] Computed 2 invariants in 0 ms
[2024-06-02 00:11:46] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-02 00:11:46] [INFO ] Invariant cache hit.
[2024-06-02 00:11:46] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/80 places, 5/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 126 ms. Remains : 6/80 places, 5/45 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 147 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-08 finished in 336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 66 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 31 place count 55 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 39 place count 47 transition count 30
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 39 place count 47 transition count 21
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 61 place count 34 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 61 place count 34 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 32 transition count 19
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 86 place count 19 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 18 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 92 place count 15 transition count 9
Applied a total of 92 rules in 9 ms. Remains 15 /80 variables (removed 65) and now considering 9/45 (removed 36) transitions.
// Phase 1: matrix 9 rows 15 cols
[2024-06-02 00:11:46] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 00:11:46] [INFO ] Implicit Places using invariants in 45 ms returned [1, 5, 6, 8]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 46 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/80 places, 9/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 6 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 7 transition count 6
Applied a total of 7 rules in 3 ms. Remains 7 /11 variables (removed 4) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-06-02 00:11:46] [INFO ] Computed 2 invariants in 1 ms
[2024-06-02 00:11:46] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-02 00:11:46] [INFO ] Invariant cache hit.
[2024-06-02 00:11:47] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/80 places, 6/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 7/80 places, 6/45 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 145 ms.
Stack based approach found an accepted trace after 74 steps with 0 reset with depth 75 and stack size 75 in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-10 finished in 433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 65 transition count 39
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 17 rules applied. Total rules applied 29 place count 55 transition count 32
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 38 place count 48 transition count 30
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 43 place count 44 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 43 transition count 29
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 44 place count 43 transition count 21
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 64 place count 31 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 64 place count 31 transition count 19
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 68 place count 29 transition count 19
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 80 place count 22 transition count 14
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 21 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 81 place count 21 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 83 place count 20 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 86 place count 18 transition count 12
Applied a total of 86 rules in 11 ms. Remains 18 /80 variables (removed 62) and now considering 12/45 (removed 33) transitions.
// Phase 1: matrix 12 rows 18 cols
[2024-06-02 00:11:47] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 00:11:47] [INFO ] Implicit Places using invariants in 44 ms returned [2, 10]
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 : 16/80 places, 12/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 15 transition count 10
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 6 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 12 transition count 9
Applied a total of 7 rules in 3 ms. Remains 12 /16 variables (removed 4) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-06-02 00:11:47] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 00:11:47] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 00:11:47] [INFO ] Invariant cache hit.
[2024-06-02 00:11:47] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/80 places, 9/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 12/80 places, 9/45 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-12 finished in 299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((p1||G(!p0))))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 41
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 13 rules applied. Total rules applied 23 place count 57 transition count 36
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 9 rules applied. Total rules applied 32 place count 52 transition count 32
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 36 place count 48 transition count 32
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 48 transition count 22
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 27 rules applied. Total rules applied 63 place count 31 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 63 place count 31 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 67 place count 29 transition count 20
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 79 place count 22 transition count 15
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 21 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 82 place count 20 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 82 place count 20 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 85 place count 18 transition count 13
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 86 place count 18 transition count 12
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 89 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 90 place count 15 transition count 11
Applied a total of 90 rules in 21 ms. Remains 15 /80 variables (removed 65) and now considering 11/45 (removed 34) transitions.
// Phase 1: matrix 11 rows 15 cols
[2024-06-02 00:11:47] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 00:11:47] [INFO ] Implicit Places using invariants in 46 ms returned [2, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/80 places, 11/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 12 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7 place count 9 transition count 8
Applied a total of 7 rules in 2 ms. Remains 9 /13 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 9 cols
[2024-06-02 00:11:47] [INFO ] Computed 2 invariants in 0 ms
[2024-06-02 00:11:47] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-02 00:11:47] [INFO ] Invariant cache hit.
[2024-06-02 00:11:47] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/80 places, 8/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 9/80 places, 8/45 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-13
Product exploration explored 100000 steps with 3 reset in 159 ms.
Stack based approach found an accepted trace after 332 steps with 0 reset with depth 333 and stack size 330 in 2 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-13 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||X(p1)))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 65 transition count 45
Applied a total of 15 rules in 3 ms. Remains 65 /80 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2024-06-02 00:11:48] [INFO ] Computed 21 invariants in 1 ms
[2024-06-02 00:11:48] [INFO ] Implicit Places using invariants in 115 ms returned [14, 15, 24]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 117 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/80 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 62/80 places, 45/45 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 417 ms.
Product exploration explored 100000 steps with 0 reset in 389 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 7957 steps (0 resets) in 61 ms. (128 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 338 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2024-06-02 00:11:49] [INFO ] Computed 18 invariants in 2 ms
[2024-06-02 00:11:49] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 00:11:49] [INFO ] Invariant cache hit.
[2024-06-02 00:11:50] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-02 00:11:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/107 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/107 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 80 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1097 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/107 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 44/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 124 constraints, problems are : Problem set: 0 solved, 44 unsolved in 932 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 2045ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2048ms
Finished structural reductions in LTL mode , in 1 iterations and 2257 ms. Remains : 62/62 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 198 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 12564 steps (2 resets) in 58 ms. (212 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 528 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 380 ms.
Product exploration explored 100000 steps with 0 reset in 356 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-06-02 00:11:54] [INFO ] Invariant cache hit.
[2024-06-02 00:11:54] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 00:11:54] [INFO ] Invariant cache hit.
[2024-06-02 00:11:54] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-02 00:11:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/107 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/107 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 80 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1208 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/107 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 44/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 124 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1315 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 2533ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2537ms
Finished structural reductions in LTL mode , in 1 iterations and 2659 ms. Remains : 62/62 places, 45/45 transitions.
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14 finished in 8771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(F((p0&&(p1 U p2))) U p1)))'
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 65 transition count 45
Applied a total of 15 rules in 2 ms. Remains 65 /80 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2024-06-02 00:11:56] [INFO ] Computed 21 invariants in 2 ms
[2024-06-02 00:11:56] [INFO ] Implicit Places using invariants in 82 ms returned [14, 15, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 84 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/80 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 62/80 places, 45/45 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-15 finished in 422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U (p1&&F(p2)))||G(p3))))'
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(p1)))))'
Found a Lengthening insensitive property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 80/80 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 65 transition count 37
Reduce places removed 13 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 22 rules applied. Total rules applied 36 place count 52 transition count 28
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 46 place count 43 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 48 place count 41 transition count 27
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 48 place count 41 transition count 19
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 69 place count 28 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 69 place count 28 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 73 place count 26 transition count 17
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 90 place count 16 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 15 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 96 place count 12 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 97 place count 12 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 98 place count 11 transition count 7
Applied a total of 98 rules in 13 ms. Remains 11 /80 variables (removed 69) and now considering 7/45 (removed 38) transitions.
// Phase 1: matrix 7 rows 11 cols
[2024-06-02 00:11:57] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 00:11:57] [INFO ] Implicit Places using invariants in 45 ms returned [1, 4, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 8/80 places, 7/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 8 transition count 6
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 7 transition count 6
Applied a total of 2 rules in 2 ms. Remains 7 /8 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-06-02 00:11:57] [INFO ] Computed 2 invariants in 0 ms
[2024-06-02 00:11:57] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-02 00:11:57] [INFO ] Invariant cache hit.
[2024-06-02 00:11:57] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 7/80 places, 6/45 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 123 ms. Remains : 7/80 places, 6/45 transitions.
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 183 ms.
Stack based approach found an accepted trace after 243 steps with 0 reset with depth 244 and stack size 236 in 0 ms.
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14 finished in 598 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-02 00:11:58] [INFO ] Flatten gal took : 10 ms
[2024-06-02 00:11:58] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-02 00:11:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 80 places, 45 transitions and 162 arcs took 8 ms.
Total runtime 28712 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-01
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717287134085

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name IOTPpurchase-PT-C12M10P15D17-LTLCardinality-01
ltl formula formula --ltl=/tmp/1278/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 80 places, 45 transitions and 162 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1278/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1278/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1278/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1278/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 82 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 81, there are 85 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): ~255 levels ~10000 states ~22284 transitions
pnml2lts-mc( 0/ 4): ~255 levels ~20000 states ~47468 transitions
pnml2lts-mc( 1/ 4): ~254 levels ~40000 states ~86272 transitions
pnml2lts-mc( 1/ 4): ~254 levels ~80000 states ~190288 transitions
pnml2lts-mc( 1/ 4): ~254 levels ~160000 states ~392852 transitions
pnml2lts-mc( 1/ 4): ~254 levels ~320000 states ~826416 transitions
pnml2lts-mc( 1/ 4): ~254 levels ~640000 states ~1754576 transitions
pnml2lts-mc( 1/ 4): ~254 levels ~1280000 states ~3536844 transitions
pnml2lts-mc( 1/ 4): ~254 levels ~2560000 states ~7679344 transitions
pnml2lts-mc( 1/ 4): ~254 levels ~5120000 states ~15673196 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5047265
pnml2lts-mc( 0/ 4): unique states count: 5047912
pnml2lts-mc( 0/ 4): unique transitions count: 18313710
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 13467654
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5119590
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1015
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5119590 states 18719212 transitions, fanout: 3.656
pnml2lts-mc( 0/ 4): Total exploration time 15.160 sec (15.150 sec minimum, 15.152 sec on average)
pnml2lts-mc( 0/ 4): States per second: 337704, Transitions per second: 1234776
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 102.5MB, 21.3 B/state, compr.: 6.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 15.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 45 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 102.5MB (~256.0MB paged-in)
ltl formula name IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14
ltl formula formula --ltl=/tmp/1278/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
pnml2lts-mc( 0/ 4): Petri net has 80 places, 45 transitions and 162 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1278/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1278/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1278/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1278/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 81 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 81, there are 52 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): Accepting cycle FOUND at depth ~226!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 878
pnml2lts-mc( 0/ 4): unique transitions count: 2524
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 175
pnml2lts-mc( 0/ 4): - claim success count: 916
pnml2lts-mc( 0/ 4): - cum. max stack depth: 916
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 916 states 2596 transitions, fanout: 2.834
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 30533, Transitions per second: 86533
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 32.4 B/state, compr.: 10.0%
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.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IOTPpurchase-PT-C12M10P15D17"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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