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.r180-tall-171640603200355.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 itstools
Input is GPPP-PT-C0001N0000001000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603200355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.6K 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 May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 12 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 08:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 12 08:47 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-C0001N0000001000-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716495470201

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000001000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-23 20:17:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 20:17:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:17:51] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2024-05-23 20:17:51] [INFO ] Transformed 33 places.
[2024-05-23 20:17:51] [INFO ] Transformed 22 transitions.
[2024-05-23 20:17:51] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 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 10 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-23 20:17:51] [INFO ] Computed 13 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 817 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 1276ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1287ms
[2024-05-23 20:17:53] [INFO ] Invariant cache hit.
[2024-05-23 20:17:53] [INFO ] Implicit Places using invariants in 47 ms returned [1, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1387 ms. Remains : 31/33 places, 22/22 transitions.
Support contains 27 out of 31 places after structural reductions.
[2024-05-23 20:17:53] [INFO ] Flatten gal took : 16 ms
[2024-05-23 20:17:53] [INFO ] Flatten gal took : 6 ms
[2024-05-23 20:17:53] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 26 out of 31 places (down from 27) after GAL structural reductions.
RANDOM walk for 40010 steps (8 resets) in 962 ms. (41 steps per ms) remains 7/27 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
// Phase 1: matrix 22 rows 31 cols
[2024-05-23 20:17:54] [INFO ] Computed 11 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 2 (OVERLAPS) 8/18 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 4 (OVERLAPS) 11/29 variables, 4/9 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/31 variables, 2/11 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 22/53 variables, 31/42 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 0/42 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/53 variables, 0/42 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 42 constraints, problems are : Problem set: 5 solved, 2 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 1/4 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/28 variables, 4/8 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/31 variables, 3/11 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 22/53 variables, 31/42 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 2/44 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 44 constraints, problems are : Problem set: 5 solved, 2 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 255ms problems are : Problem set: 5 solved, 2 unsolved
Finished Parikh walk after 34579 steps, including 0 resets, run visited all 2 properties in 116 ms. (steps per millisecond=298 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 120 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-08 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' '!(F(G((F(p0) U X(X(p1))))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 6 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 29 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 28 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 5 place count 28 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 25 transition count 16
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 3 with 2 rules applied. Total rules applied 13 place count 24 transition count 15
Applied a total of 13 rules in 26 ms. Remains 24 /31 variables (removed 7) and now considering 15/22 (removed 7) transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 24 cols
[2024-05-23 20:17:54] [INFO ] Computed 11 invariants in 1 ms
[2024-05-23 20:17:54] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 37 constraints, problems are : Problem set: 0 solved, 14 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 2/2 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/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/39 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 51 constraints, problems are : Problem set: 0 solved, 14 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 540ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 541ms
[2024-05-23 20:17:55] [INFO ] Invariant cache hit.
[2024-05-23 20:17:55] [INFO ] Implicit Places using invariants in 36 ms returned [0, 1, 2]
[2024-05-23 20:17:55] [INFO ] Actually due to overlaps returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/31 places, 15/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 14
Applied a total of 2 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 21 cols
[2024-05-23 20:17:55] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 20:17:55] [INFO ] Implicit Places using invariants in 29 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/31 places, 14/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 639 ms. Remains : 20/31 places, 14/22 transitions.
Stuttering acceptance computed with spot in 394 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLCardinality-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLCardinality-00 finished in 1102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 31 cols
[2024-05-23 20:17:55] [INFO ] Computed 11 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/53 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 42 constraints, problems are : Problem set: 0 solved, 21 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/53 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 63 constraints, problems are : Problem set: 0 solved, 21 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 710ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 711ms
[2024-05-23 20:17:56] [INFO ] Invariant cache hit.
[2024-05-23 20:17:56] [INFO ] Implicit Places using invariants in 38 ms returned [0, 1, 2]
[2024-05-23 20:17:56] [INFO ] Actually due to overlaps returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 754 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLCardinality-02
Product exploration explored 100000 steps with 1556 reset in 226 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLCardinality-02 finished in 1109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)||(p1&&G(F(p1)))))&&X(G(p2)))))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2024-05-23 20:17:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/53 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 42 constraints, problems are : Problem set: 0 solved, 21 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/53 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 63 constraints, problems are : Problem set: 0 solved, 21 unsolved in 521 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 741ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 741ms
[2024-05-23 20:17:57] [INFO ] Invariant cache hit.
[2024-05-23 20:17:57] [INFO ] Implicit Places using invariants in 35 ms returned [0, 1]
[2024-05-23 20:17:57] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 779 ms. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 60 steps with 1 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLCardinality-03 finished in 1098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 8 edges and 31 vertex of which 2 / 31 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 30 transition count 17
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 26 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 9 place count 26 transition count 15
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 2 with 5 rules applied. Total rules applied 14 place count 23 transition count 15
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 19 place count 20 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 18 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 17 transition count 11
Applied a total of 24 rules in 6 ms. Remains 17 /31 variables (removed 14) and now considering 11/22 (removed 11) transitions.
Running 10 sub problems to find dead transitions.
// Phase 1: matrix 11 rows 17 cols
[2024-05-23 20:17:58] [INFO ] Computed 8 invariants in 0 ms
[2024-05-23 20:17:58] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1/28 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/28 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 27 constraints, problems are : Problem set: 0 solved, 10 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 17/17 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 10/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1/28 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/28 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 37 constraints, problems are : Problem set: 0 solved, 10 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 17/17 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 324ms
[2024-05-23 20:17:58] [INFO ] Invariant cache hit.
[2024-05-23 20:17:58] [INFO ] Implicit Places using invariants in 29 ms returned [0, 1]
[2024-05-23 20:17:58] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/31 places, 11/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 363 ms. Remains : 16/31 places, 11/22 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLCardinality-06
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLCardinality-06 finished in 469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(p1||(p2&&X(X(G(!p2))))))))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 31 cols
[2024-05-23 20:17:58] [INFO ] Computed 11 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/53 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 42 constraints, problems are : Problem set: 0 solved, 21 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/53 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 63 constraints, problems are : Problem set: 0 solved, 21 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 717ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 717ms
[2024-05-23 20:17:59] [INFO ] Invariant cache hit.
[2024-05-23 20:17:59] [INFO ] Implicit Places using invariants in 38 ms returned [0, 1, 2]
[2024-05-23 20:17:59] [INFO ] Actually due to overlaps returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 761 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), p2, p2]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLCardinality-09 finished in 960 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((F(G(p1))||G(p2))))))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 21
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 30 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 29 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4 place count 29 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 8 place count 27 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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 26 transition count 17
Applied a total of 10 rules in 10 ms. Remains 26 /31 variables (removed 5) and now considering 17/22 (removed 5) transitions.
Running 16 sub problems to find dead transitions.
// Phase 1: matrix 17 rows 26 cols
[2024-05-23 20:17:59] [INFO ] Computed 11 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 17/43 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 37 constraints, problems are : Problem set: 0 solved, 16 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 17/43 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 53 constraints, problems are : Problem set: 0 solved, 16 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 515ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 515ms
[2024-05-23 20:18:00] [INFO ] Invariant cache hit.
[2024-05-23 20:18:00] [INFO ] Implicit Places using invariants in 37 ms returned [0, 1, 2]
[2024-05-23 20:18:00] [INFO ] Actually due to overlaps returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/31 places, 17/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 16
Applied a total of 2 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 23 cols
[2024-05-23 20:18:00] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 20:18:00] [INFO ] Implicit Places using invariants in 23 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/31 places, 16/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 593 ms. Remains : 22/31 places, 16/22 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 166 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLCardinality-10 finished in 907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 31 cols
[2024-05-23 20:18:00] [INFO ] Computed 11 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/53 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 42 constraints, problems are : Problem set: 0 solved, 21 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/53 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 63 constraints, problems are : Problem set: 0 solved, 21 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 678ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 679ms
[2024-05-23 20:18:01] [INFO ] Invariant cache hit.
[2024-05-23 20:18:01] [INFO ] Implicit Places using invariants in 33 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 715 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLCardinality-12
Product exploration explored 100000 steps with 25000 reset in 69 ms.
Product exploration explored 100000 steps with 25000 reset in 77 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 414 steps (0 resets) in 4 ms. (82 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 29 cols
[2024-05-23 20:18:02] [INFO ] Computed 9 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/51 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 38 constraints, problems are : Problem set: 0 solved, 21 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/51 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 59 constraints, problems are : Problem set: 0 solved, 21 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 611ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 612ms
[2024-05-23 20:18:02] [INFO ] Invariant cache hit.
[2024-05-23 20:18:02] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 20:18:02] [INFO ] Invariant cache hit.
[2024-05-23 20:18:02] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 21 sub problems to find dead transitions.
[2024-05-23 20:18:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/51 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 38 constraints, problems are : Problem set: 0 solved, 21 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/51 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 59 constraints, problems are : Problem set: 0 solved, 21 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 584ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 585ms
Finished structural reductions in LTL mode , in 1 iterations and 1271 ms. Remains : 29/29 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 463 steps (0 resets) in 10 ms. (42 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 59 ms.
Product exploration explored 100000 steps with 25000 reset in 55 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Graph (trivial) has 7 edges and 29 vertex of which 2 / 29 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.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 28 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 28 transition count 22
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 28 transition count 22
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 26 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 26 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 26 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 25 transition count 19
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 25 transition count 19
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 14 rules in 12 ms. Remains 25 /29 variables (removed 4) and now considering 19/22 (removed 3) transitions.
Running 18 sub problems to find dead transitions.
// Phase 1: matrix 19 rows 25 cols
[2024-05-23 20:18:04] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 20:18:04] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
At refinement iteration 5 (OVERLAPS) 18/43 variables, 25/34 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/35 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/44 variables, 1/36 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/36 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/44 variables, 0/36 constraints. Problems are: Problem set: 5 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 36 constraints, problems are : Problem set: 5 solved, 13 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 3/23 variables, 2/6 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 2/25 variables, 3/9 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 18/43 variables, 25/34 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 1/35 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 13/48 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/48 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/44 variables, 1/49 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/44 variables, 0/49 constraints. Problems are: Problem set: 5 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/44 variables, 0/49 constraints. Problems are: Problem set: 5 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 49 constraints, problems are : Problem set: 5 solved, 13 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 425ms problems are : Problem set: 5 solved, 13 unsolved
Search for dead transitions found 5 dead transitions in 426ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 5 transitions.
[2024-05-23 20:18:05] [INFO ] Redundant transitions in 0 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 25/29 places, 14/22 transitions.
Graph (complete) has 50 edges and 25 vertex of which 21 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 3 ms. Remains 20 /25 variables (removed 5) and now considering 14/14 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/29 places, 14/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 450 ms. Remains : 20/29 places, 14/22 transitions.
Built C files in :
/tmp/ltsmin16076079443399458330
[2024-05-23 20:18:05] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16076079443399458330
Running compilation step : cd /tmp/ltsmin16076079443399458330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 212 ms.
Running link step : cd /tmp/ltsmin16076079443399458330;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16076079443399458330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16158163703740556785.hoa' '--buchi-type=spotba'
LTSmin run took 280 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000001000-LTLCardinality-12 finished in 5241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 6 edges and 31 vertex of which 2 / 31 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.
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 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 29 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 28 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 5 place count 28 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 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 3 with 5 rules applied. Total rules applied 14 place count 23 transition count 15
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 3 with 3 rules applied. Total rules applied 17 place count 21 transition count 14
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 3 with 2 rules applied. Total rules applied 19 place count 20 transition count 13
Applied a total of 19 rules in 7 ms. Remains 20 /31 variables (removed 11) and now considering 13/22 (removed 9) transitions.
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 20 cols
[2024-05-23 20:18:05] [INFO ] Computed 9 invariants in 0 ms
[2024-05-23 20:18:05] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 12/32 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/33 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/33 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 31 constraints, problems are : Problem set: 0 solved, 12 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 12/32 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 12/42 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/33 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/33 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 43 constraints, problems are : Problem set: 0 solved, 12 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 383ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 383ms
[2024-05-23 20:18:06] [INFO ] Invariant cache hit.
[2024-05-23 20:18:06] [INFO ] Implicit Places using invariants in 36 ms returned [0, 1, 2]
[2024-05-23 20:18:06] [INFO ] Actually due to overlaps returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/31 places, 13/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 12
Applied a total of 2 rules in 2 ms. Remains 17 /18 variables (removed 1) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-05-23 20:18:06] [INFO ] Computed 7 invariants in 2 ms
[2024-05-23 20:18:06] [INFO ] Implicit Places using invariants in 24 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/31 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 455 ms. Remains : 16/31 places, 12/22 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLCardinality-14
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLCardinality-14 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 31 cols
[2024-05-23 20:18:06] [INFO ] Computed 11 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/53 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 42 constraints, problems are : Problem set: 0 solved, 21 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/53 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 63 constraints, problems are : Problem set: 0 solved, 21 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 721ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 722ms
[2024-05-23 20:18:06] [INFO ] Invariant cache hit.
[2024-05-23 20:18:06] [INFO ] Implicit Places using invariants in 38 ms returned [0, 1, 2]
[2024-05-23 20:18:06] [INFO ] Actually due to overlaps returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 762 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLCardinality-15 finished in 854 ms.
All properties solved by simple procedures.
Total runtime 15680 ms.

BK_STOP 1716495487119

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0001N0000001000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is GPPP-PT-C0001N0000001000, 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 r180-tall-171640603200355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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