Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.2K Apr 12 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 12 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 09:04 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.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 12 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 09:13 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-50-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717252192303

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:29:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:29:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:29:54] [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-06-01 14:29:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:29:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 892 ms
[2024-06-01 14:29:55] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 14:29:55] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 8 ms.
[2024-06-01 14:29:55] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-COL-50-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-50-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-50-LTLFireability-15 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 13 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).
Reduction of identical properties reduced properties to check from 17 to 13
RANDOM walk for 2860 steps (0 resets) in 44 ms. (63 steps per ms) remains 0/13 properties
[2024-06-01 14:29:55] [INFO ] Flatten gal took : 25 ms
[2024-06-01 14:29:55] [INFO ] Flatten gal took : 18 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-06-01 14:29:55] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 25 ms.
[2024-06-01 14:29:55] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 29 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 19 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-06-01 14:29:55] [INFO ] Computed 16 invariants in 10 ms
[2024-06-01 14:29:56] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-01 14:29:56] [INFO ] Invariant cache hit.
[2024-06-01 14:29:56] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-06-01 14:29:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/48 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 48 constraints, problems are : Problem set: 0 solved, 15 unsolved in 440 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 32/32 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/31 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/48 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 63 constraints, problems are : Problem set: 0 solved, 15 unsolved in 411 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 902ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 920ms
Starting structural reductions in LTL mode, iteration 1 : 32/40 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1305 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 29 out of 32 places after structural reductions.
[2024-06-01 14:29:57] [INFO ] Flatten gal took : 6 ms
[2024-06-01 14:29:57] [INFO ] Flatten gal took : 6 ms
[2024-06-01 14:29:57] [INFO ] Input system was already deterministic with 16 transitions.
Reduction of identical properties reduced properties to check from 17 to 13
RANDOM walk for 2810 steps (0 resets) in 35 ms. (78 steps per ms) remains 0/13 properties
FORMULA PermAdmissibility-COL-50-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 32 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 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' '!((p0 U ((p1||X(p2)) U p3)))'
Support contains 12 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 5 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-06-01 14:29:57] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 14:29:57] [INFO ] Implicit Places using invariants in 60 ms returned [4, 5, 6, 7, 14, 24, 26]
[2024-06-01 14:29:57] [INFO ] Actually due to overlaps returned [4, 5, 14, 24]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 65 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 27/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 310 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-01 finished in 482 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((p0||X(F((X(F(p0))&&p1))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 16 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 12 ms. Remains 14 /32 variables (removed 18) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 14 cols
[2024-06-01 14:29:57] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 14:29:58] [INFO ] Implicit Places using invariants in 49 ms returned [4, 5, 7, 9]
[2024-06-01 14:29:58] [INFO ] Actually due to overlaps returned [4, 5, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 50 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/32 places, 8/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 10 transition count 6
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 9 transition count 6
Applied a total of 2 rules in 7 ms. Remains 9 /11 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-06-01 14:29:58] [INFO ] Computed 3 invariants in 8 ms
[2024-06-01 14:29:58] [INFO ] Implicit Places using invariants in 37 ms returned [4]
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 : 8/32 places, 6/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 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
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 7 transition count 4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-06-01 14:29:58] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 14:29:58] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 14:29:58] [INFO ] Invariant cache hit.
[2024-06-01 14:29:58] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 6/32 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 158 ms. Remains : 6/32 places, 4/16 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-02
Stuttering criterion allowed to conclude after 7168 steps with 727 reset in 60 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-02 finished in 355 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(G(p0))||!(p1 U !p0)))&&F(p1)))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-06-01 14:29:58] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 14:29:58] [INFO ] Implicit Places using invariants in 71 ms returned [4, 6, 13, 15, 16, 17, 18, 23, 24, 25, 26]
[2024-06-01 14:29:58] [INFO ] Actually due to overlaps returned [4, 13, 15, 16, 23, 24]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 72 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 25/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-03
Product exploration explored 100000 steps with 4308 reset in 373 ms.
Product exploration explored 100000 steps with 4268 reset in 355 ms.
Computed a total of 25 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 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 p1) p0), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 161 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1894 steps (0 resets) in 8 ms. (210 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 16 rows 25 cols
[2024-06-01 14:29:59] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 14:29:59] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 3 ms returned sat
[2024-06-01 14:29:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 14:29:59] [INFO ] Computed and/alt/rep : 15/29/15 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 14:29:59] [INFO ] Added : 15 causal constraints over 3 iterations in 31 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 16/16 transitions.
Graph (complete) has 44 edges and 25 vertex of which 19 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 10
Applied a total of 2 rules in 5 ms. Remains 17 /25 variables (removed 8) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 17 cols
[2024-06-01 14:30:00] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 14:30:00] [INFO ] Implicit Places using invariants in 38 ms returned [5, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/25 places, 10/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 14 transition count 9
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 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 12 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4 place count 12 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 8 place count 10 transition count 6
Applied a total of 8 rules in 4 ms. Remains 10 /14 variables (removed 4) and now considering 6/10 (removed 4) transitions.
// Phase 1: matrix 6 rows 10 cols
[2024-06-01 14:30:00] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 14:30:00] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 14:30:00] [INFO ] Invariant cache hit.
[2024-06-01 14:30:00] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/25 places, 6/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 10/25 places, 6/16 transitions.
Computed a total of 10 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 820 steps (0 resets) in 6 ms. (117 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
[2024-06-01 14:30:00] [INFO ] Invariant cache hit.
[2024-06-01 14:30:00] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:30:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 14:30:00] [INFO ] Computed and/alt/rep : 5/9/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:30:00] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7439 reset in 117 ms.
Product exploration explored 100000 steps with 7462 reset in 92 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 6/6 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 3 ms. Remains 9 /10 variables (removed 1) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-06-01 14:30:00] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 14:30:00] [INFO ] Implicit Places using invariants in 26 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/10 places, 6/6 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 7 transition count 4
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 6 transition count 4
Applied a total of 2 rules in 1 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-06-01 14:30:00] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 14:30:01] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 14:30:01] [INFO ] Invariant cache hit.
[2024-06-01 14:30:01] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/10 places, 4/6 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76 ms. Remains : 6/10 places, 4/6 transitions.
Treatment of property PermAdmissibility-COL-50-LTLFireability-03 finished in 2740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-06-01 14:30:01] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 14:30:01] [INFO ] Implicit Places using invariants in 70 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 17, 22, 24]
[2024-06-01 14:30:01] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 15, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 72 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 23/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-04
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-04 finished in 168 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 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 16 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 1 ms. Remains 14 /32 variables (removed 18) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 14 cols
[2024-06-01 14:30:01] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 14:30:01] [INFO ] Implicit Places using invariants in 50 ms returned [4, 5, 7, 9]
[2024-06-01 14:30:01] [INFO ] Actually due to overlaps returned [4, 5, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/32 places, 8/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 10 transition count 6
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 9 transition count 6
Applied a total of 2 rules in 3 ms. Remains 9 /11 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-06-01 14:30:01] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 14:30:01] [INFO ] Implicit Places using invariants in 27 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/32 places, 6/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 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 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 2 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-06-01 14:30:01] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 14:30:01] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 14:30:01] [INFO ] Invariant cache hit.
[2024-06-01 14:30:01] [INFO ] Implicit Places using invariants and state equation in 37 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 : 7/32 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 146 ms. Remains : 7/32 places, 5/16 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-05
Product exploration explored 100000 steps with 398 reset in 158 ms.
Product exploration explored 100000 steps with 398 reset in 204 ms.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
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 (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-50-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-50-LTLFireability-05 finished in 603 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)||(p1 U p2)))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-06-01 14:30:01] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 14:30:01] [INFO ] Implicit Places using invariants in 69 ms returned [5, 7, 14, 15, 16, 17, 18, 24, 26]
[2024-06-01 14:30:01] [INFO ] Actually due to overlaps returned [5, 14, 15, 16, 24]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 70 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/32 places, 16/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 26 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 25 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 25 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 24 transition count 14
Applied a total of 4 rules in 4 ms. Remains 24 /26 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 24 cols
[2024-06-01 14:30:01] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 14:30:01] [INFO ] Implicit Places using invariants in 44 ms returned [6, 12, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 45 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/32 places, 14/16 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 20 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 16 transition count 10
Applied a total of 8 rules in 2 ms. Remains 16 /20 variables (removed 4) and now considering 10/14 (removed 4) transitions.
// Phase 1: matrix 10 rows 16 cols
[2024-06-01 14:30:01] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 14:30:01] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 14:30:01] [INFO ] Invariant cache hit.
[2024-06-01 14:30:02] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 16/32 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 183 ms. Remains : 16/32 places, 10/16 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-08
Product exploration explored 100000 steps with 3666 reset in 116 ms.
Product exploration explored 100000 steps with 3673 reset in 127 ms.
Computed a total of 16 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 10
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 597 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1382 steps (0 resets) in 8 ms. (153 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 11 factoid took 654 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:30:03] [INFO ] Invariant cache hit.
[2024-06-01 14:30:03] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 14:30:03] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 14:30:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:30:03] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2024-06-01 14:30:03] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 14:30:03] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:30:03] [INFO ] Added : 9 causal constraints over 2 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 14:30:03] [INFO ] Invariant cache hit.
[2024-06-01 14:30:03] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 14:30:03] [INFO ] Invariant cache hit.
[2024-06-01 14:30:04] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-06-01 14:30:04] [INFO ] Redundant transitions in 1 ms returned []
Running 9 sub problems to find dead transitions.
[2024-06-01 14:30:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/26 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 22 constraints, problems are : Problem set: 0 solved, 9 unsolved in 113 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/26 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 31 constraints, problems are : Problem set: 0 solved, 9 unsolved in 139 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 257ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 257ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 16/16 places, 10/10 transitions.
Computed a total of 16 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 10
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1432 steps (0 resets) in 5 ms. (238 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:30:04] [INFO ] Invariant cache hit.
[2024-06-01 14:30:04] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2024-06-01 14:30:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 14:30:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:30:04] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 14:30:04] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 14:30:04] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:30:04] [INFO ] Added : 9 causal constraints over 2 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3727 reset in 103 ms.
Product exploration explored 100000 steps with 3669 reset in 115 ms.
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 10/10 transitions.
Ensure Unique test removed 1 places
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 15 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 12 transition count 8
Applied a total of 5 rules in 2 ms. Remains 12 /16 variables (removed 4) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 14:30:05] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:30:05] [INFO ] Implicit Places using invariants in 34 ms returned [2, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/16 places, 8/10 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-06-01 14:30:05] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 14:30:05] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 14:30:05] [INFO ] Invariant cache hit.
[2024-06-01 14:30:05] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/16 places, 5/10 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 83 ms. Remains : 7/16 places, 5/10 transitions.
Treatment of property PermAdmissibility-COL-50-LTLFireability-08 finished in 3400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G((p1&&X(G((X(G(!p0))||p2))))))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 0 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-06-01 14:30:05] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 14:30:05] [INFO ] Implicit Places using invariants in 54 ms returned [4, 5, 6, 7, 12, 13, 14, 16, 23, 25]
[2024-06-01 14:30:05] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 23]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 55 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 24/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-09
Product exploration explored 100000 steps with 7454 reset in 116 ms.
Product exploration explored 100000 steps with 7394 reset in 125 ms.
Computed a total of 24 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 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) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 204 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40032 steps (48 resets) in 43 ms. (909 steps per ms) remains 1/6 properties
BEST_FIRST walk for 1847 steps (0 resets) in 16 ms. (108 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 542 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 16/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 24 transition count 15
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 23 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 14
Applied a total of 4 rules in 5 ms. Remains 22 /24 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 22 cols
[2024-06-01 14:30:07] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 14:30:07] [INFO ] Implicit Places using invariants in 41 ms returned [4, 5, 10, 17]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/24 places, 14/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 18 transition count 11
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 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 14 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 14 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 12 transition count 8
Applied a total of 12 rules in 5 ms. Remains 12 /18 variables (removed 6) and now considering 8/14 (removed 6) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 14:30:07] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:30:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 14:30:07] [INFO ] Invariant cache hit.
[2024-06-01 14:30:07] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/24 places, 8/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 12/24 places, 8/16 transitions.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 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 (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 290 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40080 steps (96 resets) in 28 ms. (1382 steps per ms) remains 1/6 properties
BEST_FIRST walk for 251 steps (0 resets) in 6 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 484 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 15048 reset in 110 ms.
Product exploration explored 100000 steps with 15202 reset in 114 ms.
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 14:30:09] [INFO ] Invariant cache hit.
[2024-06-01 14:30:09] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 14:30:09] [INFO ] Invariant cache hit.
[2024-06-01 14:30:09] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-01 14:30:09] [INFO ] Redundant transitions in 1 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 14:30:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 93 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 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/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 23 constraints, problems are : Problem set: 0 solved, 7 unsolved in 94 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 194ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 12/12 places, 8/8 transitions.
Treatment of property PermAdmissibility-COL-50-LTLFireability-09 finished in 4042 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)||(!p1 U p2))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-06-01 14:30:09] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 14:30:09] [INFO ] Implicit Places using invariants in 55 ms returned [4, 6, 12, 13, 14, 16, 22, 24]
[2024-06-01 14:30:09] [INFO ] Actually due to overlaps returned [4, 12, 13, 14, 22]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 57 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 25/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-10
Product exploration explored 100000 steps with 7437 reset in 86 ms.
Product exploration explored 100000 steps with 7443 reset in 94 ms.
Computed a total of 25 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 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 p2) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 593 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 820 steps (0 resets) in 4 ms. (164 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 14 factoid took 616 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 16 rows 25 cols
[2024-06-01 14:30:11] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 14:30:11] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 3 ms returned sat
[2024-06-01 14:30:11] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 14:30:11] [INFO ] Computed and/alt/rep : 15/33/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 14:30:11] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-06-01 14:30:11] [INFO ] Invariant cache hit.
[2024-06-01 14:30:11] [INFO ] Implicit Places using invariants in 32 ms returned [5, 12, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 16/16 transitions.
Applied a total of 0 rules in 0 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 34 ms. Remains : 22/25 places, 16/16 transitions.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 820 steps (0 resets) in 6 ms. (117 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 16 rows 22 cols
[2024-06-01 14:30:11] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 14:30:11] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2024-06-01 14:30:11] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 14:30:11] [INFO ] Computed and/alt/rep : 15/27/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 14:30:11] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7479 reset in 73 ms.
Product exploration explored 100000 steps with 7466 reset in 86 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Graph (complete) has 37 edges and 22 vertex of which 8 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 3 ms. Remains 8 /22 variables (removed 14) and now considering 6/16 (removed 10) transitions.
[2024-06-01 14:30:12] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 14:30:12] [INFO ] Computed 2 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/14 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 10 constraints, problems are : Problem set: 2 solved, 3 unsolved in 70 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 3/12 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/14 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 13 constraints, problems are : Problem set: 2 solved, 3 unsolved in 64 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 2 solved, 3 unsolved
Search for dead transitions found 2 dead transitions in 140ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 4/16 transitions.
Graph (complete) has 7 edges and 8 vertex of which 6 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 4/4 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/22 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 6/22 places, 4/16 transitions.
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2024-06-01 14:30:12] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 14:30:12] [INFO ] Implicit Places using invariants in 33 ms returned [4, 5, 16, 17]
[2024-06-01 14:30:12] [INFO ] Actually due to overlaps returned [4, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 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 37 ms. Remains : 20/22 places, 16/16 transitions.
Treatment of property PermAdmissibility-COL-50-LTLFireability-10 finished in 3568 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((G(p0)||F((p1||G(!p2))))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 2 ms. Remains 26 /32 variables (removed 6) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 26 cols
[2024-06-01 14:30:12] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 14:30:12] [INFO ] Implicit Places using invariants in 48 ms returned [4, 6, 12, 13, 15, 17]
[2024-06-01 14:30:12] [INFO ] Actually due to overlaps returned [4, 12, 13, 15]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 50 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 14/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 21 transition count 12
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 20 transition count 12
Applied a total of 2 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 20 cols
[2024-06-01 14:30:12] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 14:30:12] [INFO ] Implicit Places using invariants in 31 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/32 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 18 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 17 transition count 11
Applied a total of 2 rules in 1 ms. Remains 17 /18 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 17 cols
[2024-06-01 14:30:12] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 14:30:12] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 14:30:12] [INFO ] Invariant cache hit.
[2024-06-01 14:30:13] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 17/32 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 151 ms. Remains : 17/32 places, 11/16 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-11
Product exploration explored 100000 steps with 9967 reset in 113 ms.
Stuttering criterion allowed to conclude after 81882 steps with 8102 reset in 102 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-11 finished in 459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 8 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 1 ms. Remains 7 /32 variables (removed 25) and now considering 4/16 (removed 12) transitions.
// Phase 1: matrix 4 rows 7 cols
[2024-06-01 14:30:13] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 14:30:13] [INFO ] Implicit Places using invariants in 27 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/32 places, 4/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 5 transition count 2
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 4 transition count 2
Applied a total of 2 rules in 1 ms. Remains 4 /6 variables (removed 2) and now considering 2/4 (removed 2) transitions.
// Phase 1: matrix 2 rows 4 cols
[2024-06-01 14:30:13] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 14:30:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 14:30:13] [INFO ] Invariant cache hit.
[2024-06-01 14:30:13] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/32 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 72 ms. Remains : 4/32 places, 2/16 transitions.
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-12
Stuttering criterion allowed to conclude after 150 steps with 4 reset in 0 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-12 finished in 152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0))||F((G(p2)||p1)))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 20 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 4 ms. Remains 19 /32 variables (removed 13) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 19 cols
[2024-06-01 14:30:13] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 14:30:13] [INFO ] Implicit Places using invariants in 37 ms returned [10, 11, 13]
[2024-06-01 14:30:13] [INFO ] Actually due to overlaps returned [10, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/32 places, 10/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 9
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 9
Applied a total of 2 rules in 2 ms. Remains 16 /17 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 16 cols
[2024-06-01 14:30:13] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 14:30:13] [INFO ] Implicit Places using invariants in 27 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/32 places, 9/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 15 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 14 transition count 8
Applied a total of 2 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 14 cols
[2024-06-01 14:30:13] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 14:30:13] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 14:30:13] [INFO ] Invariant cache hit.
[2024-06-01 14:30:13] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 14/32 places, 8/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 137 ms. Remains : 14/32 places, 8/16 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-13
Product exploration explored 100000 steps with 12152 reset in 117 ms.
Product exploration explored 100000 steps with 12256 reset in 129 ms.
Computed a total of 14 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 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 p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p0))), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 18 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-50-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-50-LTLFireability-13 finished in 534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((F(G(p2))&&p1)))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 0 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-06-01 14:30:14] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 14:30:14] [INFO ] Implicit Places using invariants in 49 ms returned [5, 7, 13, 16, 18, 23, 24, 25, 26]
[2024-06-01 14:30:14] [INFO ] Actually due to overlaps returned [5, 13, 16, 23, 24]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 51 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 26/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-14 finished in 343 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(G(p0))||!(p1 U !p0)))&&F(p1)))'
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)||(p1 U p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G((p1&&X(G((X(G(!p0))||p2))))))))'
Found a Lengthening insensitive property : PermAdmissibility-COL-50-LTLFireability-09
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 2 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-06-01 14:30:14] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 14:30:14] [INFO ] Implicit Places using invariants in 72 ms returned [4, 5, 6, 7, 12, 13, 14, 16, 23, 25]
[2024-06-01 14:30:14] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 23]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 74 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 24/32 places, 16/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 24 transition count 15
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 23 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 14
Applied a total of 4 rules in 3 ms. Remains 22 /24 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 22 cols
[2024-06-01 14:30:14] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 14:30:14] [INFO ] Implicit Places using invariants in 33 ms returned [4, 5, 10, 17]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 35 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 18/32 places, 14/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 18 transition count 11
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 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 14 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 14 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 12 transition count 8
Applied a total of 12 rules in 3 ms. Remains 12 /18 variables (removed 6) and now considering 8/14 (removed 6) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 14:30:14] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:30:14] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 14:30:14] [INFO ] Invariant cache hit.
[2024-06-01 14:30:14] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 12/32 places, 8/16 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 171 ms. Remains : 12/32 places, 8/16 transitions.
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-09
Product exploration explored 100000 steps with 15073 reset in 91 ms.
Product exploration explored 100000 steps with 15100 reset in 103 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 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 (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 290 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40080 steps (96 resets) in 23 ms. (1670 steps per ms) remains 1/6 properties
BEST_FIRST walk for 233 steps (0 resets) in 4 ms. (46 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 563 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 14:30:16] [INFO ] Invariant cache hit.
[2024-06-01 14:30:16] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 14:30:16] [INFO ] Invariant cache hit.
[2024-06-01 14:30:16] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-06-01 14:30:16] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 14:30:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 109 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 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/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 23 constraints, problems are : Problem set: 0 solved, 7 unsolved in 112 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 227ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 308 ms. Remains : 12/12 places, 8/8 transitions.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 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 (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 289 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 31444 steps (75 resets) in 20 ms. (1497 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 481 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 15083 reset in 102 ms.
Product exploration explored 100000 steps with 15141 reset in 111 ms.
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 14:30:18] [INFO ] Invariant cache hit.
[2024-06-01 14:30:18] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 14:30:18] [INFO ] Invariant cache hit.
[2024-06-01 14:30:18] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-06-01 14:30:18] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 14:30:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 109 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 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/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 23 constraints, problems are : Problem set: 0 solved, 7 unsolved in 106 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 223ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 223ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 284 ms. Remains : 12/12 places, 8/8 transitions.
Treatment of property PermAdmissibility-COL-50-LTLFireability-09 finished in 4375 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)||(!p1 U p2))))'
[2024-06-01 14:30:19] [INFO ] Flatten gal took : 6 ms
[2024-06-01 14:30:19] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 14:30:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 16 transitions and 75 arcs took 5 ms.
Total runtime 25143 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PermAdmissibility-COL-50-LTLFireability-03
Could not compute solution for formula : PermAdmissibility-COL-50-LTLFireability-08
FORMULA PermAdmissibility-COL-50-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717252244959

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PermAdmissibility-COL-50-LTLFireability-03
ltl formula formula --ltl=/tmp/1779/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 16 transitions and 75 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1779/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1779/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1779/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1779/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 33 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 33, there are 95 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~501 levels ~10000 states ~22884 transitions
pnml2lts-mc( 1/ 4): ~501 levels ~20000 states ~46072 transitions
pnml2lts-mc( 1/ 4): ~501 levels ~40000 states ~96404 transitions
pnml2lts-mc( 1/ 4): ~501 levels ~80000 states ~200280 transitions
pnml2lts-mc( 0/ 4): ~492 levels ~160000 states ~436280 transitions
pnml2lts-mc( 0/ 4): ~492 levels ~320000 states ~910464 transitions
pnml2lts-mc( 0/ 4): ~492 levels ~640000 states ~1897976 transitions
pnml2lts-mc( 0/ 4): ~492 levels ~1280000 states ~3947828 transitions
pnml2lts-mc( 1/ 4): ~501 levels ~2560000 states ~7682436 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3722644
pnml2lts-mc( 0/ 4): unique states count: 3724328
pnml2lts-mc( 0/ 4): unique transitions count: 11682873
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 7954307
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 3725063
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1994
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3725063 states 11686528 transitions, fanout: 3.137
pnml2lts-mc( 0/ 4): Total exploration time 9.050 sec (9.040 sec minimum, 9.045 sec on average)
pnml2lts-mc( 0/ 4): States per second: 411609, Transitions per second: 1291329
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 92.4MB, 26.0 B/state, compr.: 19.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 11.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 16 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 92.4MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-COL-50-LTLFireability-08
ltl formula formula --ltl=/tmp/1779/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 16 transitions and 75 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1779/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1779/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1779/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1779/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 34 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 33, there are 55 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~645 levels ~10000 states ~22392 transitions
pnml2lts-mc( 0/ 4): ~645 levels ~20000 states ~48188 transitions
pnml2lts-mc( 3/ 4): ~652 levels ~40000 states ~92556 transitions
pnml2lts-mc( 3/ 4): ~652 levels ~80000 states ~199096 transitions
pnml2lts-mc( 2/ 4): ~648 levels ~160000 states ~364904 transitions
pnml2lts-mc( 2/ 4): ~648 levels ~320000 states ~733256 transitions
pnml2lts-mc( 2/ 4): ~648 levels ~640000 states ~1479536 transitions
pnml2lts-mc( 2/ 4): ~648 levels ~1280000 states ~2988860 transitions
pnml2lts-mc( 2/ 4): ~648 levels ~2560000 states ~6229180 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4705630
pnml2lts-mc( 0/ 4): unique states count: 4707791
pnml2lts-mc( 0/ 4): unique transitions count: 14245387
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 9531178
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4708496
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2589
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4708496 states 14248594 transitions, fanout: 3.026
pnml2lts-mc( 0/ 4): Total exploration time 10.300 sec (10.260 sec minimum, 10.282 sec on average)
pnml2lts-mc( 0/ 4): States per second: 457136, Transitions per second: 1383359
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 99.9MB, 22.2 B/state, compr.: 16.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 14.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 16 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 99.9MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-COL-50-LTLFireability-09
ltl formula formula --ltl=/tmp/1779/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 16 transitions and 75 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1779/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1779/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1779/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1779/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 34 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 33, there are 34 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~202 levels ~10000 states ~54976 transitions
pnml2lts-mc( 2/ 4): ~202 levels ~20000 states ~112432 transitions
pnml2lts-mc( 2/ 4): ~202 levels ~40000 states ~229972 transitions
pnml2lts-mc( 2/ 4): ~202 levels ~80000 states ~471124 transitions
pnml2lts-mc( 3/ 4): ~200 levels ~160000 states ~1021036 transitions
pnml2lts-mc( 2/ 4): ~202 levels ~320000 states ~2292172 transitions
pnml2lts-mc( 3/ 4): ~200 levels ~640000 states ~4524856 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 609076
pnml2lts-mc( 0/ 4): unique states count: 609076
pnml2lts-mc( 0/ 4): unique transitions count: 4403847
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 4327492
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 678811
pnml2lts-mc( 0/ 4): - cum. max stack depth: 793
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 678811 states 5208100 transitions, fanout: 7.672
pnml2lts-mc( 0/ 4): Total exploration time 2.550 sec (2.540 sec minimum, 2.543 sec on average)
pnml2lts-mc( 0/ 4): States per second: 266200, Transitions per second: 2042392
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 24.5MB, 42.2 B/state, compr.: 31.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/31.0%
pnml2lts-mc( 0/ 4): Stored 16 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 24.5MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-COL-50-LTLFireability-10
ltl formula formula --ltl=/tmp/1779/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 16 transitions and 75 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1779/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1779/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1779/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1779/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 34 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 33, there are 56 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~199 levels ~10000 states ~20404 transitions
pnml2lts-mc( 2/ 4): ~199 levels ~20000 states ~42528 transitions
pnml2lts-mc( 0/ 4): ~202 levels ~40000 states ~78328 transitions
pnml2lts-mc( 0/ 4): ~202 levels ~80000 states ~159076 transitions
pnml2lts-mc( 0/ 4): ~202 levels ~160000 states ~360536 transitions
pnml2lts-mc( 0/ 4): ~202 levels ~320000 states ~773760 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 609076
pnml2lts-mc( 0/ 4): unique states count: 609076
pnml2lts-mc( 0/ 4): unique transitions count: 1467981
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 859150
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 609721
pnml2lts-mc( 0/ 4): - cum. max stack depth: 796
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 609721 states 1470775 transitions, fanout: 2.412
pnml2lts-mc( 0/ 4): Total exploration time 1.800 sec (1.800 sec minimum, 1.800 sec on average)
pnml2lts-mc( 0/ 4): States per second: 338734, Transitions per second: 817097
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 24.5MB, 42.2 B/state, compr.: 31.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/31.0%
pnml2lts-mc( 0/ 4): Stored 16 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 24.5MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PermAdmissibility-COL-50, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407000148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-50.tgz
mv PermAdmissibility-COL-50 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;