Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r500-smll-171649587400059.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 HirschbergSinclair-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587400059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 03:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 13 03:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 03:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 03:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 157K 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 HirschbergSinclair-PT-05-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717237003274

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:16:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:16:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:16:45] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-06-01 10:16:45] [INFO ] Transformed 124 places.
[2024-06-01 10:16:45] [INFO ] Transformed 111 transitions.
[2024-06-01 10:16:45] [INFO ] Parsed PT model containing 124 places and 111 transitions and 340 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 118 transition count 109
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 118 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 117 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 117 transition count 108
Applied a total of 10 rules in 56 ms. Remains 117 /124 variables (removed 7) and now considering 108/111 (removed 3) transitions.
// Phase 1: matrix 108 rows 117 cols
[2024-06-01 10:16:46] [INFO ] Computed 9 invariants in 28 ms
[2024-06-01 10:16:46] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-06-01 10:16:46] [INFO ] Invariant cache hit.
[2024-06-01 10:16:46] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-06-01 10:16:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 2/113 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 4/117 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 108/225 variables, 117/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 126 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 2/113 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 4/117 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 108/225 variables, 117/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 103/229 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 229 constraints, problems are : Problem set: 0 solved, 103 unsolved in 8676 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 13954ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 13988ms
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 108/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14807 ms. Remains : 117/124 places, 108/111 transitions.
Support contains 38 out of 117 places after structural reductions.
[2024-06-01 10:17:01] [INFO ] Flatten gal took : 67 ms
[2024-06-01 10:17:01] [INFO ] Flatten gal took : 32 ms
[2024-06-01 10:17:01] [INFO ] Input system was already deterministic with 108 transitions.
Support contains 36 out of 117 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (359 resets) in 2103 ms. (19 steps per ms) remains 7/28 properties
BEST_FIRST walk for 40002 steps (104 resets) in 283 ms. (140 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (107 resets) in 327 ms. (121 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (105 resets) in 310 ms. (128 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (105 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (108 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (86 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (109 resets) in 171 ms. (232 steps per ms) remains 7/7 properties
[2024-06-01 10:17:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 5/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 93/105 variables, 7/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/110 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 7 (OVERLAPS) 108/218 variables, 110/119 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/119 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Real declared 225/225 variables, and 126 constraints, problems are : Problem set: 7 solved, 0 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 364ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 117 stabilizing places and 108 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 117 transition count 108
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(p1) U (!((p2 U p3)&&p2) U G(p0)))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 112 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 110 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 110 transition count 102
Applied a total of 13 rules in 41 ms. Remains 110 /117 variables (removed 7) and now considering 102/108 (removed 6) transitions.
// Phase 1: matrix 102 rows 110 cols
[2024-06-01 10:17:03] [INFO ] Computed 8 invariants in 4 ms
[2024-06-01 10:17:03] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 10:17:03] [INFO ] Invariant cache hit.
[2024-06-01 10:17:03] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-06-01 10:17:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 118 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3037 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 97/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 215 constraints, problems are : Problem set: 0 solved, 97 unsolved in 8915 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
After SMT, in 11994ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 11996ms
Starting structural reductions in LTL mode, iteration 1 : 110/117 places, 102/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12383 ms. Remains : 110/117 places, 102/108 transitions.
Stuttering acceptance computed with spot in 1320 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p3 (NOT p1)), (AND (NOT p0) (NOT p1)), true, (OR (AND p1 (NOT p2) p3) (AND p0 p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) p3 p1), (AND p0 (NOT p1)), false, (NOT p0), (AND p0 (NOT p1) p3), false, false]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-00
Product exploration explored 100000 steps with 28446 reset in 660 ms.
Product exploration explored 100000 steps with 28734 reset in 288 ms.
Computed a total of 110 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 110 transition count 102
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT p2)), (X p3), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p0) p2 p3 (NOT p1)))), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1))))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT p2))), (X (X (OR (AND p0 p3) (AND (NOT p2) p3 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p3)), (X (X (NOT (AND p0 p2 p3 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p0) p2 p3 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p3) (NOT p1)))))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p0 p2 p3)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1)))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 44 factoid took 7004 ms. Reduced automaton from 16 states, 43 edges and 4 AP (stutter sensitive) to 13 states, 39 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 821 ms :[(NOT p0), (AND (NOT p0) (NOT p2) p3 (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), true, (OR (AND p1 (NOT p2) p3) (AND p0 p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) p3 p1), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1) p3), false, false]
RANDOM walk for 40000 steps (359 resets) in 1713 ms. (23 steps per ms) remains 15/30 properties
BEST_FIRST walk for 4002 steps (9 resets) in 57 ms. (69 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (9 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
[2024-06-01 10:17:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 95/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/103 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem apf1 is UNSAT
Problem apf6 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
Problem apf12 is UNSAT
Problem apf16 is UNSAT
Problem apf18 is UNSAT
Problem apf19 is UNSAT
Problem apf20 is UNSAT
Problem apf23 is UNSAT
Problem apf24 is UNSAT
Problem apf25 is UNSAT
Problem apf26 is UNSAT
Problem apf28 is UNSAT
After SMT solving in domain Real declared 205/212 variables, and 111 constraints, problems are : Problem set: 15 solved, 0 unsolved in 403 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 103/110 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 426ms problems are : Problem set: 15 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 15 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT p2)), (X p3), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p0) p2 p3 (NOT p1)))), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1))))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT p2))), (X (X (OR (AND p0 p3) (AND (NOT p2) p3 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p3)), (X (X (NOT (AND p0 p2 p3 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p0) p2 p3 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p3) (NOT p1)))))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p0 p2 p3)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1)))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (G p1)), (G (OR p2 (NOT p3) (NOT p0) (NOT p1))), (G (OR (NOT p2) p3 p0 p1)), (G (OR (NOT p2) (NOT p3) p0 p1)), (G (OR (NOT p2) p3 (NOT p0) (NOT p1))), (G (OR (NOT p2) (NOT p3) (NOT p0) (NOT p1))), (G (OR (NOT p2) p3 (NOT p0))), (G (OR (NOT p0) p1)), (G (OR (NOT p2) p3 (NOT p0) p1)), (G (AND (OR p2 (NOT p0) p1) (OR p3 (NOT p0) p1))), (G (OR (NOT p2) p3 p0)), (G (OR (NOT p2) (NOT p3) (NOT p0) p1)), (G (OR (NOT p2) p3 p0 (NOT p1))), (G (OR (NOT p3) (NOT p0) p1)), (G (OR p2 (NOT p3) (NOT p0) p1)), (G (OR (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (AND (OR p2 p0 p1) (OR p3 p0 p1)))), (F (NOT (AND (OR p2 (NOT p0)) (OR p3 (NOT p0)) (OR (NOT p0) (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p3) p0 (NOT p1)))), (F p2), (F (NOT p1)), (F (NOT p3)), (F p0), (F (NOT (OR (AND (NOT p2) p3 p1) (AND p3 p0)))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))))), (F (NOT (OR p2 (NOT p3) p0 p1))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0)) (AND (NOT p0) p1)))), (F (NOT (AND (OR p2 (NOT p0) (NOT p1)) (OR p3 (NOT p0) (NOT p1))))), (F (NOT (AND (OR (NOT p2) (NOT p3) (NOT p0)) (OR (NOT p2) (NOT p3) (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p3) p0))), (F (NOT (AND (NOT p2) p3 (NOT p0) p1)))]
Knowledge based reduction with 59 factoid took 22930 ms. Reduced automaton from 13 states, 39 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p1) p2 p3)]
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p1) p2 p3)]
[2024-06-01 10:17:50] [INFO ] Invariant cache hit.
[2024-06-01 10:17:50] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 10 ms returned sat
[2024-06-01 10:17:50] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-06-01 10:17:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:17:51] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2024-06-01 10:17:51] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-06-01 10:17:51] [INFO ] Computed and/alt/rep : 47/51/47 causal constraints (skipped 50 transitions) in 20 ms.
[2024-06-01 10:17:51] [INFO ] Added : 20 causal constraints over 4 iterations in 114 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 102/102 transitions.
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 105 transition count 60
Reduce places removed 37 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 76 place count 68 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 66 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 65 transition count 57
Applied a total of 80 rules in 52 ms. Remains 65 /110 variables (removed 45) and now considering 57/102 (removed 45) transitions.
// Phase 1: matrix 57 rows 65 cols
[2024-06-01 10:17:51] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 10:17:51] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 10:17:51] [INFO ] Invariant cache hit.
[2024-06-01 10:17:51] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-06-01 10:17:51] [INFO ] Redundant transitions in 2 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 10:17:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 50/108 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/108 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/122 variables, and 66 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1092 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/65 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 50/108 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 48/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/122 variables, and 114 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1282 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/65 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 2397ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2399ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/110 places, 57/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2799 ms. Remains : 65/110 places, 57/102 transitions.
Computed a total of 65 stabilizing places and 57 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 65 transition count 57
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (AND (NOT p0) p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 4841 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p1) p2 p3)]
RANDOM walk for 40000 steps (630 resets) in 374 ms. (106 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40003 steps (196 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
[2024-06-01 10:17:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/58 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 108/122 variables, and 66 constraints, problems are : Problem set: 1 solved, 0 unsolved in 68 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (AND (NOT p0) p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 (NOT p1) p3))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)) (AND (NOT p2) p3)))), (F p2), (F (NOT p3)), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 28 factoid took 12828 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) p2 p3)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) p2 p3)]
[2024-06-01 10:18:12] [INFO ] Invariant cache hit.
[2024-06-01 10:18:12] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2024-06-01 10:18:12] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-06-01 10:18:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:18:12] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2024-06-01 10:18:13] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-01 10:18:13] [INFO ] Computed and/alt/rep : 48/52/48 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 10:18:13] [INFO ] Added : 12 causal constraints over 3 iterations in 52 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) p2 p3)]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-00 finished in 70078 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||G(p1))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 113 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 113 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 111 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 111 transition count 103
Applied a total of 11 rules in 14 ms. Remains 111 /117 variables (removed 6) and now considering 103/108 (removed 5) transitions.
// Phase 1: matrix 103 rows 111 cols
[2024-06-01 10:18:13] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 10:18:13] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-01 10:18:13] [INFO ] Invariant cache hit.
[2024-06-01 10:18:13] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-06-01 10:18:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 5/111 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 103/214 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/214 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 119 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4210 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 5/111 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 103/214 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 98/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 217 constraints, problems are : Problem set: 0 solved, 98 unsolved in 8236 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 12512ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 12515ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 103/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12963 ms. Remains : 111/117 places, 103/108 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 71 steps with 3 reset in 2 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-01 finished in 13143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 111 transition count 59
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 67 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 66 transition count 58
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 63 transition count 55
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 63 transition count 55
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 63 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 62 transition count 54
Applied a total of 99 rules in 28 ms. Remains 62 /117 variables (removed 55) and now considering 54/108 (removed 54) transitions.
// Phase 1: matrix 54 rows 62 cols
[2024-06-01 10:18:26] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 10:18:26] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 10:18:26] [INFO ] Invariant cache hit.
[2024-06-01 10:18:26] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-06-01 10:18:26] [INFO ] Redundant transitions in 2 ms returned []
Running 45 sub problems to find dead transitions.
[2024-06-01 10:18:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 48/103 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 1/104 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/116 variables, and 64 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1517 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 48/103 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 45/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 1/104 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/116 variables, and 109 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1578 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 3107ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 3108ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/117 places, 54/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3375 ms. Remains : 62/117 places, 54/108 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-04
Stuttering criterion allowed to conclude after 2708 steps with 220 reset in 8 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-04 finished in 3494 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 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 111 transition count 61
Reduce places removed 42 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 69 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 67 transition count 59
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 64 transition count 56
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 64 transition count 56
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 64 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 97 place count 63 transition count 55
Applied a total of 97 rules in 24 ms. Remains 63 /117 variables (removed 54) and now considering 55/108 (removed 53) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-06-01 10:18:29] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:18:30] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-06-01 10:18:30] [INFO ] Invariant cache hit.
[2024-06-01 10:18:30] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2024-06-01 10:18:30] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-01 10:18:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/118 variables, and 64 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1109 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/63 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 46/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/118 variables, and 110 constraints, problems are : Problem set: 0 solved, 46 unsolved in 978 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/63 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 2096ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 2098ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/117 places, 55/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2616 ms. Remains : 63/117 places, 55/108 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-07
Product exploration explored 100000 steps with 2098 reset in 243 ms.
Product exploration explored 100000 steps with 2107 reset in 391 ms.
Computed a total of 63 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 55
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 155 steps (0 resets) in 4 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 55/55 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-06-01 10:18:33] [INFO ] Invariant cache hit.
[2024-06-01 10:18:33] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-01 10:18:33] [INFO ] Invariant cache hit.
[2024-06-01 10:18:34] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-06-01 10:18:34] [INFO ] Redundant transitions in 2 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-01 10:18:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/118 variables, and 64 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1296 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/63 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 46/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/118 variables, and 110 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1000 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/63 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 2310ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 2311ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2613 ms. Remains : 63/63 places, 55/55 transitions.
Computed a total of 63 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 55
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 162 steps (0 resets) in 7 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2090 reset in 156 ms.
Product exploration explored 100000 steps with 2100 reset in 107 ms.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 55/55 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-06-01 10:18:37] [INFO ] Invariant cache hit.
[2024-06-01 10:18:37] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 10:18:37] [INFO ] Invariant cache hit.
[2024-06-01 10:18:37] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-06-01 10:18:37] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-01 10:18:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/118 variables, and 64 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1306 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/63 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 46/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/118 variables, and 110 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1262 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/63 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 2595ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 2596ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2878 ms. Remains : 63/63 places, 55/55 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-07 finished in 10444 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||G(p1)))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 111 transition count 62
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 70 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 69 transition count 61
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 66 transition count 58
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 66 transition count 58
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 66 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 65 transition count 57
Applied a total of 93 rules in 23 ms. Remains 65 /117 variables (removed 52) and now considering 57/108 (removed 51) transitions.
// Phase 1: matrix 57 rows 65 cols
[2024-06-01 10:18:40] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:18:40] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-01 10:18:40] [INFO ] Invariant cache hit.
[2024-06-01 10:18:40] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-06-01 10:18:40] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 10:18:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/109 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 1/110 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/122 variables, and 67 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1687 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 59/65 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/109 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 48/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 1/110 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/110 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/122 variables, and 115 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2073 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 59/65 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 3775ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 3778ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/117 places, 57/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4074 ms. Remains : 65/117 places, 57/108 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-09
Stuttering criterion allowed to conclude after 2622 steps with 103 reset in 6 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-09 finished in 4321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(p1)))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 109 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 109 transition count 101
Applied a total of 15 rules in 7 ms. Remains 109 /117 variables (removed 8) and now considering 101/108 (removed 7) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-06-01 10:18:44] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 10:18:44] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-01 10:18:44] [INFO ] Invariant cache hit.
[2024-06-01 10:18:45] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-01 10:18:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4065 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 8629 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 12742ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 12744ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13174 ms. Remains : 109/117 places, 101/108 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 89 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-10 finished in 13394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 112 transition count 63
Reduce places removed 41 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 44 rules applied. Total rules applied 86 place count 71 transition count 60
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 89 place count 68 transition count 60
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 93 place count 64 transition count 56
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 64 transition count 56
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 64 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 63 transition count 55
Applied a total of 99 rules in 21 ms. Remains 63 /117 variables (removed 54) and now considering 55/108 (removed 53) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-06-01 10:18:58] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 10:18:58] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 10:18:58] [INFO ] Invariant cache hit.
[2024-06-01 10:18:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:18:58] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-06-01 10:18:58] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 10:18:58] [INFO ] Invariant cache hit.
[2024-06-01 10:18:58] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 49/106 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/106 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/118 variables, and 73 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1665 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 49/106 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/118 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1511 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 3192ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 3193ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/117 places, 55/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3550 ms. Remains : 63/117 places, 55/108 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-11
Product exploration explored 100000 steps with 1663 reset in 164 ms.
Product exploration explored 100000 steps with 1664 reset in 186 ms.
Computed a total of 63 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 55
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 159 steps (0 resets) in 4 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 55/55 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-06-01 10:19:02] [INFO ] Invariant cache hit.
[2024-06-01 10:19:02] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 10:19:02] [INFO ] Invariant cache hit.
[2024-06-01 10:19:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:19:02] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-06-01 10:19:02] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 10:19:02] [INFO ] Invariant cache hit.
[2024-06-01 10:19:02] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 49/106 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/106 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/118 variables, and 73 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1492 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 49/106 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/118 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1463 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 2968ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2970ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3224 ms. Remains : 63/63 places, 55/55 transitions.
Computed a total of 63 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 55
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 153 steps (0 resets) in 6 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1665 reset in 98 ms.
Product exploration explored 100000 steps with 1664 reset in 108 ms.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 55/55 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-06-01 10:19:06] [INFO ] Invariant cache hit.
[2024-06-01 10:19:06] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 10:19:06] [INFO ] Invariant cache hit.
[2024-06-01 10:19:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:19:06] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-06-01 10:19:06] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 10:19:06] [INFO ] Invariant cache hit.
[2024-06-01 10:19:06] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 49/106 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/106 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/118 variables, and 73 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1462 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 49/106 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/118 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1148 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 2624ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2625ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2909 ms. Remains : 63/63 places, 55/55 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-11 finished in 11207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p1)||(p1&&F(p2))))||p0)))'
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 114 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 114 transition count 105
Applied a total of 6 rules in 5 ms. Remains 114 /117 variables (removed 3) and now considering 105/108 (removed 3) transitions.
// Phase 1: matrix 105 rows 114 cols
[2024-06-01 10:19:09] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 10:19:09] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-01 10:19:09] [INFO ] Invariant cache hit.
[2024-06-01 10:19:09] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-06-01 10:19:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 4/114 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 105/219 variables, 114/123 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 123 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4287 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 4/114 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 105/219 variables, 114/123 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 100/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 223 constraints, problems are : Problem set: 0 solved, 100 unsolved in 9624 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 13956ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 13958ms
Starting structural reductions in LTL mode, iteration 1 : 114/117 places, 105/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14363 ms. Remains : 114/117 places, 105/108 transitions.
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-13
Stuttering criterion allowed to conclude after 18689 steps with 177 reset in 69 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-13 finished in 14726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 112 transition count 70
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 78 transition count 70
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 74 transition count 66
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 74 transition count 66
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 2 with 1 rules applied. Total rules applied 78 place count 74 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 73 transition count 65
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 72 transition count 64
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 72 transition count 64
Applied a total of 81 rules in 19 ms. Remains 72 /117 variables (removed 45) and now considering 64/108 (removed 44) transitions.
// Phase 1: matrix 64 rows 72 cols
[2024-06-01 10:19:24] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:19:24] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-01 10:19:24] [INFO ] Invariant cache hit.
[2024-06-01 10:19:24] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-06-01 10:19:24] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-01 10:19:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 3/69 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 61/130 variables, 69/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/136 variables, and 77 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1805 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/72 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 3/69 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 61/130 variables, 69/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 58/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/136 variables, and 135 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1937 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/72 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 3759ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3761ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/117 places, 64/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4095 ms. Remains : 72/117 places, 64/108 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-15
Stuttering criterion allowed to conclude after 194 steps with 2 reset in 4 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-15 finished in 4216 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 10:19:28] [INFO ] Flatten gal took : 21 ms
[2024-06-01 10:19:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 10:19:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 108 transitions and 326 arcs took 21 ms.
Total runtime 163842 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA HirschbergSinclair-PT-05-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA HirschbergSinclair-PT-05-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717237200338

--------------------
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 HirschbergSinclair-PT-05-LTLCardinality-07
ltl formula formula --ltl=/tmp/1343/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 117 places, 108 transitions and 326 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1343/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1343/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1343/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1343/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 118 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 118, there are 111 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( 1/ 4): ~112 levels ~10000 states ~24800 transitions
pnml2lts-mc( 0/ 4): ~110 levels ~20000 states ~57368 transitions
pnml2lts-mc( 2/ 4): ~110 levels ~40000 states ~136124 transitions
pnml2lts-mc( 1/ 4): ~112 levels ~80000 states ~278572 transitions
pnml2lts-mc( 1/ 4): ~112 levels ~160000 states ~587380 transitions
pnml2lts-mc( 1/ 4): ~112 levels ~320000 states ~1243384 transitions
pnml2lts-mc( 1/ 4): ~112 levels ~640000 states ~2719268 transitions
pnml2lts-mc( 0/ 4): ~110 levels ~1280000 states ~5698440 transitions
pnml2lts-mc( 0/ 4): ~110 levels ~2560000 states ~11940284 transitions
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: 4647595
pnml2lts-mc( 0/ 4): unique states count: 4647595
pnml2lts-mc( 0/ 4): unique transitions count: 23953630
pnml2lts-mc( 0/ 4): - self-loop count: 7928
pnml2lts-mc( 0/ 4): - claim dead count: 19326592
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4658008
pnml2lts-mc( 0/ 4): - cum. max stack depth: 442
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4658008 states 24030605 transitions, fanout: 5.159
pnml2lts-mc( 0/ 4): Total exploration time 14.840 sec (14.840 sec minimum, 14.840 sec on average)
pnml2lts-mc( 0/ 4): States per second: 313882, Transitions per second: 1619313
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 46.4MB, 10.5 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 13.0%/17.0%
pnml2lts-mc( 0/ 4): Stored 108 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 46.4MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-05-LTLCardinality-11
ltl formula formula --ltl=/tmp/1343/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 117 places, 108 transitions and 326 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1343/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1343/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1343/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1343/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 117 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 118, there are 114 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( 3/ 4): ~110 levels ~10000 states ~27464 transitions
pnml2lts-mc( 1/ 4): ~112 levels ~20000 states ~58864 transitions
pnml2lts-mc( 3/ 4): ~110 levels ~40000 states ~131456 transitions
pnml2lts-mc( 1/ 4): ~112 levels ~80000 states ~281468 transitions
pnml2lts-mc( 1/ 4): ~112 levels ~160000 states ~600148 transitions
pnml2lts-mc( 3/ 4): ~110 levels ~320000 states ~1266160 transitions
pnml2lts-mc( 3/ 4): ~110 levels ~640000 states ~2724408 transitions
pnml2lts-mc( 3/ 4): ~110 levels ~1280000 states ~6031252 transitions
pnml2lts-mc( 3/ 4): ~110 levels ~2560000 states ~12641576 transitions
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: 4524991
pnml2lts-mc( 0/ 4): unique states count: 4524991
pnml2lts-mc( 0/ 4): unique transitions count: 22921691
pnml2lts-mc( 0/ 4): - self-loop count: 7927
pnml2lts-mc( 0/ 4): - claim dead count: 18438986
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4545171
pnml2lts-mc( 0/ 4): - cum. max stack depth: 442
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4545171 states 23050127 transitions, fanout: 5.071
pnml2lts-mc( 0/ 4): Total exploration time 14.960 sec (14.960 sec minimum, 14.960 sec on average)
pnml2lts-mc( 0/ 4): States per second: 303822, Transitions per second: 1540784
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 45.4MB, 10.5 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 13.0%/17.0%
pnml2lts-mc( 0/ 4): Stored 108 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 45.4MB (~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="HirschbergSinclair-PT-05"
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 HirschbergSinclair-PT-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r500-smll-171649587400059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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