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.r512-smll-171654407100195.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 PermAdmissibility-PT-50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407100195
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 9.3K Apr 12 09:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 09:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Apr 12 09:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 296K Apr 12 09:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 98K Apr 12 09:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 501K Apr 12 09:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 340K May 18 16:43 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 PermAdmissibility-PT-50-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717256793348

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:46:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:46:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:46:36] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2024-06-01 15:46:36] [INFO ] Transformed 168 places.
[2024-06-01 15:46:36] [INFO ] Transformed 592 transitions.
[2024-06-01 15:46:36] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA PermAdmissibility-PT-50-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-50-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 101 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 143 transition count 592
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 139 transition count 528
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 139 transition count 528
Applied a total of 33 rules in 57 ms. Remains 139 /168 variables (removed 29) and now considering 528/592 (removed 64) transitions.
// Phase 1: matrix 528 rows 139 cols
[2024-06-01 15:46:36] [INFO ] Computed 20 invariants in 56 ms
[2024-06-01 15:46:37] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-01 15:46:37] [INFO ] Invariant cache hit.
[2024-06-01 15:46:37] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2024-06-01 15:46:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 25/124 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 8/132 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 528/660 variables, 132/152 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 8 (OVERLAPS) 7/667 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 667/667 variables, and 159 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30061 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 25/124 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 8/132 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 528/660 variables, 132/152 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 332/484 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/667 variables, and 484 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 132/139 constraints, PredecessorRefiner: 332/524 constraints, Known Traps: 0/0 constraints]
After SMT, in 62395ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 62442ms
Starting structural reductions in LTL mode, iteration 1 : 139/168 places, 528/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63575 ms. Remains : 139/168 places, 528/592 transitions.
Support contains 101 out of 139 places after structural reductions.
[2024-06-01 15:47:40] [INFO ] Flatten gal took : 131 ms
[2024-06-01 15:47:40] [INFO ] Flatten gal took : 77 ms
[2024-06-01 15:47:40] [INFO ] Input system was already deterministic with 528 transitions.
RANDOM walk for 40050 steps (48 resets) in 519 ms. (77 steps per ms) remains 1/34 properties
BEST_FIRST walk for 899 steps (0 resets) in 18 ms. (47 steps per ms) remains 0/1 properties
FORMULA PermAdmissibility-PT-50-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 139 stabilizing places and 528 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 139 transition count 528
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(G(p1)&&X(G(p2))))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 100 transition count 528
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 61 place count 78 transition count 344
Iterating global reduction 1 with 22 rules applied. Total rules applied 83 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 107 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 131 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 134 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 137 place count 51 transition count 84
Applied a total of 137 rules in 23 ms. Remains 51 /139 variables (removed 88) and now considering 84/528 (removed 444) transitions.
// Phase 1: matrix 84 rows 51 cols
[2024-06-01 15:47:41] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 15:47:41] [INFO ] Implicit Places using invariants in 112 ms returned [0, 5, 18, 25]
[2024-06-01 15:47:41] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 116 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/139 places, 84/528 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 48/139 places, 84/528 transitions.
Stuttering acceptance computed with spot in 400 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-00
Product exploration explored 100000 steps with 33333 reset in 412 ms.
Product exploration explored 100000 steps with 33333 reset in 305 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 84
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 p1 p0 p2), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 42 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-50-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-50-LTLCardinality-00 finished in 1491 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||(X(G(p1)) U (p0&&X(G(p1))))))))'
Support contains 8 out of 139 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Graph (complete) has 1253 edges and 139 vertex of which 94 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.17 ms
Discarding 45 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 87 transition count 352
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 87 transition count 352
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 80 transition count 240
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 80 transition count 240
Applied a total of 29 rules in 64 ms. Remains 80 /139 variables (removed 59) and now considering 240/528 (removed 288) transitions.
// Phase 1: matrix 240 rows 80 cols
[2024-06-01 15:47:43] [INFO ] Computed 15 invariants in 11 ms
[2024-06-01 15:47:43] [INFO ] Implicit Places using invariants in 189 ms returned [0, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 193 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/139 places, 240/528 transitions.
Applied a total of 0 rules in 14 ms. Remains 78 /78 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 271 ms. Remains : 78/139 places, 240/528 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-01
Stuttering criterion allowed to conclude after 93449 steps with 4259 reset in 703 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLCardinality-01 finished in 1105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1))&&F((p2 U (p3||G(p2)))))))'
Support contains 35 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Graph (complete) has 1253 edges and 139 vertex of which 116 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.5 ms
Discarding 23 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 107 transition count 384
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 107 transition count 384
Applied a total of 19 rules in 58 ms. Remains 107 /139 variables (removed 32) and now considering 384/528 (removed 144) transitions.
// Phase 1: matrix 384 rows 107 cols
[2024-06-01 15:47:44] [INFO ] Computed 18 invariants in 8 ms
[2024-06-01 15:47:44] [INFO ] Implicit Places using invariants in 251 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 256 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/139 places, 384/528 transitions.
Applied a total of 0 rules in 35 ms. Remains 106 /106 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 358 ms. Remains : 106/139 places, 384/528 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-02
Stuttering criterion allowed to conclude after 804 steps with 1 reset in 16 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLCardinality-02 finished in 643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 8 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 108 transition count 528
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 93 transition count 372
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 93 transition count 372
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 83 transition count 262
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 83 transition count 262
Applied a total of 81 rules in 24 ms. Remains 83 /139 variables (removed 56) and now considering 262/528 (removed 266) transitions.
// Phase 1: matrix 262 rows 83 cols
[2024-06-01 15:47:45] [INFO ] Computed 17 invariants in 5 ms
[2024-06-01 15:47:45] [INFO ] Implicit Places using invariants in 200 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 205 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/139 places, 262/528 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 233 ms. Remains : 82/139 places, 262/528 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 271 ms.
Product exploration explored 100000 steps with 33333 reset in 277 ms.
Computed a total of 82 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 82 transition count 262
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 (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-50-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-50-LTLCardinality-03 finished in 1166 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 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Graph (complete) has 1253 edges and 139 vertex of which 32 are kept as prefixes of interest. Removing 107 places using SCC suffix rule.2 ms
Discarding 107 places :
Also discarding 448 output transitions
Drop transitions (Output transitions of discarded places.) removed 448 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 25 transition count 38
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 25 transition count 38
Applied a total of 15 rules in 9 ms. Remains 25 /139 variables (removed 114) and now considering 38/528 (removed 490) transitions.
// Phase 1: matrix 38 rows 25 cols
[2024-06-01 15:47:46] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 15:47:46] [INFO ] Implicit Places using invariants in 51 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/139 places, 38/528 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63 ms. Remains : 24/139 places, 38/528 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-04
Product exploration explored 100000 steps with 249 reset in 316 ms.
Product exploration explored 100000 steps with 249 reset in 422 ms.
Computed a total of 24 stabilizing places and 38 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 38
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 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 45 ms :[(NOT p0)]
RANDOM walk for 816 steps (0 resets) in 5 ms. (136 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 155 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
// Phase 1: matrix 38 rows 24 cols
[2024-06-01 15:47:47] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 15:47:47] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 5 ms returned sat
[2024-06-01 15:47:47] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 15:47:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:47:47] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 5 ms returned sat
[2024-06-01 15:47:47] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 15:47:47] [INFO ] Computed and/alt/rep : 25/136/25 causal constraints (skipped 9 transitions) in 7 ms.
[2024-06-01 15:47:47] [INFO ] Added : 13 causal constraints over 3 iterations in 49 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-06-01 15:47:47] [INFO ] Invariant cache hit.
[2024-06-01 15:47:47] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 15:47:47] [INFO ] Invariant cache hit.
[2024-06-01 15:47:47] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-06-01 15:47:47] [INFO ] Redundant transitions in 1 ms returned []
Running 34 sub problems to find dead transitions.
[2024-06-01 15:47:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 38/62 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 31 constraints, problems are : Problem set: 0 solved, 34 unsolved in 614 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 38/62 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/62 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 65 constraints, problems are : Problem set: 0 solved, 34 unsolved in 500 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 1155ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1161ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1340 ms. Remains : 24/24 places, 38/38 transitions.
Computed a total of 24 stabilizing places and 38 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 38
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 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 47 ms :[(NOT p0)]
RANDOM walk for 818 steps (0 resets) in 6 ms. (116 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 149 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 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2024-06-01 15:47:49] [INFO ] Invariant cache hit.
[2024-06-01 15:47:49] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2024-06-01 15:47:49] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 15:47:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:47:49] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 15:47:49] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 15:47:49] [INFO ] Computed and/alt/rep : 25/136/25 causal constraints (skipped 9 transitions) in 5 ms.
[2024-06-01 15:47:49] [INFO ] Added : 21 causal constraints over 6 iterations in 67 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 249 reset in 338 ms.
Product exploration explored 100000 steps with 249 reset in 386 ms.
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-06-01 15:47:50] [INFO ] Invariant cache hit.
[2024-06-01 15:47:50] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 15:47:50] [INFO ] Invariant cache hit.
[2024-06-01 15:47:50] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-06-01 15:47:50] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2024-06-01 15:47:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 38/62 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 31 constraints, problems are : Problem set: 0 solved, 34 unsolved in 495 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 38/62 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/62 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 65 constraints, problems are : Problem set: 0 solved, 34 unsolved in 586 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 1100ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1100ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1202 ms. Remains : 24/24 places, 38/38 transitions.
Treatment of property PermAdmissibility-PT-50-LTLCardinality-04 finished in 5765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((F(!(p0 U p1))&&!(p2 U p3)&&!p0)))))'
Support contains 21 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Graph (complete) has 1253 edges and 139 vertex of which 94 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.2 ms
Discarding 45 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 88 transition count 368
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 88 transition count 368
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 25 place count 76 transition count 248
Iterating global reduction 0 with 12 rules applied. Total rules applied 37 place count 76 transition count 248
Applied a total of 37 rules in 23 ms. Remains 76 /139 variables (removed 63) and now considering 248/528 (removed 280) transitions.
// Phase 1: matrix 248 rows 76 cols
[2024-06-01 15:47:51] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 15:47:52] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 15:47:52] [INFO ] Invariant cache hit.
[2024-06-01 15:47:52] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-06-01 15:47:52] [INFO ] Redundant transitions in 15 ms returned []
Running 244 sub problems to find dead transitions.
[2024-06-01 15:47:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 91 constraints, problems are : Problem set: 0 solved, 244 unsolved in 6351 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 244/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 335 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30008 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 36795ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 36799ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/139 places, 248/528 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37207 ms. Remains : 76/139 places, 248/528 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-06
Product exploration explored 100000 steps with 300 reset in 1277 ms.
Product exploration explored 100000 steps with 289 reset in 1113 ms.
Computed a total of 76 stabilizing places and 248 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 248
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 p1 p0 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (OR p0 p3)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (OR p0 p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 2320 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
RANDOM walk for 37691 steps (49 resets) in 80 ms. (465 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p1 p0 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (OR p0 p3)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (OR p0 p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p3))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p0 p3 (NOT p2)))), (F (NOT p3)), (F (NOT (OR p3 (NOT p2))))]
Knowledge based reduction with 20 factoid took 4843 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
Stuttering acceptance computed with spot in 229 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
[2024-06-01 15:48:39] [INFO ] Invariant cache hit.
[2024-06-01 15:48:40] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 13 ms returned sat
[2024-06-01 15:48:40] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-06-01 15:48:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:48:40] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 11 ms returned sat
[2024-06-01 15:48:40] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-06-01 15:48:40] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 64 ms.
[2024-06-01 15:48:40] [INFO ] Added : 20 causal constraints over 6 iterations in 276 ms. Result :sat
Could not prove EG p1
[2024-06-01 15:48:40] [INFO ] Invariant cache hit.
[2024-06-01 15:48:40] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 15 ms returned sat
[2024-06-01 15:48:41] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-06-01 15:48:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:48:41] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 20 ms returned sat
[2024-06-01 15:48:41] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-06-01 15:48:41] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 61 ms.
[2024-06-01 15:48:41] [INFO ] Added : 7 causal constraints over 2 iterations in 141 ms. Result :sat
Could not prove EG p0
[2024-06-01 15:48:41] [INFO ] Invariant cache hit.
[2024-06-01 15:48:41] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 27 ms returned sat
[2024-06-01 15:48:42] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-06-01 15:48:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:48:42] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 20 ms returned sat
[2024-06-01 15:48:42] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-06-01 15:48:42] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 64 ms.
[2024-06-01 15:48:42] [INFO ] Added : 19 causal constraints over 5 iterations in 218 ms. Result :sat
Could not prove EG p3
Support contains 21 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 248/248 transitions.
Applied a total of 0 rules in 12 ms. Remains 76 /76 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2024-06-01 15:48:42] [INFO ] Invariant cache hit.
[2024-06-01 15:48:42] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-06-01 15:48:42] [INFO ] Invariant cache hit.
[2024-06-01 15:48:43] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-06-01 15:48:43] [INFO ] Redundant transitions in 6 ms returned []
Running 244 sub problems to find dead transitions.
[2024-06-01 15:48:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 91 constraints, problems are : Problem set: 0 solved, 244 unsolved in 5317 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 244/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 335 constraints, problems are : Problem set: 0 solved, 244 unsolved in 27457 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 33351ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 33359ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33933 ms. Remains : 76/76 places, 248/248 transitions.
Computed a total of 76 stabilizing places and 248 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 248
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 p1 p0 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (OR p0 p3)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (OR p0 p3))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p3) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1873 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
RANDOM walk for 40066 steps (52 resets) in 58 ms. (679 steps per ms) remains 1/8 properties
BEST_FIRST walk for 20398 steps (3 resets) in 123 ms. (164 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (OR p0 p3)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (OR p0 p3))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p3) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p3))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p0 p3 (NOT p2)))), (F (NOT p3)), (F (NOT (OR p3 (NOT p2))))]
Knowledge based reduction with 20 factoid took 4645 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
Stuttering acceptance computed with spot in 244 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
[2024-06-01 15:49:24] [INFO ] Invariant cache hit.
[2024-06-01 15:49:24] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 11 ms returned sat
[2024-06-01 15:49:24] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-06-01 15:49:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:49:24] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 12 ms returned sat
[2024-06-01 15:49:24] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-06-01 15:49:24] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 27 ms.
[2024-06-01 15:49:25] [INFO ] Added : 20 causal constraints over 6 iterations in 145 ms. Result :sat
Could not prove EG p1
[2024-06-01 15:49:25] [INFO ] Invariant cache hit.
[2024-06-01 15:49:25] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 20 ms returned sat
[2024-06-01 15:49:25] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-06-01 15:49:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:49:25] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 24 ms returned sat
[2024-06-01 15:49:25] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-06-01 15:49:25] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 35 ms.
[2024-06-01 15:49:25] [INFO ] Added : 7 causal constraints over 2 iterations in 105 ms. Result :sat
Could not prove EG p0
[2024-06-01 15:49:25] [INFO ] Invariant cache hit.
[2024-06-01 15:49:26] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 25 ms returned sat
[2024-06-01 15:49:26] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-06-01 15:49:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:49:26] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 13 ms returned sat
[2024-06-01 15:49:26] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-06-01 15:49:26] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 39 ms.
[2024-06-01 15:49:26] [INFO ] Added : 19 causal constraints over 5 iterations in 157 ms. Result :sat
Could not prove EG p3
Stuttering acceptance computed with spot in 202 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
Product exploration explored 100000 steps with 310 reset in 1342 ms.
Product exploration explored 100000 steps with 297 reset in 1042 ms.
Support contains 21 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 248/248 transitions.
Applied a total of 0 rules in 7 ms. Remains 76 /76 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2024-06-01 15:49:29] [INFO ] Invariant cache hit.
[2024-06-01 15:49:29] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 15:49:29] [INFO ] Invariant cache hit.
[2024-06-01 15:49:29] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2024-06-01 15:49:29] [INFO ] Redundant transitions in 5 ms returned []
Running 244 sub problems to find dead transitions.
[2024-06-01 15:49:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 91 constraints, problems are : Problem set: 0 solved, 244 unsolved in 6227 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 244/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 335 constraints, problems are : Problem set: 0 solved, 244 unsolved in 28392 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 35206ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 35212ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35650 ms. Remains : 76/76 places, 248/248 transitions.
Treatment of property PermAdmissibility-PT-50-LTLCardinality-06 finished in 133181 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(F(p1))))&&F(!p0))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Graph (complete) has 1253 edges and 139 vertex of which 102 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.2 ms
Discarding 37 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 82 transition count 348
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 82 transition count 348
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 63 place count 60 transition count 126
Iterating global reduction 0 with 22 rules applied. Total rules applied 85 place count 60 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 87 place count 58 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 89 place count 58 transition count 110
Applied a total of 89 rules in 15 ms. Remains 58 /139 variables (removed 81) and now considering 110/528 (removed 418) transitions.
// Phase 1: matrix 110 rows 58 cols
[2024-06-01 15:50:05] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 15:50:05] [INFO ] Implicit Places using invariants in 84 ms returned [0, 7, 22, 30]
[2024-06-01 15:50:05] [INFO ] Actually due to overlaps returned [0, 7, 22]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 87 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/139 places, 110/528 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 55/139 places, 110/528 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-08
Product exploration explored 100000 steps with 5296 reset in 620 ms.
Product exploration explored 100000 steps with 5333 reset in 490 ms.
Computed a total of 55 stabilizing places and 110 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 55 transition count 110
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 p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 291 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
RANDOM walk for 17668 steps (18 resets) in 25 ms. (679 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 9 factoid took 586 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 110 rows 55 cols
[2024-06-01 15:50:08] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 15:50:08] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 11 ms returned sat
[2024-06-01 15:50:08] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-06-01 15:50:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:50:08] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 11 ms returned sat
[2024-06-01 15:50:08] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-01 15:50:08] [INFO ] Computed and/alt/rep : 22/128/22 causal constraints (skipped 84 transitions) in 16 ms.
[2024-06-01 15:50:08] [INFO ] Added : 15 causal constraints over 5 iterations in 100 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 110/110 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-06-01 15:50:08] [INFO ] Invariant cache hit.
[2024-06-01 15:50:08] [INFO ] Implicit Places using invariants in 88 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/55 places, 110/110 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 54 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 53 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 53 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 52 transition count 108
Applied a total of 4 rules in 16 ms. Remains 52 /54 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 52 cols
[2024-06-01 15:50:08] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 15:50:08] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 15:50:08] [INFO ] Invariant cache hit.
[2024-06-01 15:50:08] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/55 places, 108/110 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 336 ms. Remains : 52/55 places, 108/110 transitions.
Computed a total of 52 stabilizing places and 108 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 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).
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 p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 204 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
RANDOM walk for 18040 steps (22 resets) in 13 ms. (1288 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 9 factoid took 391 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
[2024-06-01 15:50:09] [INFO ] Invariant cache hit.
[2024-06-01 15:50:09] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 8 ms returned sat
[2024-06-01 15:50:10] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-01 15:50:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:50:10] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 8 ms returned sat
[2024-06-01 15:50:10] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-01 15:50:10] [INFO ] Computed and/alt/rep : 20/112/20 causal constraints (skipped 84 transitions) in 9 ms.
[2024-06-01 15:50:10] [INFO ] Added : 12 causal constraints over 3 iterations in 51 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5298 reset in 403 ms.
Product exploration explored 100000 steps with 5280 reset in 427 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 108/108 transitions.
Applied a total of 0 rules in 8 ms. Remains 52 /52 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-06-01 15:50:11] [INFO ] Invariant cache hit.
[2024-06-01 15:50:11] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 15:50:11] [INFO ] Invariant cache hit.
[2024-06-01 15:50:11] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-06-01 15:50:11] [INFO ] Redundant transitions in 1 ms returned []
Running 104 sub problems to find dead transitions.
[2024-06-01 15:50:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 108/158 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 2/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 64 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2507 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 108/158 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 94/156 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 2/160 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 10/168 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 168 constraints, problems are : Problem set: 0 solved, 104 unsolved in 8552 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 11118ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 11120ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11391 ms. Remains : 52/52 places, 108/108 transitions.
Treatment of property PermAdmissibility-PT-50-LTLCardinality-08 finished in 17499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 101 transition count 528
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 58 place count 81 transition count 352
Iterating global reduction 1 with 20 rules applied. Total rules applied 78 place count 81 transition count 352
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 98 place count 61 transition count 132
Iterating global reduction 1 with 20 rules applied. Total rules applied 118 place count 61 transition count 132
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 59 transition count 116
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 59 transition count 116
Applied a total of 122 rules in 6 ms. Remains 59 /139 variables (removed 80) and now considering 116/528 (removed 412) transitions.
// Phase 1: matrix 116 rows 59 cols
[2024-06-01 15:50:22] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 15:50:22] [INFO ] Implicit Places using invariants in 100 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/139 places, 116/528 transitions.
Applied a total of 0 rules in 0 ms. Remains 58 /58 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 58/139 places, 116/528 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLCardinality-09 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p0))||(p1&&G(p2))))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 100 transition count 528
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 59 place count 80 transition count 348
Iterating global reduction 1 with 20 rules applied. Total rules applied 79 place count 80 transition count 348
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 98 place count 61 transition count 154
Iterating global reduction 1 with 19 rules applied. Total rules applied 117 place count 61 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 60 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 60 transition count 146
Applied a total of 119 rules in 6 ms. Remains 60 /139 variables (removed 79) and now considering 146/528 (removed 382) transitions.
// Phase 1: matrix 146 rows 60 cols
[2024-06-01 15:50:22] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 15:50:22] [INFO ] Implicit Places using invariants in 86 ms returned [0, 7, 21, 31]
[2024-06-01 15:50:22] [INFO ] Actually due to overlaps returned [0, 7, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 88 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/139 places, 146/528 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 57/139 places, 146/528 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 70 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLCardinality-10 finished in 313 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)||G(p2))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 101 transition count 528
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 59 place count 80 transition count 348
Iterating global reduction 1 with 21 rules applied. Total rules applied 80 place count 80 transition count 348
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 101 place count 59 transition count 122
Iterating global reduction 1 with 21 rules applied. Total rules applied 122 place count 59 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 58 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 58 transition count 114
Applied a total of 124 rules in 7 ms. Remains 58 /139 variables (removed 81) and now considering 114/528 (removed 414) transitions.
// Phase 1: matrix 114 rows 58 cols
[2024-06-01 15:50:23] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 15:50:23] [INFO ] Implicit Places using invariants in 96 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/139 places, 114/528 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 57/139 places, 114/528 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 106 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLCardinality-11 finished in 325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&F((p1||X(p2)))))))'
Support contains 7 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 104 transition count 528
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 53 place count 86 transition count 356
Iterating global reduction 1 with 18 rules applied. Total rules applied 71 place count 86 transition count 356
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 87 place count 70 transition count 168
Iterating global reduction 1 with 16 rules applied. Total rules applied 103 place count 70 transition count 168
Applied a total of 103 rules in 6 ms. Remains 70 /139 variables (removed 69) and now considering 168/528 (removed 360) transitions.
// Phase 1: matrix 168 rows 70 cols
[2024-06-01 15:50:23] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 15:50:23] [INFO ] Implicit Places using invariants in 119 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 120 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/139 places, 168/528 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 69/139 places, 168/528 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-12
Product exploration explored 100000 steps with 169 reset in 790 ms.
Product exploration explored 100000 steps with 176 reset in 823 ms.
Computed a total of 69 stabilizing places and 168 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 69 transition count 168
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 p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 936 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40066 steps (48 resets) in 34 ms. (1144 steps per ms) remains 1/5 properties
BEST_FIRST walk for 6357 steps (0 resets) in 23 ms. (264 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p2))), (F (NOT p2)), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 2371 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 168 rows 69 cols
[2024-06-01 15:50:29] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 15:50:29] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 14 ms returned sat
[2024-06-01 15:50:29] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-01 15:50:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:50:29] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 9 ms returned sat
[2024-06-01 15:50:29] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-01 15:50:29] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 136 transitions) in 13 ms.
[2024-06-01 15:50:29] [INFO ] Added : 21 causal constraints over 5 iterations in 92 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 69 /69 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-06-01 15:50:29] [INFO ] Invariant cache hit.
[2024-06-01 15:50:29] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 15:50:29] [INFO ] Invariant cache hit.
[2024-06-01 15:50:30] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-06-01 15:50:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 168/233 variables, 65/80 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 4/237 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/237 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 84 constraints, problems are : Problem set: 0 solved, 164 unsolved in 3235 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 168/233 variables, 65/80 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 144/224 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 4/237 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/237 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 248 constraints, problems are : Problem set: 0 solved, 164 unsolved in 20276 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 23655ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 23658ms
Finished structural reductions in LTL mode , in 1 iterations and 24021 ms. Remains : 69/69 places, 168/168 transitions.
Computed a total of 69 stabilizing places and 168 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 69 transition count 168
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 p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 933 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40078 steps (48 resets) in 29 ms. (1335 steps per ms) remains 2/5 properties
BEST_FIRST walk for 28152 steps (5 resets) in 38 ms. (721 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p2))), (F (NOT p2)), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 2269 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
[2024-06-01 15:50:57] [INFO ] Invariant cache hit.
[2024-06-01 15:50:57] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 11 ms returned sat
[2024-06-01 15:50:57] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-01 15:50:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:50:57] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 10 ms returned sat
[2024-06-01 15:50:58] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-06-01 15:50:58] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 136 transitions) in 13 ms.
[2024-06-01 15:50:58] [INFO ] Added : 19 causal constraints over 4 iterations in 83 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 175 reset in 782 ms.
Stuttering criterion allowed to conclude after 44661 steps with 76 reset in 368 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLCardinality-12 finished in 35945 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&&(p0 U (p1||G(p0)))))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Graph (complete) has 1253 edges and 139 vertex of which 102 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 83 transition count 356
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 83 transition count 356
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 57 place count 65 transition count 150
Iterating global reduction 0 with 18 rules applied. Total rules applied 75 place count 65 transition count 150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 77 place count 63 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 79 place count 63 transition count 134
Applied a total of 79 rules in 13 ms. Remains 63 /139 variables (removed 76) and now considering 134/528 (removed 394) transitions.
// Phase 1: matrix 134 rows 63 cols
[2024-06-01 15:50:59] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 15:50:59] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 15:50:59] [INFO ] Invariant cache hit.
[2024-06-01 15:50:59] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-06-01 15:50:59] [INFO ] Redundant transitions in 0 ms returned []
Running 130 sub problems to find dead transitions.
[2024-06-01 15:50:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 134/195 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 2/197 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 79 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3251 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 134/195 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 110/187 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 2/197 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 209 constraints, problems are : Problem set: 0 solved, 130 unsolved in 8041 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 11373ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 11375ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/139 places, 134/528 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11662 ms. Remains : 63/139 places, 134/528 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-13
Product exploration explored 100000 steps with 124 reset in 667 ms.
Product exploration explored 100000 steps with 124 reset in 698 ms.
Computed a total of 63 stabilizing places and 134 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 134
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 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 35 ms :[(NOT p0)]
RANDOM walk for 25889 steps (29 resets) in 13 ms. (1849 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 113 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-06-01 15:51:12] [INFO ] Invariant cache hit.
[2024-06-01 15:51:13] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 9 ms returned sat
[2024-06-01 15:51:13] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-01 15:51:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:51:13] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 10 ms returned sat
[2024-06-01 15:51:13] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-01 15:51:13] [INFO ] Computed and/alt/rep : 12/48/12 causal constraints (skipped 118 transitions) in 11 ms.
[2024-06-01 15:51:13] [INFO ] Added : 10 causal constraints over 3 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 134/134 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-06-01 15:51:13] [INFO ] Invariant cache hit.
[2024-06-01 15:51:13] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 15:51:13] [INFO ] Invariant cache hit.
[2024-06-01 15:51:13] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-06-01 15:51:13] [INFO ] Redundant transitions in 0 ms returned []
Running 130 sub problems to find dead transitions.
[2024-06-01 15:51:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 134/195 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 2/197 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 79 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3438 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 134/195 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 110/187 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 2/197 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 209 constraints, problems are : Problem set: 0 solved, 130 unsolved in 8226 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 11754ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 11756ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12026 ms. Remains : 63/63 places, 134/134 transitions.
Computed a total of 63 stabilizing places and 134 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 134
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 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 34 ms :[(NOT p0)]
RANDOM walk for 21967 steps (25 resets) in 16 ms. (1292 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 115 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-06-01 15:51:25] [INFO ] Invariant cache hit.
[2024-06-01 15:51:25] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 10 ms returned sat
[2024-06-01 15:51:25] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-01 15:51:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:51:26] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 10 ms returned sat
[2024-06-01 15:51:26] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-01 15:51:26] [INFO ] Computed and/alt/rep : 12/48/12 causal constraints (skipped 118 transitions) in 10 ms.
[2024-06-01 15:51:26] [INFO ] Added : 10 causal constraints over 3 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 124 reset in 650 ms.
Stuttering criterion allowed to conclude after 4805 steps with 5 reset in 34 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLCardinality-13 finished in 27414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 101 transition count 528
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 59 place count 80 transition count 348
Iterating global reduction 1 with 21 rules applied. Total rules applied 80 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 102 place count 58 transition count 118
Iterating global reduction 1 with 22 rules applied. Total rules applied 124 place count 58 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 56 transition count 102
Applied a total of 128 rules in 8 ms. Remains 56 /139 variables (removed 83) and now considering 102/528 (removed 426) transitions.
// Phase 1: matrix 102 rows 56 cols
[2024-06-01 15:51:26] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 15:51:26] [INFO ] Implicit Places using invariants in 103 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/139 places, 102/528 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 55/139 places, 102/528 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-14
Product exploration explored 100000 steps with 25000 reset in 343 ms.
Product exploration explored 100000 steps with 25000 reset in 353 ms.
Computed a total of 55 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 55 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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 13027 steps (12 resets) in 8 ms. (1447 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 55 cols
[2024-06-01 15:51:28] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 15:51:28] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 15:51:28] [INFO ] Invariant cache hit.
[2024-06-01 15:51:28] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-06-01 15:51:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/157 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 70 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3043 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 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/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 90/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 168 constraints, problems are : Problem set: 0 solved, 98 unsolved in 8499 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 11591ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 11592ms
Finished structural reductions in LTL mode , in 1 iterations and 11807 ms. Remains : 55/55 places, 102/102 transitions.
Computed a total of 55 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 55 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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 16040 steps (16 resets) in 14 ms. (1069 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 280 ms.
Product exploration explored 100000 steps with 25000 reset in 307 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-06-01 15:51:42] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2024-06-01 15:51:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/157 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 70 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3063 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 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/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 90/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 168 constraints, problems are : Problem set: 0 solved, 98 unsolved in 8958 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 12102ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 12104ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12119 ms. Remains : 55/55 places, 102/102 transitions.
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-06-01 15:51:54] [INFO ] Invariant cache hit.
[2024-06-01 15:51:54] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 15:51:54] [INFO ] Invariant cache hit.
[2024-06-01 15:51:55] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-06-01 15:51:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/157 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 70 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3433 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 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/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 90/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 168 constraints, problems are : Problem set: 0 solved, 98 unsolved in 9114 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 12636ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 12639ms
Finished structural reductions in LTL mode , in 1 iterations and 12979 ms. Remains : 55/55 places, 102/102 transitions.
Treatment of property PermAdmissibility-PT-50-LTLCardinality-14 finished in 41036 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((F(!(p0 U p1))&&!(p2 U p3)&&!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' '!(G((F((p0||G(F(p1))))&&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' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : PermAdmissibility-PT-50-LTLCardinality-14
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Graph (complete) has 1253 edges and 139 vertex of which 101 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.3 ms
Discarding 38 places :
Also discarding 0 output transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 80 transition count 348
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 65 place count 58 transition count 118
Iterating global reduction 0 with 22 rules applied. Total rules applied 87 place count 58 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 56 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 56 transition count 102
Applied a total of 91 rules in 22 ms. Remains 56 /139 variables (removed 83) and now considering 102/528 (removed 426) transitions.
// Phase 1: matrix 102 rows 56 cols
[2024-06-01 15:52:08] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 15:52:08] [INFO ] Implicit Places using invariants in 115 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 55/139 places, 102/528 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 156 ms. Remains : 55/139 places, 102/528 transitions.
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-14
Product exploration explored 100000 steps with 25000 reset in 265 ms.
Product exploration explored 100000 steps with 25000 reset in 253 ms.
Computed a total of 55 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 55 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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 21399 steps (23 resets) in 16 ms. (1258 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 55 cols
[2024-06-01 15:52:10] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 15:52:10] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 15:52:10] [INFO ] Invariant cache hit.
[2024-06-01 15:52:10] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-06-01 15:52:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/157 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 70 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3095 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 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/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 90/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 168 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7569 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 10756ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 10759ms
Finished structural reductions in LTL mode , in 1 iterations and 11115 ms. Remains : 55/55 places, 102/102 transitions.
Computed a total of 55 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 55 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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 19536 steps (21 resets) in 15 ms. (1221 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 281 ms.
Product exploration explored 100000 steps with 25000 reset in 267 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-06-01 15:52:23] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2024-06-01 15:52:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/157 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 70 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3402 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 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/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 90/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 168 constraints, problems are : Problem set: 0 solved, 98 unsolved in 8148 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 11601ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 11602ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11613 ms. Remains : 55/55 places, 102/102 transitions.
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-06-01 15:52:34] [INFO ] Invariant cache hit.
[2024-06-01 15:52:35] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 15:52:35] [INFO ] Invariant cache hit.
[2024-06-01 15:52:35] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-06-01 15:52:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/157 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 70 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2983 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 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/53 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 90/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 168 constraints, problems are : Problem set: 0 solved, 98 unsolved in 8343 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 11400ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 11403ms
Finished structural reductions in LTL mode , in 1 iterations and 11739 ms. Remains : 55/55 places, 102/102 transitions.
Treatment of property PermAdmissibility-PT-50-LTLCardinality-14 finished in 38220 ms.
[2024-06-01 15:52:46] [INFO ] Flatten gal took : 66 ms
[2024-06-01 15:52:46] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 15:52:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 139 places, 528 transitions and 2972 arcs took 14 ms.
Total runtime 370999 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PermAdmissibility-PT-50-LTLCardinality-04
FORMULA PermAdmissibility-PT-50-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PermAdmissibility-PT-50-LTLCardinality-08
FORMULA PermAdmissibility-PT-50-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717257505023

--------------------
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 PermAdmissibility-PT-50-LTLCardinality-04
ltl formula formula --ltl=/tmp/2140/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 139 places, 528 transitions and 2972 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.100 real 0.040 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2140/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2140/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2140/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2140/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 101 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 140, there are 532 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~801 levels ~10000 states ~22540 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~20000 states ~45792 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~40000 states ~88728 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~80000 states ~202608 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~160000 states ~414472 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~320000 states ~822852 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~640000 states ~1719516 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~1280000 states ~3504708 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~2560000 states ~6726064 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~5120000 states ~13791076 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~10240000 states ~27406876 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~20480000 states ~56045960 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 28184786
pnml2lts-mc( 0/ 4): unique states count: 28187889
pnml2lts-mc( 0/ 4): unique transitions count: 154528165
pnml2lts-mc( 0/ 4): - self-loop count: 91407
pnml2lts-mc( 0/ 4): - claim dead count: 126225256
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 28187943
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3204
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 28187943 states 154528577 transitions, fanout: 5.482
pnml2lts-mc( 0/ 4): Total exploration time 270.000 sec (269.960 sec minimum, 269.975 sec on average)
pnml2lts-mc( 0/ 4): States per second: 104400, Transitions per second: 572328
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 279.2MB, 10.4 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 84.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 540 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 279.2MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-50-LTLCardinality-06
ltl formula formula --ltl=/tmp/2140/ltl_1_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 139 places, 528 transitions and 2972 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.100 real 0.040 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2140/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2140/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2140/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2140/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 101 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 140, there are 541 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): ~152 levels ~10000 states ~17292 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~801!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9153
pnml2lts-mc( 0/ 4): unique states count: 10708
pnml2lts-mc( 0/ 4): unique transitions count: 32259
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 4324
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 10712
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1582
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10712 states 32327 transitions, fanout: 3.018
pnml2lts-mc( 0/ 4): Total exploration time 0.320 sec (0.320 sec minimum, 0.320 sec on average)
pnml2lts-mc( 0/ 4): States per second: 33475, Transitions per second: 101022
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.1MB, 46.5 B/state, compr.: 8.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 540 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.1MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-50-LTLCardinality-08
ltl formula formula --ltl=/tmp/2140/ltl_2_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 139 places, 528 transitions and 2972 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.090 real 0.030 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2140/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2140/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2140/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2140/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 102 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 140, there are 533 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): ~302 levels ~10000 states ~18436 transitions
pnml2lts-mc( 0/ 4): ~302 levels ~20000 states ~28560 transitions
pnml2lts-mc( 0/ 4): ~302 levels ~40000 states ~50832 transitions
pnml2lts-mc( 0/ 4): ~302 levels ~80000 states ~94088 transitions
pnml2lts-mc( 0/ 4): ~302 levels ~160000 states ~186988 transitions
pnml2lts-mc( 0/ 4): ~302 levels ~320000 states ~377064 transitions
pnml2lts-mc( 0/ 4): ~302 levels ~640000 states ~753928 transitions
pnml2lts-mc( 0/ 4): ~302 levels ~1280000 states ~1530300 transitions
pnml2lts-mc( 1/ 4): ~302 levels ~2560000 states ~3734940 transitions
pnml2lts-mc( 1/ 4): ~302 levels ~5120000 states ~7635132 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7708083
pnml2lts-mc( 0/ 4): unique states count: 7709247
pnml2lts-mc( 0/ 4): unique transitions count: 10466469
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2748003
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7709252
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1208
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7709252 states 10466499 transitions, fanout: 1.358
pnml2lts-mc( 0/ 4): Total exploration time 65.470 sec (65.280 sec minimum, 65.360 sec on average)
pnml2lts-mc( 0/ 4): States per second: 117752, Transitions per second: 159867
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 122.9MB, 16.7 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 23.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 540 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 122.9MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-50-LTLCardinality-14
ltl formula formula --ltl=/tmp/2140/ltl_3_
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 139 places, 528 transitions and 2972 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.100 real 0.030 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2140/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2140/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2140/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2140/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 102 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 140, there are 532 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 146
pnml2lts-mc( 0/ 4): unique states count: 146
pnml2lts-mc( 0/ 4): unique transitions count: 236
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 148
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 182
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 182 states 428 transitions, fanout: 2.352
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 18200, Transitions per second: 42800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 52.3 B/state, compr.: 9.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 540 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-50"
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 PermAdmissibility-PT-50, 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 r512-smll-171654407100195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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