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.r267-smll-171654405700123.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 greatspnxred
Input is PermAdmissibility-COL-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405700123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.5K Apr 12 09:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 12 09:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 09:09 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 3.8K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 09:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 12 09:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 12 09:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 09:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 54K 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-COL-05-LTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716664816243

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 19:20:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 19:20:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:20:18] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 19:20:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 19:20:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1116 ms
[2024-05-25 19:20:19] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 19:20:19] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2024-05-25 19:20:19] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PermAdmissibility-COL-05-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40006 steps (412 resets) in 845 ms. (47 steps per ms) remains 2/35 properties
BEST_FIRST walk for 40002 steps (124 resets) in 419 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (192 resets) in 585 ms. (68 steps per ms) remains 2/2 properties
// Phase 1: matrix 16 rows 40 cols
[2024-05-25 19:20:20] [INFO ] Computed 24 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/30 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp34 is UNSAT
After SMT solving in domain Real declared 40/56 variables, and 24 constraints, problems are : Problem set: 2 solved, 0 unsolved in 244 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 301ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2024-05-25 19:20:20] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-25 19:20:20] [INFO ] Flatten gal took : 31 ms
FORMULA PermAdmissibility-COL-05-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 19:20:20] [INFO ] Flatten gal took : 8 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2024-05-25 19:20:20] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 16 ms.
[2024-05-25 19:20:20] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 30 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 37 transition count 16
Applied a total of 3 rules in 23 ms. Remains 37 /40 variables (removed 3) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 37 cols
[2024-05-25 19:20:20] [INFO ] Computed 21 invariants in 9 ms
[2024-05-25 19:20:21] [INFO ] Implicit Places using invariants in 107 ms returned [5, 15, 27]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 124 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 34/40 places, 16/16 transitions.
Support contains 30 out of 34 places after structural reductions.
[2024-05-25 19:20:21] [INFO ] Flatten gal took : 6 ms
[2024-05-25 19:20:21] [INFO ] Flatten gal took : 5 ms
[2024-05-25 19:20:21] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 28 out of 34 places (down from 30) after GAL structural reductions.
RANDOM walk for 40009 steps (412 resets) in 210 ms. (189 steps per ms) remains 1/29 properties
BEST_FIRST walk for 40002 steps (124 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
// Phase 1: matrix 16 rows 34 cols
[2024-05-25 19:20:21] [INFO ] Computed 18 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 24/50 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 41 ms.
Refiners :[Generalized P Invariants (flows): 8/18 constraints, State Equation: 0/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 51ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 34 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 34 transition count 16
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((p0||X(X((p1||X(F((p1&&F((p2&&F(p3))))))))))))'
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 27 transition count 16
Applied a total of 7 rules in 1 ms. Remains 27 /34 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2024-05-25 19:20:21] [INFO ] Computed 11 invariants in 2 ms
[2024-05-25 19:20:21] [INFO ] Implicit Places using invariants in 107 ms returned [4, 5, 7, 12, 13, 14, 16, 20, 21, 23]
[2024-05-25 19:20:21] [INFO ] Actually due to overlaps returned [4, 7, 12, 13, 14, 20, 21]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 110 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/34 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 20/34 places, 16/16 transitions.
Stuttering acceptance computed with spot in 519 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p3), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-00
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 4 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLCardinality-00 finished in 727 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)))'
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 27 transition count 16
Applied a total of 7 rules in 1 ms. Remains 27 /34 variables (removed 7) and now considering 16/16 (removed 0) transitions.
[2024-05-25 19:20:22] [INFO ] Invariant cache hit.
[2024-05-25 19:20:22] [INFO ] Implicit Places using invariants in 101 ms returned [4, 5, 6, 7, 13, 14, 16, 20, 21, 23]
[2024-05-25 19:20:22] [INFO ] Actually due to overlaps returned [4, 6, 7, 13, 14, 20, 21]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 108 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/34 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 20/34 places, 16/16 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 23 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-01 finished in 668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 27 transition count 16
Applied a total of 7 rules in 2 ms. Remains 27 /34 variables (removed 7) and now considering 16/16 (removed 0) transitions.
[2024-05-25 19:20:23] [INFO ] Invariant cache hit.
[2024-05-25 19:20:23] [INFO ] Implicit Places using invariants in 83 ms returned [4, 5, 6, 7, 12, 13, 14, 16, 20, 21, 23]
[2024-05-25 19:20:23] [INFO ] Actually due to overlaps returned [4, 6, 7, 12, 13, 14, 20, 21]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 86 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/34 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 19/34 places, 16/16 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLCardinality-02 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 16/16 transitions.
Graph (complete) has 73 edges and 34 vertex of which 11 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 13 ms. Remains 10 /34 variables (removed 24) and now considering 6/16 (removed 10) transitions.
// Phase 1: matrix 6 rows 10 cols
[2024-05-25 19:20:23] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 19:20:23] [INFO ] Implicit Places using invariants in 39 ms returned [0, 5, 6]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/34 places, 6/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 4 transition count 3
Applied a total of 6 rules in 5 ms. Remains 4 /7 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 4 cols
[2024-05-25 19:20:23] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 19:20:23] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 19:20:23] [INFO ] Invariant cache hit.
[2024-05-25 19:20:23] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/34 places, 3/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 4/34 places, 3/16 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 65 ms.
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
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 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-03 finished in 437 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(!(((G(p0) U p1) U p2) U (p1 U p3)))))'
Support contains 5 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 16/16 transitions.
Graph (complete) has 73 edges and 34 vertex of which 29 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 2 ms. Remains 28 /34 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 28 cols
[2024-05-25 19:20:23] [INFO ] Computed 12 invariants in 2 ms
[2024-05-25 19:20:23] [INFO ] Implicit Places using invariants in 88 ms returned [4, 6, 7, 12, 13, 16, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 93 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/34 places, 16/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 19 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 16 transition count 11
Applied a total of 8 rules in 4 ms. Remains 16 /21 variables (removed 5) and now considering 11/16 (removed 5) transitions.
// Phase 1: matrix 11 rows 16 cols
[2024-05-25 19:20:23] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 19:20:23] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-25 19:20:23] [INFO ] Invariant cache hit.
[2024-05-25 19:20:23] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/34 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 196 ms. Remains : 16/34 places, 11/16 transitions.
Stuttering acceptance computed with spot in 488 ms :[p3, p3, (AND p2 p3), p3, (AND p2 p3 p1 p0), (AND p0 p1 p3), (AND p0 p2 p3), (AND p0 p3), (AND p0 p3)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-04
Stuttering criterion allowed to conclude after 32666 steps with 1342 reset in 97 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLCardinality-04 finished in 809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 16/16 transitions.
Graph (complete) has 73 edges and 34 vertex of which 14 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 2 ms. Remains 13 /34 variables (removed 21) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 13 cols
[2024-05-25 19:20:24] [INFO ] Computed 5 invariants in 0 ms
[2024-05-25 19:20:24] [INFO ] Implicit Places using invariants in 51 ms returned [0, 5, 7, 9]
[2024-05-25 19:20:24] [INFO ] Actually due to overlaps returned [0, 5, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/34 places, 8/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
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 8 transition count 5
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 7 transition count 5
Applied a total of 4 rules in 2 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-25 19:20:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-25 19:20:24] [INFO ] Implicit Places using invariants in 32 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/34 places, 5/16 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 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5 transition count 4
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 5 transition count 3
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 4 transition count 3
Applied a total of 4 rules in 1 ms. Remains 4 /6 variables (removed 2) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 4 cols
[2024-05-25 19:20:24] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 19:20:24] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 19:20:24] [INFO ] Invariant cache hit.
[2024-05-25 19:20:24] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4/34 places, 3/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 145 ms. Remains : 4/34 places, 3/16 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-06
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLCardinality-06 finished in 237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((p1 U p2)))))'
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 16/16 transitions.
Graph (complete) has 73 edges and 34 vertex of which 26 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 3 ms. Remains 25 /34 variables (removed 9) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 25 cols
[2024-05-25 19:20:24] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 19:20:24] [INFO ] Implicit Places using invariants in 53 ms returned [5, 12, 13, 14, 16, 20]
[2024-05-25 19:20:24] [INFO ] Actually due to overlaps returned [5, 12, 13, 14, 20]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 56 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/34 places, 14/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 13
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 19 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 18 transition count 12
Applied a total of 4 rules in 5 ms. Remains 18 /20 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 18 cols
[2024-05-25 19:20:24] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 19:20:24] [INFO ] Implicit Places using invariants in 38 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/34 places, 12/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 17 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 11
Applied a total of 2 rules in 2 ms. Remains 16 /17 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 16 cols
[2024-05-25 19:20:24] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 19:20:24] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-25 19:20:24] [INFO ] Invariant cache hit.
[2024-05-25 19:20:25] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 16/34 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 186 ms. Remains : 16/34 places, 11/16 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-08
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLCardinality-08 finished in 344 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(((F(p0)||X(p1)) U p2))))'
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 27 transition count 16
Applied a total of 7 rules in 2 ms. Remains 27 /34 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2024-05-25 19:20:25] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 19:20:25] [INFO ] Implicit Places using invariants in 72 ms returned [4, 7, 12, 13, 14, 16, 20, 21]
[2024-05-25 19:20:25] [INFO ] Actually due to overlaps returned [4, 7, 12, 13, 14, 20, 21]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 74 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/34 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 20/34 places, 16/16 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-09
Product exploration explored 100000 steps with 4051 reset in 97 ms.
Product exploration explored 100000 steps with 4011 reset in 220 ms.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
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 p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 1101 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 244 steps (0 resets) in 6 ms. (34 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 12 factoid took 2862 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 20 cols
[2024-05-25 19:20:30] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 19:20:30] [INFO ] Implicit Places using invariants in 43 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/20 places, 16/16 transitions.
Applied a total of 0 rules in 4 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 19/20 places, 16/16 transitions.
Computed a total of 19 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 16
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 p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 1012 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 244 steps (0 resets) in 7 ms. (30 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 12 factoid took 2606 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 4060 reset in 102 ms.
Product exploration explored 100000 steps with 4019 reset in 256 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 16/16 transitions.
Graph (complete) has 25 edges and 19 vertex of which 17 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 17 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 4 place count 17 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 17 transition count 14
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 17 rules in 12 ms. Remains 12 /19 variables (removed 7) and now considering 9/16 (removed 7) transitions.
[2024-05-25 19:20:35] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-25 19:20:35] [INFO ] Computed 3 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem TDEAD7 is UNSAT
At refinement iteration 2 (OVERLAPS) 9/20 variables, 11/14 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/21 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 15 constraints, problems are : Problem set: 1 solved, 7 unsolved in 132 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 9/19 variables, 10/13 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/21 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 22 constraints, problems are : Problem set: 1 solved, 7 unsolved in 119 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 264ms problems are : Problem set: 1 solved, 7 unsolved
Search for dead transitions found 1 dead transitions in 265ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 12/19 places, 8/16 transitions.
Graph (complete) has 16 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 11 /12 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/19 places, 8/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 288 ms. Remains : 11/19 places, 8/16 transitions.
Support contains 3 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 19 cols
[2024-05-25 19:20:36] [INFO ] Computed 3 invariants in 0 ms
[2024-05-25 19:20:36] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-25 19:20:36] [INFO ] Invariant cache hit.
[2024-05-25 19:20:36] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-05-25 19:20:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 16/34 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/35 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 22 constraints, problems are : Problem set: 0 solved, 15 unsolved in 291 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 16/34 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/35 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 37 constraints, problems are : Problem set: 0 solved, 15 unsolved in 243 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 548ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 549ms
Finished structural reductions in LTL mode , in 1 iterations and 625 ms. Remains : 19/19 places, 16/16 transitions.
Treatment of property PermAdmissibility-COL-05-LTLCardinality-09 finished in 11645 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 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 16/16 transitions.
Graph (complete) has 73 edges and 34 vertex of which 29 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 3 ms. Remains 28 /34 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 28 cols
[2024-05-25 19:20:36] [INFO ] Computed 12 invariants in 1 ms
[2024-05-25 19:20:36] [INFO ] Implicit Places using invariants in 79 ms returned [4, 5, 6, 7, 12, 13, 14, 20, 21, 23]
[2024-05-25 19:20:36] [INFO ] Actually due to overlaps returned [4, 6, 7, 12, 13, 14, 20, 21]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 83 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/34 places, 16/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 14
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 17 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 14 transition count 10
Applied a total of 12 rules in 5 ms. Remains 14 /20 variables (removed 6) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 14 cols
[2024-05-25 19:20:36] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 19:20:36] [INFO ] Implicit Places using invariants in 44 ms returned [2, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/34 places, 10/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 12 transition count 7
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 8 transition count 6
Applied a total of 8 rules in 3 ms. Remains 8 /12 variables (removed 4) and now considering 6/10 (removed 4) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-25 19:20:36] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 19:20:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-25 19:20:36] [INFO ] Invariant cache hit.
[2024-05-25 19:20:37] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 8/34 places, 6/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 201 ms. Remains : 8/34 places, 6/16 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-10
Product exploration explored 100000 steps with 3225 reset in 110 ms.
Product exploration explored 100000 steps with 3225 reset in 117 ms.
Computed a total of 8 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 6
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 (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-25 19:20:37] [INFO ] Invariant cache hit.
[2024-05-25 19:20:37] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 19:20:37] [INFO ] Invariant cache hit.
[2024-05-25 19:20:37] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-25 19:20:37] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-25 19:20:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/14 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/14 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 15 constraints, problems are : Problem set: 0 solved, 5 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 160ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 8 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 6
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 (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3225 reset in 101 ms.
Product exploration explored 100000 steps with 3225 reset in 107 ms.
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-25 19:20:38] [INFO ] Invariant cache hit.
[2024-05-25 19:20:38] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 19:20:38] [INFO ] Invariant cache hit.
[2024-05-25 19:20:38] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-25 19:20:38] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-25 19:20:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/14 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/14 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 15 constraints, problems are : Problem set: 0 solved, 5 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 151ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 152ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 8/8 places, 6/6 transitions.
Treatment of property PermAdmissibility-COL-05-LTLCardinality-10 finished in 1934 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(p0)||(p1&&X(p2)))))'
Support contains 5 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 29 transition count 16
Applied a total of 5 rules in 2 ms. Remains 29 /34 variables (removed 5) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 29 cols
[2024-05-25 19:20:38] [INFO ] Computed 13 invariants in 1 ms
[2024-05-25 19:20:38] [INFO ] Implicit Places using invariants in 58 ms returned [4, 6, 7, 13, 14, 20, 21, 23]
[2024-05-25 19:20:38] [INFO ] Actually due to overlaps returned [4, 6, 7, 13, 14, 20, 21]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 59 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/34 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 22/34 places, 16/16 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLCardinality-11 finished in 219 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 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 27 transition count 16
Applied a total of 7 rules in 1 ms. Remains 27 /34 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2024-05-25 19:20:38] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 19:20:39] [INFO ] Implicit Places using invariants in 87 ms returned [4, 5, 6, 7, 13, 14, 16, 20, 21, 23]
[2024-05-25 19:20:39] [INFO ] Actually due to overlaps returned [4, 6, 7, 13, 14, 20, 21]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 89 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/34 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 20/34 places, 16/16 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 50 ms.
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
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 (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-12 finished in 379 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(p0)) U (X(X(G(p0)))||(X(X(p0))&&G(p1)))))'
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 27 transition count 16
Applied a total of 7 rules in 1 ms. Remains 27 /34 variables (removed 7) and now considering 16/16 (removed 0) transitions.
[2024-05-25 19:20:39] [INFO ] Invariant cache hit.
[2024-05-25 19:20:39] [INFO ] Implicit Places using invariants in 65 ms returned [4, 5, 6, 7, 12, 13, 14, 16, 20, 21, 23]
[2024-05-25 19:20:39] [INFO ] Actually due to overlaps returned [4, 6, 7, 12, 13, 14, 20, 21]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 67 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/34 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 19/34 places, 16/16 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-13
Product exploration explored 100000 steps with 24937 reset in 86 ms.
Product exploration explored 100000 steps with 24955 reset in 98 ms.
Computed a total of 19 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 16
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 p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 314 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter sensitive) to 8 states, 20 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40010 steps (412 resets) in 35 ms. (1111 steps per ms) remains 1/6 properties
BEST_FIRST walk for 976 steps (0 resets) in 7 ms. (122 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 15 factoid took 354 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-13 finished in 1603 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((X(p0)&&G(p1))) U G(p1)))'
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 27 transition count 16
Applied a total of 7 rules in 0 ms. Remains 27 /34 variables (removed 7) and now considering 16/16 (removed 0) transitions.
[2024-05-25 19:20:40] [INFO ] Invariant cache hit.
[2024-05-25 19:20:41] [INFO ] Implicit Places using invariants in 59 ms returned [4, 5, 6, 7, 13, 14, 16, 20, 21, 23]
[2024-05-25 19:20:41] [INFO ] Actually due to overlaps returned [4, 6, 7, 13, 14, 20, 21]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 60 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/34 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 20/34 places, 16/16 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-14
Stuttering criterion allowed to conclude after 2262 steps with 30 reset in 2 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLCardinality-14 finished in 197 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(((F(p0)||X(p1)) U p2))))'
Found a Lengthening insensitive property : PermAdmissibility-COL-05-LTLCardinality-09
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 34/34 places, 16/16 transitions.
Graph (complete) has 73 edges and 34 vertex of which 25 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 1 ms. Remains 24 /34 variables (removed 10) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 24 cols
[2024-05-25 19:20:41] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 19:20:41] [INFO ] Implicit Places using invariants in 57 ms returned [4, 7, 12, 13, 14, 16, 20]
[2024-05-25 19:20:41] [INFO ] Actually due to overlaps returned [4, 7, 12, 13, 14, 20]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 59 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 18/34 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 15 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 15 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 14 transition count 10
Applied a total of 6 rules in 3 ms. Remains 14 /18 variables (removed 4) and now considering 10/14 (removed 4) transitions.
// Phase 1: matrix 10 rows 14 cols
[2024-05-25 19:20:41] [INFO ] Computed 4 invariants in 0 ms
[2024-05-25 19:20:41] [INFO ] Implicit Places using invariants in 27 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 13/34 places, 10/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 12 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 8
Applied a total of 2 rules in 1 ms. Remains 11 /13 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-05-25 19:20:41] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 19:20:41] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-25 19:20:41] [INFO ] Invariant cache hit.
[2024-05-25 19:20:41] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 11/34 places, 8/16 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 166 ms. Remains : 11/34 places, 8/16 transitions.
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-09
Product exploration explored 100000 steps with 9289 reset in 94 ms.
Product exploration explored 100000 steps with 9225 reset in 103 ms.
Computed a total of 11 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 8
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 p2 (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 9 factoid took 1556 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 100 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F p0), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 9 factoid took 2663 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-25 19:20:46] [INFO ] Invariant cache hit.
[2024-05-25 19:20:46] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-25 19:20:46] [INFO ] Invariant cache hit.
[2024-05-25 19:20:46] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-05-25 19:20:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/18 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/19 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 14 constraints, problems are : Problem set: 0 solved, 7 unsolved in 115 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/18 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 21 constraints, problems are : Problem set: 0 solved, 7 unsolved in 114 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 234ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 235ms
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 11/11 places, 8/8 transitions.
Computed a total of 11 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 8
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 p2 (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 9 factoid took 1595 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 100 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F p0), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 9 factoid took 2551 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 9289 reset in 93 ms.
Product exploration explored 100000 steps with 9255 reset in 99 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-25 19:20:52] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-25 19:20:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/18 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/19 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 14 constraints, problems are : Problem set: 0 solved, 7 unsolved in 117 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/18 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 21 constraints, problems are : Problem set: 0 solved, 7 unsolved in 111 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 233ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 234ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 11/11 places, 8/8 transitions.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-25 19:20:52] [INFO ] Invariant cache hit.
[2024-05-25 19:20:52] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-25 19:20:52] [INFO ] Invariant cache hit.
[2024-05-25 19:20:52] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-05-25 19:20:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/18 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/19 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 14 constraints, problems are : Problem set: 0 solved, 7 unsolved in 99 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/18 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 21 constraints, problems are : Problem set: 0 solved, 7 unsolved in 115 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 222ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 223ms
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 11/11 places, 8/8 transitions.
Treatment of property PermAdmissibility-COL-05-LTLCardinality-09 finished in 12048 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)))'
[2024-05-25 19:20:53] [INFO ] Flatten gal took : 5 ms
[2024-05-25 19:20:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-25 19:20:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 34 places, 16 transitions and 70 arcs took 1 ms.
Total runtime 35244 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PermAdmissibility-COL-05

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 34
TRANSITIONS: 16
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1652
MODEL NAME: /home/mcc/execution/414/model
34 places, 16 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA PermAdmissibility-COL-05-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716664854987

--------------------
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

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-COL-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PermAdmissibility-COL-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-171654405700123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-05.tgz
mv PermAdmissibility-COL-05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;