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.r496-tall-171640603400443.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 GPPP-PT-C1000N0000000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603400443
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 09:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C1000N0000000010-LTLCardinality-00
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-01
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-02
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-03
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-04
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-05
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-06
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-07
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-08
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-09
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-10
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-11
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-12
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-13
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-14
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717197335174

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C1000N0000000010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:15:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:15:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:15:36] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2024-05-31 23:15:36] [INFO ] Transformed 33 places.
[2024-05-31 23:15:36] [INFO ] Transformed 22 transitions.
[2024-05-31 23:15:36] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-31 23:15:36] [INFO ] Invariants computation overflowed in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 1 (OVERLAPS) 22/54 variables, 32/32 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/33 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/55 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 33 constraints, problems are : Problem set: 1 solved, 20 unsolved in 360 ms.
Refiners :[State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/53 variables, 31/31 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 16/47 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 2/55 variables, 2/49 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 4/53 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 53 constraints, problems are : Problem set: 1 solved, 20 unsolved in 701 ms.
Refiners :[State Equation: 33/33 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 1101ms problems are : Problem set: 1 solved, 20 unsolved
Search for dead transitions found 1 dead transitions in 1119ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
// Phase 1: matrix 21 rows 33 cols
[2024-05-31 23:15:37] [INFO ] Invariants computation overflowed in 3 ms
[2024-05-31 23:15:37] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 21 rows 33 cols
[2024-05-31 23:15:37] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:15:37] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 106 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 21/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1304 ms. Remains : 32/33 places, 21/22 transitions.
Support contains 20 out of 32 places after structural reductions.
[2024-05-31 23:15:38] [INFO ] Flatten gal took : 16 ms
[2024-05-31 23:15:38] [INFO ] Flatten gal took : 6 ms
[2024-05-31 23:15:38] [INFO ] Input system was already deterministic with 21 transitions.
RANDOM walk for 40006 steps (91 resets) in 734 ms. (54 steps per ms) remains 5/23 properties
BEST_FIRST walk for 40003 steps (24 resets) in 355 ms. (112 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (16 resets) in 255 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (28 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (28 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 193 ms. (206 steps per ms) remains 5/5 properties
// Phase 1: matrix 21 rows 32 cols
[2024-05-31 23:15:38] [INFO ] Invariants computation overflowed in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 14/20 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 3 (OVERLAPS) 24/44 variables, 19/25 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/50 variables, 5/30 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/53 variables, 2/32 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/53 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 32 constraints, problems are : Problem set: 2 solved, 3 unsolved in 81 ms.
Refiners :[State Equation: 32/32 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/41 variables, 18/22 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 3/25 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Int declared 50/53 variables, and 33 constraints, problems are : Problem set: 5 solved, 0 unsolved in 84 ms.
Refiners :[State Equation: 30/32 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 19 stable transitions
Graph (complete) has 76 edges and 32 vertex of which 29 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-10 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' '!(G((p0||X(p0))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 21
Applied a total of 1 rules in 5 ms. Remains 31 /32 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:15:39] [INFO ] Invariants computation overflowed in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/52 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 192 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/52 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 632 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 843ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 845ms
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:15:40] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:15:40] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:15:40] [INFO ] Invariants computation overflowed in 2 ms
[2024-05-31 23:15:40] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 935 ms. Remains : 30/32 places, 21/21 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 53 steps with 0 reset in 3 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLCardinality-00 finished in 1177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Graph (complete) has 76 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 2 place count 30 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 29 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 29 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 24 transition count 16
Applied a total of 11 rules in 15 ms. Remains 24 /32 variables (removed 8) and now considering 16/21 (removed 5) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 24 cols
[2024-05-31 23:15:40] [INFO ] Computed 9 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/24 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 16/40 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 33 constraints, problems are : Problem set: 0 solved, 15 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 16/40 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 48 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5234 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 5388ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 5388ms
[2024-05-31 23:15:45] [INFO ] Invariant cache hit.
[2024-05-31 23:15:45] [INFO ] Implicit Places using invariants in 37 ms returned [0, 14, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 16/21 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 18 transition count 14
Applied a total of 5 rules in 2 ms. Remains 18 /21 variables (removed 3) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 18 cols
[2024-05-31 23:15:45] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:15:45] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2024-05-31 23:15:45] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:15:45] [INFO ] Implicit Places using invariants and state equation in 30 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 : 18/32 places, 14/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5503 ms. Remains : 18/32 places, 14/21 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLCardinality-05
Product exploration explored 100000 steps with 1016 reset in 187 ms.
Stack based approach found an accepted trace after 1475 steps with 16 reset with depth 29 and stack size 28 in 13 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLCardinality-05 finished in 5804 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(F(p0))||G(p1))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 74 edges and 31 vertex of which 28 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 27 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 26 transition count 17
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 2 with 5 rules applied. Total rules applied 9 place count 23 transition count 15
Applied a total of 9 rules in 13 ms. Remains 23 /32 variables (removed 9) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 23 cols
[2024-05-31 23:15:46] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:15:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 14/36 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/37 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 24 constraints, problems are : Problem set: 0 solved, 14 unsolved in 184 ms.
Refiners :[State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 14/36 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/37 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/38 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 38 constraints, problems are : Problem set: 0 solved, 14 unsolved in 344 ms.
Refiners :[State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 536ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 537ms
// Phase 1: matrix 15 rows 23 cols
[2024-05-31 23:15:46] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:15:46] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2024-05-31 23:15:46] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:15:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:15:46] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [0, 13, 16]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 81 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 15/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 632 ms. Remains : 20/32 places, 15/21 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLCardinality-06
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLCardinality-06 finished in 711 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 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 21
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:15:46] [INFO ] Invariants computation overflowed in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/52 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 189 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/52 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 592 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 792ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 792ms
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:15:47] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:15:47] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:15:47] [INFO ] Invariants computation overflowed in 2 ms
[2024-05-31 23:15:47] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 75 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 870 ms. Remains : 29/32 places, 21/21 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLCardinality-08 finished in 964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X((p1&&X((p1 U (X(p2)||G(p1)))))))) U p3))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 21
Applied a total of 1 rules in 3 ms. Remains 31 /32 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:15:47] [INFO ] Invariants computation overflowed in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/52 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 201 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/52 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 600 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 807ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 808ms
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:15:48] [INFO ] Invariants computation overflowed in 14 ms
[2024-05-31 23:15:48] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:15:48] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:15:48] [INFO ] Implicit Places using invariants and state equation in 38 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 896 ms. Remains : 30/32 places, 21/21 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLCardinality-09
Product exploration explored 100000 steps with 5099 reset in 186 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 GPPP-PT-C1000N0000000010-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLCardinality-09 finished in 1324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 32 cols
[2024-05-31 23:15:49] [INFO ] Invariants computation overflowed in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/53 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/53 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 32 constraints, problems are : Problem set: 0 solved, 20 unsolved in 176 ms.
Refiners :[State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 2/53 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 52 constraints, problems are : Problem set: 0 solved, 20 unsolved in 701 ms.
Refiners :[State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 887ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 888ms
// Phase 1: matrix 21 rows 32 cols
[2024-05-31 23:15:50] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:15:50] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 21 rows 32 cols
[2024-05-31 23:15:50] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:15:50] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 79 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 970 ms. Remains : 30/32 places, 21/21 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 46 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLCardinality-11 finished in 1133 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) U p1))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 74 edges and 31 vertex of which 28 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 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 3 place count 27 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 26 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 26 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 25 transition count 16
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 2 with 5 rules applied. Total rules applied 11 place count 22 transition count 14
Applied a total of 11 rules in 4 ms. Remains 22 /32 variables (removed 10) and now considering 14/21 (removed 7) transitions.
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 22 cols
[2024-05-31 23:15:50] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:15:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 13/34 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/35 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/36 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 0 solved, 13 unsolved in 156 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 13/34 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/35 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/36 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 36 constraints, problems are : Problem set: 0 solved, 13 unsolved in 295 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 457ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 458ms
// Phase 1: matrix 14 rows 22 cols
[2024-05-31 23:15:50] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:15:50] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 14 rows 22 cols
[2024-05-31 23:15:50] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:15:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:15:50] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [0, 13, 15]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 86 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/32 places, 14/21 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 17 transition count 12
Applied a total of 4 rules in 1 ms. Remains 17 /19 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-05-31 23:15:50] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:15:50] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2024-05-31 23:15:50] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:15:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:15:50] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/32 places, 12/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 598 ms. Remains : 17/32 places, 12/21 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 101 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLCardinality-12 finished in 710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 21
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:15:50] [INFO ] Invariants computation overflowed in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/52 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 197 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/52 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 606 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 807ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 808ms
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:15:51] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:15:51] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:15:51] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:15:51] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 880 ms. Remains : 30/32 places, 21/21 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLCardinality-13
Product exploration explored 100000 steps with 233 reset in 213 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLCardinality-13 finished in 1214 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((X(p1)||p0)))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 32 cols
[2024-05-31 23:15:52] [INFO ] Invariants computation overflowed in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/53 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/53 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 32 constraints, problems are : Problem set: 0 solved, 20 unsolved in 195 ms.
Refiners :[State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 2/53 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 52 constraints, problems are : Problem set: 0 solved, 20 unsolved in 737 ms.
Refiners :[State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 937ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 939ms
// Phase 1: matrix 21 rows 32 cols
[2024-05-31 23:15:53] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:15:53] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 21 rows 32 cols
[2024-05-31 23:15:53] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:15:53] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 80 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1021 ms. Remains : 30/32 places, 21/21 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLCardinality-15
Product exploration explored 100000 steps with 233 reset in 126 ms.
Product exploration explored 100000 steps with 233 reset in 195 ms.
Computed a total of 28 stabilizing places and 19 stable transitions
Graph (complete) has 65 edges and 30 vertex of which 28 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 28 stabilizing places and 19 stable transitions
Detected a total of 28/30 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 292 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 31222 steps (73 resets) in 107 ms. (289 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 11 factoid took 491 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 30 cols
[2024-05-31 23:15:54] [INFO ] Invariants computation overflowed in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/49 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/51 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 30 constraints, problems are : Problem set: 0 solved, 20 unsolved in 193 ms.
Refiners :[State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/49 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 2/51 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 50 constraints, problems are : Problem set: 0 solved, 20 unsolved in 445 ms.
Refiners :[State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 647ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 648ms
// Phase 1: matrix 21 rows 30 cols
[2024-05-31 23:15:55] [INFO ] Invariants computation overflowed in 4 ms
[2024-05-31 23:15:55] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 21 rows 30 cols
[2024-05-31 23:15:55] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:15:55] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 30 cols
[2024-05-31 23:15:55] [INFO ] Invariants computation overflowed in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/49 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/51 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 30 constraints, problems are : Problem set: 0 solved, 20 unsolved in 194 ms.
Refiners :[State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/49 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 2/51 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 50 constraints, problems are : Problem set: 0 solved, 20 unsolved in 480 ms.
Refiners :[State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 684ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 684ms
Finished structural reductions in LTL mode , in 1 iterations and 1401 ms. Remains : 30/30 places, 21/21 transitions.
Computed a total of 28 stabilizing places and 19 stable transitions
Graph (complete) has 65 edges and 30 vertex of which 28 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 28 stabilizing places and 19 stable transitions
Detected a total of 28/30 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 206 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 32885 steps (76 resets) in 90 ms. (361 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 11 factoid took 419 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 233 reset in 112 ms.
Product exploration explored 100000 steps with 233 reset in 123 ms.
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 30 cols
[2024-05-31 23:15:57] [INFO ] Invariants computation overflowed in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/49 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/51 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 30 constraints, problems are : Problem set: 0 solved, 20 unsolved in 200 ms.
Refiners :[State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/49 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 2/51 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 50 constraints, problems are : Problem set: 0 solved, 20 unsolved in 451 ms.
Refiners :[State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 662ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 663ms
// Phase 1: matrix 21 rows 30 cols
[2024-05-31 23:15:58] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:15:58] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 21 rows 30 cols
[2024-05-31 23:15:58] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:15:58] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 30 cols
[2024-05-31 23:15:58] [INFO ] Invariants computation overflowed in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/49 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/51 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 30 constraints, problems are : Problem set: 0 solved, 20 unsolved in 193 ms.
Refiners :[State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/49 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 2/51 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 50 constraints, problems are : Problem set: 0 solved, 20 unsolved in 458 ms.
Refiners :[State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 660ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 661ms
Finished structural reductions in LTL mode , in 1 iterations and 1391 ms. Remains : 30/30 places, 21/21 transitions.
Treatment of property GPPP-PT-C1000N0000000010-LTLCardinality-15 finished in 6779 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((X(p1)||p0)))'
Found a Lengthening insensitive property : GPPP-PT-C1000N0000000010-LTLCardinality-15
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Graph (trivial) has 2 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 29 transition count 18
Applied a total of 3 rules in 9 ms. Remains 29 /32 variables (removed 3) and now considering 18/21 (removed 3) transitions.
Running 17 sub problems to find dead transitions.
// Phase 1: matrix 18 rows 29 cols
[2024-05-31 23:15:59] [INFO ] Computed 12 invariants in 2 ms
[2024-05-31 23:15:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/28 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/29 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 17/46 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/47 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/47 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/28 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/29 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 17/46 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/47 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/47 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 59 constraints, problems are : Problem set: 0 solved, 17 unsolved in 7978 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 8270ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 8272ms
[2024-05-31 23:16:07] [INFO ] Invariant cache hit.
[2024-05-31 23:16:07] [INFO ] Implicit Places using invariants in 36 ms returned [0, 2, 16, 22]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 25/32 places, 18/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 8319 ms. Remains : 25/32 places, 18/21 transitions.
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLCardinality-15
Product exploration explored 100000 steps with 242 reset in 99 ms.
Product exploration explored 100000 steps with 242 reset in 106 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 57 edges and 25 vertex of which 23 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 25214 steps (62 resets) in 84 ms. (296 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 209 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Running 17 sub problems to find dead transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-31 23:16:08] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:16:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 17/41 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/42 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 26 constraints, problems are : Problem set: 0 solved, 17 unsolved in 227 ms.
Refiners :[State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 17/41 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/42 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 43 constraints, problems are : Problem set: 0 solved, 17 unsolved in 377 ms.
Refiners :[State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 611ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 613ms
// Phase 1: matrix 18 rows 25 cols
[2024-05-31 23:16:09] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:16:09] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2024-05-31 23:16:09] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:16:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:16:09] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-31 23:16:09] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:16:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 17/41 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/42 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 26 constraints, problems are : Problem set: 0 solved, 17 unsolved in 217 ms.
Refiners :[State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 17/41 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/42 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 43 constraints, problems are : Problem set: 0 solved, 17 unsolved in 382 ms.
Refiners :[State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 607ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 607ms
Finished structural reductions in LTL mode , in 1 iterations and 1287 ms. Remains : 25/25 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 57 edges and 25 vertex of which 23 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 32025 steps (76 resets) in 33 ms. (941 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 191 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 241 reset in 107 ms.
Product exploration explored 100000 steps with 242 reset in 112 ms.
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Running 17 sub problems to find dead transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-31 23:16:10] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:16:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 17/41 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/42 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 26 constraints, problems are : Problem set: 0 solved, 17 unsolved in 228 ms.
Refiners :[State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 17/41 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/42 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 43 constraints, problems are : Problem set: 0 solved, 17 unsolved in 376 ms.
Refiners :[State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 610ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 610ms
// Phase 1: matrix 18 rows 25 cols
[2024-05-31 23:16:11] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:16:11] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2024-05-31 23:16:11] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:16:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:16:11] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-31 23:16:11] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:16:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 17/41 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/42 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 26 constraints, problems are : Problem set: 0 solved, 17 unsolved in 202 ms.
Refiners :[State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 17/41 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/42 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 43 constraints, problems are : Problem set: 0 solved, 17 unsolved in 372 ms.
Refiners :[State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 580ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 581ms
Finished structural reductions in LTL mode , in 1 iterations and 1248 ms. Remains : 25/25 places, 18/18 transitions.
Treatment of property GPPP-PT-C1000N0000000010-LTLCardinality-15 finished in 13028 ms.
[2024-05-31 23:16:11] [INFO ] Flatten gal took : 3 ms
[2024-05-31 23:16:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-31 23:16:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 21 transitions and 78 arcs took 2 ms.
Total runtime 35714 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : GPPP-PT-C1000N0000000010-LTLCardinality-15

BK_STOP 1717197422770

--------------------
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 GPPP-PT-C1000N0000000010-LTLCardinality-15
ltl formula formula --ltl=/tmp/1117/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 32 places, 21 transitions and 78 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( 3/ 4): LTL layer: formula: /tmp/1117/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1117/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1117/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1117/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 33 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 33, there are 30 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): ~300 levels ~10000 states ~56936 transitions
pnml2lts-mc( 0/ 4): ~300 levels ~20000 states ~123864 transitions
pnml2lts-mc( 0/ 4): ~300 levels ~40000 states ~261880 transitions
pnml2lts-mc( 0/ 4): ~300 levels ~80000 states ~542552 transitions
pnml2lts-mc( 0/ 4): ~300 levels ~160000 states ~1110056 transitions
pnml2lts-mc( 0/ 4): ~300 levels ~320000 states ~2264312 transitions
pnml2lts-mc( 0/ 4): ~334 levels ~640000 states ~4527292 transitions
pnml2lts-mc( 0/ 4): ~366 levels ~1280000 states ~9107912 transitions
pnml2lts-mc( 2/ 4): ~717 levels ~2560000 states ~26352572 transitions
pnml2lts-mc( 2/ 4): ~717 levels ~5120000 states ~54318764 transitions
pnml2lts-mc( 1/ 4): ~410 levels ~10240000 states ~107552300 transitions
pnml2lts-mc( 1/ 4): ~410 levels ~20480000 states ~218086068 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 17310621
pnml2lts-mc( 0/ 4): unique states count: 19413976
pnml2lts-mc( 0/ 4): unique transitions count: 212509921
pnml2lts-mc( 0/ 4): - self-loop count: 8
pnml2lts-mc( 0/ 4): - claim dead count: 187878957
pnml2lts-mc( 0/ 4): - claim found count: 5306968
pnml2lts-mc( 0/ 4): - claim success count: 19435687
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1930
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 19438769 states 212827067 transitions, fanout: 10.949
pnml2lts-mc( 0/ 4): Total exploration time 50.060 sec (50.050 sec minimum, 50.057 sec on average)
pnml2lts-mc( 0/ 4): States per second: 388309, Transitions per second: 4251440
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 212.1MB, 11.5 B/state, compr.: 8.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 57.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 212.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="GPPP-PT-C1000N0000000010"
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 GPPP-PT-C1000N0000000010, 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 r496-tall-171640603400443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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