Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640603300387.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is GPPP-PT-C0010N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603300387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 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.5K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 12 08:54 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-C0010N0000000100-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0010N0000000100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717196189229

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0010N0000000100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:56:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:56:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:56:30] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2024-05-31 22:56:30] [INFO ] Transformed 33 places.
[2024-05-31 22:56:30] [INFO ] Transformed 22 transitions.
[2024-05-31 22:56:30] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 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 11 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-31 22:56:30] [INFO ] Computed 12 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 6 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 1 solved, 20 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 20/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/55 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 65 constraints, problems are : Problem set: 1 solved, 20 unsolved in 2640 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 3115ms problems are : Problem set: 1 solved, 20 unsolved
Search for dead transitions found 1 dead transitions in 3131ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
// Phase 1: matrix 21 rows 33 cols
[2024-05-31 22:56:33] [INFO ] Computed 13 invariants in 3 ms
[2024-05-31 22:56:33] [INFO ] Implicit Places using invariants in 43 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 21/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3239 ms. Remains : 31/33 places, 21/22 transitions.
Support contains 30 out of 31 places after structural reductions.
[2024-05-31 22:56:34] [INFO ] Flatten gal took : 16 ms
[2024-05-31 22:56:34] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:56:34] [INFO ] Input system was already deterministic with 21 transitions.
RANDOM walk for 40023 steps (94 resets) in 431 ms. (92 steps per ms) remains 5/27 properties
BEST_FIRST walk for 40004 steps (20 resets) in 214 ms. (186 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (16 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 22:56:34] [INFO ] Computed 11 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 8/17 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 4 (OVERLAPS) 11/28 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 3/31 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 8 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/42 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/52 variables, 0/42 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 42 constraints, problems are : Problem set: 4 solved, 1 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/24 variables, 4/6 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Int declared 27/52 variables, and 9 constraints, problems are : Problem set: 5 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/31 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 29 stabilizing places and 19 stable transitions
Graph (complete) has 69 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0&&X(X(p1))))) U (p2||G(F(p3)))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 21
Applied a total of 1 rules in 7 ms. Remains 30 /31 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 30 cols
[2024-05-31 22:56:34] [INFO ] Computed 10 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 40 constraints, problems are : Problem set: 0 solved, 20 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 60 constraints, problems are : Problem set: 0 solved, 20 unsolved in 11146 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 11400ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 11402ms
[2024-05-31 22:56:46] [INFO ] Invariant cache hit.
[2024-05-31 22:56:46] [INFO ] Implicit Places using invariants in 39 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11451 ms. Remains : 29/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 551 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-02
Product exploration explored 100000 steps with 605 reset in 231 ms.
Stack based approach found an accepted trace after 68 steps with 0 reset with depth 69 and stack size 69 in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-02 finished in 12304 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)&&G(p1))))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 21
Applied a total of 1 rules in 2 ms. Remains 30 /31 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-31 22:56:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 40 constraints, problems are : Problem set: 0 solved, 20 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 60 constraints, problems are : Problem set: 0 solved, 20 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 532ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 534ms
[2024-05-31 22:56:47] [INFO ] Invariant cache hit.
[2024-05-31 22:56:47] [INFO ] Implicit Places using invariants in 39 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 577 ms. Remains : 29/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-04 finished in 941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 21
Applied a total of 1 rules in 2 ms. Remains 30 /31 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-31 22:56:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 40 constraints, problems are : Problem set: 0 solved, 20 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 60 constraints, problems are : Problem set: 0 solved, 20 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 588ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 594ms
[2024-05-31 22:56:48] [INFO ] Invariant cache hit.
[2024-05-31 22:56:48] [INFO ] Implicit Places using invariants in 35 ms returned [17]
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 : 29/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 634 ms. Remains : 29/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-05 finished in 728 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(X(F(p0))))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 21
Applied a total of 1 rules in 1 ms. Remains 30 /31 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-31 22:56:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 40 constraints, problems are : Problem set: 0 solved, 20 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 60 constraints, problems are : Problem set: 0 solved, 20 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 548ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 548ms
[2024-05-31 22:56:49] [INFO ] Invariant cache hit.
[2024-05-31 22:56:49] [INFO ] Implicit Places using invariants in 32 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 586 ms. Remains : 29/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-06
Product exploration explored 100000 steps with 6952 reset in 129 ms.
Stack based approach found an accepted trace after 46 steps with 2 reset with depth 21 and stack size 21 in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-06 finished in 931 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||(p1 U p2))))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 21
Applied a total of 1 rules in 1 ms. Remains 30 /31 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-31 22:56:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 40 constraints, problems are : Problem set: 0 solved, 20 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 60 constraints, problems are : Problem set: 0 solved, 20 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 546ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 547ms
[2024-05-31 22:56:50] [INFO ] Invariant cache hit.
[2024-05-31 22:56:50] [INFO ] Implicit Places using invariants in 34 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 584 ms. Remains : 29/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 65 ms.
Product exploration explored 100000 steps with 33333 reset in 86 ms.
Computed a total of 27 stabilizing places and 19 stable transitions
Computed a total of 27 stabilizing places and 19 stable transitions
Detected a total of 27/29 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-07 finished in 909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 69 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 29 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7 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 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 10 place count 25 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 13 place count 23 transition count 16
Applied a total of 13 rules in 11 ms. Remains 23 /31 variables (removed 8) and now considering 16/21 (removed 5) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 23 cols
[2024-05-31 22:56:50] [INFO ] Computed 8 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/39 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 31 constraints, problems are : Problem set: 0 solved, 15 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/39 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 15/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 46 constraints, problems are : Problem set: 0 solved, 15 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 392ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 393ms
[2024-05-31 22:56:51] [INFO ] Invariant cache hit.
[2024-05-31 22:56:51] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-31 22:56:51] [INFO ] Invariant cache hit.
[2024-05-31 22:56:51] [INFO ] Implicit Places using invariants and state equation in 31 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/31 places, 16/21 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 2 iterations and 474 ms. Remains : 22/31 places, 16/21 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-08
Stuttering criterion allowed to conclude after 5241 steps with 35 reset in 18 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-08 finished in 629 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 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 21
Applied a total of 1 rules in 1 ms. Remains 30 /31 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 30 cols
[2024-05-31 22:56:51] [INFO ] Computed 10 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 40 constraints, problems are : Problem set: 0 solved, 20 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 60 constraints, problems are : Problem set: 0 solved, 20 unsolved in 11624 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 11828ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 11828ms
[2024-05-31 22:57:03] [INFO ] Invariant cache hit.
[2024-05-31 22:57:03] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 22:57:03] [INFO ] Invariant cache hit.
[2024-05-31 22:57:03] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [1, 2, 4]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 84 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/31 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11913 ms. Remains : 27/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 84 ms.
Product exploration explored 100000 steps with 33333 reset in 89 ms.
Computed a total of 25 stabilizing places and 19 stable transitions
Graph (complete) has 58 edges and 27 vertex of which 19 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Computed a total of 25 stabilizing places and 19 stable transitions
Detected a total of 25/27 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-09 finished in 12233 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 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 69 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 29 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 26 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 23 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 22 transition count 14
Applied a total of 13 rules in 9 ms. Remains 22 /31 variables (removed 9) and now considering 14/21 (removed 7) transitions.
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 22 cols
[2024-05-31 22:57:03] [INFO ] Computed 9 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/22 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 14/36 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 31 constraints, problems are : Problem set: 0 solved, 13 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 14/36 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 44 constraints, problems are : Problem set: 0 solved, 13 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 278ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 278ms
[2024-05-31 22:57:03] [INFO ] Invariant cache hit.
[2024-05-31 22:57:03] [INFO ] Implicit Places using invariants in 34 ms returned [0, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/31 places, 14/21 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 20 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 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 5 place count 17 transition count 12
Applied a total of 5 rules in 3 ms. Remains 17 /20 variables (removed 3) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-05-31 22:57:03] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 22:57:03] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-31 22:57:03] [INFO ] Invariant cache hit.
[2024-05-31 22:57:04] [INFO ] Implicit Places using invariants and state equation in 28 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/31 places, 12/21 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 382 ms. Remains : 16/31 places, 12/21 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-11
Stuttering criterion allowed to conclude after 208 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-11 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 69 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 29 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 10 place count 25 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 23 transition count 16
Applied a total of 13 rules in 10 ms. Remains 23 /31 variables (removed 8) and now considering 16/21 (removed 5) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 23 cols
[2024-05-31 22:57:04] [INFO ] Computed 8 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/39 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 31 constraints, problems are : Problem set: 0 solved, 15 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/39 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 15/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 46 constraints, problems are : Problem set: 0 solved, 15 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 367ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 367ms
[2024-05-31 22:57:04] [INFO ] Invariant cache hit.
[2024-05-31 22:57:04] [INFO ] Implicit Places using invariants in 27 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/31 places, 16/21 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 15
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 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 21 transition count 14
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 4 place count 20 transition count 14
Applied a total of 4 rules in 13 ms. Remains 20 /22 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 20 cols
[2024-05-31 22:57:04] [INFO ] Computed 7 invariants in 1 ms
[2024-05-31 22:57:04] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-31 22:57:04] [INFO ] Invariant cache hit.
[2024-05-31 22:57:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 54 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/31 places, 14/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 474 ms. Remains : 19/31 places, 14/21 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-12
Product exploration explored 100000 steps with 5539 reset in 109 ms.
Stack based approach found an accepted trace after 29 steps with 1 reset with depth 15 and stack size 15 in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-12 finished in 652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 21
Applied a total of 1 rules in 1 ms. Remains 30 /31 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 30 cols
[2024-05-31 22:57:04] [INFO ] Computed 10 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 40 constraints, problems are : Problem set: 0 solved, 20 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 60 constraints, problems are : Problem set: 0 solved, 20 unsolved in 12005 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 12188ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 12189ms
[2024-05-31 22:57:16] [INFO ] Invariant cache hit.
[2024-05-31 22:57:16] [INFO ] Implicit Places using invariants in 37 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12228 ms. Remains : 29/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-13 finished in 12326 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(X(F((p0 U (p1||G(p0)))))))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 21
Applied a total of 1 rules in 1 ms. Remains 30 /31 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-31 22:57:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 40 constraints, problems are : Problem set: 0 solved, 20 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 60 constraints, problems are : Problem set: 0 solved, 20 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 529ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 530ms
[2024-05-31 22:57:17] [INFO ] Invariant cache hit.
[2024-05-31 22:57:17] [INFO ] Implicit Places using invariants in 34 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 568 ms. Remains : 29/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-15
Product exploration explored 100000 steps with 17994 reset in 69 ms.
Product exploration explored 100000 steps with 17936 reset in 63 ms.
Computed a total of 27 stabilizing places and 19 stable transitions
Computed a total of 27 stabilizing places and 19 stable transitions
Detected a total of 27/29 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1140 steps (0 resets) in 5 ms. (190 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 29 cols
[2024-05-31 22:57:18] [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, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/50 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 38 constraints, problems are : Problem set: 0 solved, 20 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/50 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 58 constraints, problems are : Problem set: 0 solved, 20 unsolved in 6411 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 6588ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 6589ms
[2024-05-31 22:57:25] [INFO ] Invariant cache hit.
[2024-05-31 22:57:25] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-31 22:57:25] [INFO ] Invariant cache hit.
[2024-05-31 22:57:25] [INFO ] Implicit Places using invariants and state equation in 36 ms returned [1, 2, 4]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 71 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/29 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6664 ms. Remains : 26/29 places, 21/21 transitions.
Computed a total of 24 stabilizing places and 19 stable transitions
Graph (complete) has 53 edges and 26 vertex of which 19 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 24 stabilizing places and 19 stable transitions
Detected a total of 24/26 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1072 steps (0 resets) in 7 ms. (134 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17980 reset in 58 ms.
Product exploration explored 100000 steps with 17953 reset in 60 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 21/21 transitions.
Graph (trivial) has 7 edges and 26 vertex of which 2 / 26 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 51 edges and 25 vertex of which 18 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 18 transition count 13
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 17 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 17 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 6 rules in 15 ms. Remains 17 /26 variables (removed 9) and now considering 12/21 (removed 9) transitions.
Running 11 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-05-31 22:57:27] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 22:57:27] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem TDEAD8 is UNSAT
At refinement iteration 4 (OVERLAPS) 11/28 variables, 17/23 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/29 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/29 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 25 constraints, problems are : Problem set: 1 solved, 10 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 17/17 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2/17 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/28 variables, 17/23 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 10/34 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1/29 variables, 1/35 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/29 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 35 constraints, problems are : Problem set: 1 solved, 10 unsolved in 1235 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 17/17 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 1374ms problems are : Problem set: 1 solved, 10 unsolved
Search for dead transitions found 1 dead transitions in 1375ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2024-05-31 22:57:28] [INFO ] Redundant transitions in 0 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 17/26 places, 11/21 transitions.
Graph (complete) has 36 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 16 /17 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/26 places, 11/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1397 ms. Remains : 16/26 places, 11/21 transitions.
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 26 cols
[2024-05-31 22:57:28] [INFO ] Computed 6 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/47 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/47 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 32 constraints, problems are : Problem set: 0 solved, 20 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/47 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/47 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 52 constraints, problems are : Problem set: 0 solved, 20 unsolved in 9295 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 9451ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 9452ms
[2024-05-31 22:57:37] [INFO ] Invariant cache hit.
[2024-05-31 22:57:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-31 22:57:37] [INFO ] Invariant cache hit.
[2024-05-31 22:57:37] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-31 22:57:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/47 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/47 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 32 constraints, problems are : Problem set: 0 solved, 20 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/47 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/47 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 52 constraints, problems are : Problem set: 0 solved, 20 unsolved in 29807 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 29974ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 29974ms
Finished structural reductions in LTL mode , in 1 iterations and 39489 ms. Remains : 26/26 places, 21/21 transitions.
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-15 finished in 50919 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(X(F((p0 U (p1||G(p0)))))))))'
Found a Shortening insensitive property : GPPP-PT-C0010N0000000100-LTLCardinality-15
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (trivial) has 4 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.
Graph (complete) has 67 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 28 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 25 transition count 16
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 15 place count 21 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 18 place count 19 transition count 12
Applied a total of 18 rules in 6 ms. Remains 19 /31 variables (removed 12) and now considering 12/21 (removed 9) transitions.
Running 11 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 19 cols
[2024-05-31 22:58:08] [INFO ] Computed 8 invariants in 0 ms
[2024-05-31 22:58:08] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 11/30 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 29 constraints, problems are : Problem set: 0 solved, 11 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 19/19 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 11/30 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/31 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 40 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5930 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 19/19 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 6066ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 6066ms
[2024-05-31 22:58:14] [INFO ] Invariant cache hit.
[2024-05-31 22:58:14] [INFO ] Implicit Places using invariants in 26 ms returned [0, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 17/31 places, 12/21 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 17 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 16 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 14 transition count 10
Applied a total of 5 rules in 2 ms. Remains 14 /17 variables (removed 3) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 14 cols
[2024-05-31 22:58:14] [INFO ] Computed 5 invariants in 1 ms
[2024-05-31 22:58:14] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 22:58:14] [INFO ] Invariant cache hit.
[2024-05-31 22:58:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:58:14] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 14/31 places, 10/21 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 6150 ms. Remains : 14/31 places, 10/21 transitions.
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-15
Stuttering criterion allowed to conclude after 527 steps with 77 reset in 2 ms.
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-15 finished in 6465 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-31 22:58:14] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:58:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 22:58:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 21 transitions and 74 arcs took 3 ms.
Total runtime 104115 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717196294676

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name GPPP-PT-C0010N0000000100-LTLCardinality-15
ltl formula formula --ltl=/tmp/1167/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 31 places, 21 transitions and 74 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1167/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1167/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1167/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1167/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 31 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 32, there are 29 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13
pnml2lts-mc( 0/ 4): unique states count: 15
pnml2lts-mc( 0/ 4): unique transitions count: 17
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2
pnml2lts-mc( 0/ 4): - claim found count: 4
pnml2lts-mc( 0/ 4): - claim success count: 41
pnml2lts-mc( 0/ 4): - cum. max stack depth: 31
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 41 states 64 transitions, fanout: 1.561
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 69.9 B/state, compr.: 53.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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