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-171654406900108.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-01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654406900108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 9.6K Apr 12 09:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 09:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 09:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 09:12 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.7K 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.4K 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 14K Apr 12 09:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 09:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 09:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 09:25 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-01-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717251194452

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-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:13:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:13:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:13:16] [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:13:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:13:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1044 ms
[2024-06-01 14:13:17] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 14:13:18] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 7 ms.
[2024-06-01 14:13:18] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PermAdmissibility-COL-01-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
FORMULA PermAdmissibility-COL-01-LTLFireability-01 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).
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 60 steps (0 resets) in 30 ms. (1 steps per ms) remains 0/16 properties
[2024-06-01 14:13:18] [INFO ] Flatten gal took : 30 ms
[2024-06-01 14:13:18] [INFO ] Flatten gal took : 10 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:13:18] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 23 ms.
[2024-06-01 14:13:18] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 31 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 27 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:13:18] [INFO ] Computed 16 invariants in 11 ms
[2024-06-01 14:13:18] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-06-01 14:13:18] [INFO ] Invariant cache hit.
[2024-06-01 14:13:18] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-06-01 14:13:18] [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 479 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 348 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 876ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 895ms
Starting structural reductions in LTL mode, iteration 1 : 32/40 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1316 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 31 out of 32 places after structural reductions.
[2024-06-01 14:13:19] [INFO ] Flatten gal took : 7 ms
[2024-06-01 14:13:19] [INFO ] Flatten gal took : 6 ms
[2024-06-01 14:13:19] [INFO ] Input system was already deterministic with 16 transitions.
RANDOM walk for 60 steps (0 resets) in 22 ms. (2 steps per ms) remains 0/15 properties
FORMULA PermAdmissibility-COL-01-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PermAdmissibility-COL-01-LTLFireability-04 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' '!(X((G((p0 U p1))||((p0 U p1)&&X(F(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 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:13:20] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 14:13:20] [INFO ] Implicit Places using invariants in 83 ms returned [5, 7, 14, 15, 16, 17, 19, 24, 26]
[2024-06-01 14:13:20] [INFO ] Actually due to overlaps returned [5, 14, 15, 17, 24]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 88 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 94 ms. Remains : 26/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 459 ms :[(NOT p1), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-00 finished in 640 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))&&F(p1)))'
Support contains 4 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.1 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 12 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:13:20] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 14:13:20] [INFO ] Implicit Places using invariants in 25 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 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.
Applied a total of 0 rules in 2 ms. Remains 5 /6 variables (removed 1) and now considering 3/4 (removed 1) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40 ms. Remains : 5/32 places, 3/16 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-02
Product exploration explored 100000 steps with 25000 reset in 328 ms.
Product exploration explored 100000 steps with 25000 reset in 177 ms.
Computed a total of 5 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT p1)), (X p0), (X (X p1)), (X (X (NOT p0))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-01-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-01-LTLFireability-02 finished in 745 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 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:13:21] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 14:13:21] [INFO ] Implicit Places using invariants in 103 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 22, 23, 25, 26]
[2024-06-01 14:13:21] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 22, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 107 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 110 ms. Remains : 23/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-03 finished in 211 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.
[2024-06-01 14:13:21] [INFO ] Invariant cache hit.
[2024-06-01 14:13:21] [INFO ] Implicit Places using invariants in 115 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 23, 25]
[2024-06-01 14:13:21] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 16, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 117 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 0 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 120 ms. Remains : 23/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-05 finished in 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(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.
[2024-06-01 14:13:21] [INFO ] Invariant cache hit.
[2024-06-01 14:13:22] [INFO ] Implicit Places using invariants in 65 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 22, 23, 25, 26]
[2024-06-01 14:13:22] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 22, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 66 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 68 ms. Remains : 23/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-06
Product exploration explored 100000 steps with 16666 reset in 342 ms.
Product exploration explored 100000 steps with 16666 reset in 192 ms.
Computed a total of 23 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 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 94 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 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 6 ms. (2 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 109 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 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 16 rows 23 cols
[2024-06-01 14:13:23] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 14:13:23] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 14:13:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 14:13:23] [INFO ] Computed and/alt/rep : 15/29/15 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 14:13:23] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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.
[2024-06-01 14:13:23] [INFO ] Invariant cache hit.
[2024-06-01 14:13:23] [INFO ] Implicit Places using invariants in 53 ms returned [4, 5, 10, 18, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 54 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/23 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 18/23 places, 16/16 transitions.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 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 86 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 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 5 ms. (3 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 102 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 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 16 rows 18 cols
[2024-06-01 14:13:23] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 14:13:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 14:13:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 14:13:23] [INFO ] Computed and/alt/rep : 15/19/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 14:13:23] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 181 ms.
Product exploration explored 100000 steps with 16666 reset in 139 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 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Graph (complete) has 21 edges and 18 vertex of which 8 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 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 5 ms. Remains 8 /18 variables (removed 10) and now considering 6/16 (removed 10) transitions.
[2024-06-01 14:13:24] [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:13:24] [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 59 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 135ms problems are : Problem set: 2 solved, 3 unsolved
Search for dead transitions found 2 dead transitions in 135ms
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/18 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.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 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/18 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 147 ms. Remains : 6/18 places, 4/16 transitions.
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 18 cols
[2024-06-01 14:13:24] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 14:13:25] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 14:13:25] [INFO ] Invariant cache hit.
[2024-06-01 14:13:25] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-06-01 14:13:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 16/33 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/34 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 20 constraints, problems are : Problem set: 0 solved, 15 unsolved in 223 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 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/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 16/33 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/34 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/34 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 193 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 423ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 423ms
Finished structural reductions in LTL mode , in 1 iterations and 485 ms. Remains : 18/18 places, 16/16 transitions.
Treatment of property PermAdmissibility-COL-01-LTLFireability-06 finished in 3550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 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 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:13:25] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 14:13:25] [INFO ] Implicit Places using invariants in 92 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18]
[2024-06-01 14:13:25] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 16]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 94 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 96 ms. Remains : 24/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 58 ms.
Product exploration explored 100000 steps with 50000 reset in 65 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 : [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 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-01-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-01-LTLFireability-07 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' '!(((G(!p0) U !p1) U X(p2)))'
Support contains 7 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:13:25] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 14:13:25] [INFO ] Implicit Places using invariants in 60 ms returned [4, 6, 12, 15, 16, 17, 19, 23, 24, 26, 27]
[2024-06-01 14:13:25] [INFO ] Actually due to overlaps returned [4, 12, 15, 17, 23, 24]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 63 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 65 ms. Remains : 25/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), true, p0, p1]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-08 finished in 342 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)||X((G(F(!p1)) U (!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 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:13:26] [INFO ] Computed 15 invariants in 11 ms
[2024-06-01 14:13:26] [INFO ] Implicit Places using invariants in 93 ms returned [5, 7, 14, 17, 19, 23, 27]
[2024-06-01 14:13:26] [INFO ] Actually due to overlaps returned [5, 14, 17, 23]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 95 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 0 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 97 ms. Remains : 27/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3) p2 p1), p1, p1, (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3))]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-09
Product exploration explored 100000 steps with 27934 reset in 174 ms.
Product exploration explored 100000 steps with 27989 reset in 208 ms.
Computed a total of 27 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND (NOT p3) p2 p1))), (X (NOT (AND (NOT p0) (NOT p3) p2 p1))), (X (NOT p3)), (X (NOT (AND (NOT p3) p2))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) p3 p1) (AND (NOT p0) (NOT p2) p1))))), (X (X (NOT (OR (AND p0 p3) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT p3))), (X (X (AND (NOT p3) p2))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p3))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 195 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
RANDOM walk for 52 steps (0 resets) in 8 ms. (5 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND (NOT p3) p2 p1))), (X (NOT (AND (NOT p0) (NOT p3) p2 p1))), (X (NOT p3)), (X (NOT (AND (NOT p3) p2))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) p3 p1) (AND (NOT p0) (NOT p2) p1))))), (X (X (NOT (OR (AND p0 p3) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT p3))), (X (X (AND (NOT p3) p2))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p3))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p3)]
Knowledge based reduction with 23 factoid took 358 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Support contains 6 out of 27 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 : 27/27 places, 16/16 transitions.
Graph (complete) has 59 edges and 27 vertex of which 24 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 24 transition count 13
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 3 place count 23 transition count 13
Applied a total of 3 rules in 2 ms. Remains 23 /27 variables (removed 4) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 23 cols
[2024-06-01 14:13:27] [INFO ] Computed 10 invariants in 0 ms
[2024-06-01 14:13:27] [INFO ] Implicit Places using invariants in 40 ms returned [6, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/27 places, 13/16 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 21 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 19 transition count 11
Applied a total of 4 rules in 2 ms. Remains 19 /21 variables (removed 2) and now considering 11/13 (removed 2) transitions.
// Phase 1: matrix 11 rows 19 cols
[2024-06-01 14:13:27] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 14:13:27] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 14:13:27] [INFO ] Invariant cache hit.
[2024-06-01 14:13:27] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/27 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110 ms. Remains : 19/27 places, 11/16 transitions.
Computed a total of 19 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p3)), (X (NOT p3)), (X (X (NOT p3))), (F (G p0)), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
RANDOM walk for 40 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p3)), (X (NOT p3)), (X (X (NOT p3))), (F (G p0)), (F (G (NOT p3)))]
False Knowledge obtained : [(F (NOT p0)), (F p3)]
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 8698 reset in 174 ms.
Product exploration explored 100000 steps with 8698 reset in 92 ms.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 11/11 transitions.
Ensure Unique test removed 1 places
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 2 place count 17 transition count 10
Applied a total of 2 rules in 6 ms. Remains 17 /19 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 17 cols
[2024-06-01 14:13:28] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 14:13:28] [INFO ] Implicit Places using invariants in 42 ms returned [4, 5, 9]
[2024-06-01 14:13:28] [INFO ] Actually due to overlaps returned [4, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/19 places, 10/11 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 9/10 (removed 1) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50 ms. Remains : 14/19 places, 9/11 transitions.
Treatment of property PermAdmissibility-COL-01-LTLFireability-09 finished in 2750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&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 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:13:28] [INFO ] Computed 14 invariants in 4 ms
[2024-06-01 14:13:29] [INFO ] Implicit Places using invariants in 73 ms returned [4, 6, 12, 13, 16, 18, 22, 23, 25, 26]
[2024-06-01 14:13:29] [INFO ] Actually due to overlaps returned [4, 12, 13, 16, 22, 23]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 78 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 80 ms. Remains : 24/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-11 finished in 214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((G(p1) U p2)))))'
Support contains 7 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 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 2 ms. Remains 22 /32 variables (removed 10) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 22 cols
[2024-06-01 14:13:29] [INFO ] Computed 10 invariants in 0 ms
[2024-06-01 14:13:29] [INFO ] Implicit Places using invariants in 44 ms returned [12, 13, 14, 15, 16, 18]
[2024-06-01 14:13:29] [INFO ] Actually due to overlaps returned [12, 13, 14, 16]
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 1 : 18/32 places, 12/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 16 transition count 10
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 16 transition count 9
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 15 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 14 transition count 8
Applied a total of 5 rules in 3 ms. Remains 14 /18 variables (removed 4) and now considering 8/12 (removed 4) transitions.
// Phase 1: matrix 8 rows 14 cols
[2024-06-01 14:13:29] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 14:13:29] [INFO ] Implicit Places using invariants in 29 ms returned [9, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/32 places, 8/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 82 ms. Remains : 12/32 places, 8/16 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-12
Product exploration explored 100000 steps with 16666 reset in 179 ms.
Product exploration explored 100000 steps with 16666 reset in 184 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) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 137 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (4444 resets) in 493 ms. (80 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40000 steps (4444 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 14:13:30] [INFO ] Computed 4 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 20/20 variables, and 16 constraints, problems are : Problem set: 1 solved, 0 unsolved in 37 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1))), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) p1))), (F p0), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 21 factoid took 400 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 39 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
[2024-06-01 14:13:30] [INFO ] Invariant cache hit.
[2024-06-01 14:13:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 14:13:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 14:13:30] [INFO ] Computed and/alt/rep : 7/15/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:13:30] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 7 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:13:30] [INFO ] Invariant cache hit.
[2024-06-01 14:13:30] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 14:13:30] [INFO ] Invariant cache hit.
[2024-06-01 14:13:30] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-01 14:13:30] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 14:13:30] [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 116 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 108 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 230ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 231ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 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) (NOT p2) (NOT p1)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 459 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))]
Knowledge based reduction with 14 factoid took 625 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 41 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
[2024-06-01 14:13:32] [INFO ] Invariant cache hit.
[2024-06-01 14:13:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 14:13:32] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 14:13:32] [INFO ] Computed and/alt/rep : 7/15/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:13:32] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 16666 reset in 95 ms.
Product exploration explored 100000 steps with 16666 reset in 104 ms.
Support contains 7 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:13:32] [INFO ] Invariant cache hit.
[2024-06-01 14:13:32] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 14:13:32] [INFO ] Invariant cache hit.
[2024-06-01 14:13:32] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-06-01 14:13:32] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 14:13:32] [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 100 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 116 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 221ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 222ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 282 ms. Remains : 12/12 places, 8/8 transitions.
Treatment of property PermAdmissibility-COL-01-LTLFireability-12 finished in 3864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1)||X(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 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 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:13:33] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 14:13:33] [INFO ] Implicit Places using invariants in 63 ms returned [5, 7, 12, 15, 16, 17, 19, 23, 24, 26, 27]
[2024-06-01 14:13:33] [INFO ] Actually due to overlaps returned [5, 12, 15, 17, 23, 24]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 64 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 67 ms. Remains : 25/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-15
Product exploration explored 100000 steps with 9147 reset in 79 ms.
Product exploration explored 100000 steps with 9154 reset in 90 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 p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p2), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 21 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-01-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-01-LTLFireability-15 finished in 465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : PermAdmissibility-COL-01-LTLFireability-06
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 5 ms. Remains 10 /32 variables (removed 22) and now considering 6/16 (removed 10) transitions.
// Phase 1: matrix 6 rows 10 cols
[2024-06-01 14:13:33] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 14:13:33] [INFO ] Implicit Places using invariants in 29 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 8/32 places, 6/16 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 8 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 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:13:33] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 14:13:33] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 14:13:33] [INFO ] Invariant cache hit.
[2024-06-01 14:13:33] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 6/32 places, 4/16 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 83 ms. Remains : 6/32 places, 4/16 transitions.
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-06
Product exploration explored 100000 steps with 25000 reset in 50 ms.
Product exploration explored 100000 steps with 25000 reset in 72 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
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 85 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 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 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 112 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 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 14:13:34] [INFO ] Invariant cache hit.
[2024-06-01 14:13:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 14:13:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 14:13:34] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:13:34] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 14:13:34] [INFO ] Invariant cache hit.
[2024-06-01 14:13:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 14:13:34] [INFO ] Invariant cache hit.
[2024-06-01 14:13:34] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 3 sub problems to find dead transitions.
[2024-06-01 14:13:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/10 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 54 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/10 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 11 constraints, problems are : Problem set: 0 solved, 3 unsolved in 57 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 6/6 places, 4/4 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
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 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 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 102 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 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 14:13:35] [INFO ] Invariant cache hit.
[2024-06-01 14:13:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 14:13:35] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 14:13:35] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:13:35] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 49 ms.
Product exploration explored 100000 steps with 25000 reset in 61 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 14:13:35] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 14:13:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/10 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 53 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/10 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 11 constraints, problems are : Problem set: 0 solved, 3 unsolved in 54 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 6/6 places, 4/4 transitions.
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 14:13:35] [INFO ] Invariant cache hit.
[2024-06-01 14:13:35] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 14:13:35] [INFO ] Invariant cache hit.
[2024-06-01 14:13:35] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Running 3 sub problems to find dead transitions.
[2024-06-01 14:13:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/10 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/10 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 11 constraints, problems are : Problem set: 0 solved, 3 unsolved in 46 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 96ms
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 6/6 places, 4/4 transitions.
Treatment of property PermAdmissibility-COL-01-LTLFireability-06 finished in 2497 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)||X((G(F(!p1)) U (!p2 U p3))))))'
Found a Lengthening insensitive property : PermAdmissibility-COL-01-LTLFireability-09
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3) p2 p1), p1, p1, (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3))]
Support contains 12 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_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.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 1 ms. Remains 27 /32 variables (removed 5) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 27 cols
[2024-06-01 14:13:36] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 14:13:36] [INFO ] Implicit Places using invariants in 67 ms returned [5, 7, 14, 17, 19]
[2024-06-01 14:13:36] [INFO ] Actually due to overlaps returned [5, 14, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 70 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 24/32 places, 14/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 13
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 13
Applied a total of 2 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 23 cols
[2024-06-01 14:13:36] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 14:13:36] [INFO ] Implicit Places using invariants in 36 ms returned [6, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 21/32 places, 13/16 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 21 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 19 transition count 11
Applied a total of 4 rules in 1 ms. Remains 19 /21 variables (removed 2) and now considering 11/13 (removed 2) transitions.
// Phase 1: matrix 11 rows 19 cols
[2024-06-01 14:13:36] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 14:13:36] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 14:13:36] [INFO ] Invariant cache hit.
[2024-06-01 14:13:36] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 19/32 places, 11/16 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 180 ms. Remains : 19/32 places, 11/16 transitions.
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-09
Product exploration explored 100000 steps with 27477 reset in 92 ms.
Product exploration explored 100000 steps with 27420 reset in 99 ms.
Computed a total of 19 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND (NOT p3) p2 p1))), (X (NOT (AND (NOT p0) (NOT p3) p2 p1))), (X (NOT p3)), (X (NOT (AND (NOT p3) p2))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) p3 p1) (AND (NOT p0) (NOT p2) p1))))), (X (X (NOT (OR (AND p0 p3) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT p3))), (X (X (AND (NOT p3) p2))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p3))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 183 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
RANDOM walk for 40 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND (NOT p3) p2 p1))), (X (NOT (AND (NOT p0) (NOT p3) p2 p1))), (X (NOT p3)), (X (NOT (AND (NOT p3) p2))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) p3 p1) (AND (NOT p0) (NOT p2) p1))))), (X (X (NOT (OR (AND p0 p3) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT p3))), (X (X (AND (NOT p3) p2))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p3))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p3)]
Knowledge based reduction with 23 factoid took 256 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Support contains 6 out of 19 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 : 19/19 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-06-01 14:13:37] [INFO ] Invariant cache hit.
[2024-06-01 14:13:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 14:13:37] [INFO ] Invariant cache hit.
[2024-06-01 14:13:37] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-06-01 14:13:37] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-06-01 14:13:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/30 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 27 constraints, problems are : Problem set: 0 solved, 10 unsolved in 180 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/30 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 37 constraints, problems are : Problem set: 0 solved, 10 unsolved in 177 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 362ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 363ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 434 ms. Remains : 19/19 places, 11/11 transitions.
Computed a total of 19 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p3)), (X (NOT p3)), (X (X (NOT p3))), (F (G p0)), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
RANDOM walk for 40 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p3)), (X (NOT p3)), (X (X (NOT p3))), (F (G p0)), (F (G (NOT p3)))]
False Knowledge obtained : [(F (NOT p0)), (F p3)]
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 8695 reset in 72 ms.
Product exploration explored 100000 steps with 8692 reset in 82 ms.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 11/11 transitions.
Ensure Unique test removed 1 places
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 2 place count 17 transition count 10
Applied a total of 2 rules in 2 ms. Remains 17 /19 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 17 cols
[2024-06-01 14:13:38] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 14:13:38] [INFO ] Implicit Places using invariants in 41 ms returned [4, 5, 9]
[2024-06-01 14:13:38] [INFO ] Actually due to overlaps returned [4, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/19 places, 10/11 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 9/10 (removed 1) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47 ms. Remains : 14/19 places, 9/11 transitions.
Treatment of property PermAdmissibility-COL-01-LTLFireability-09 finished in 2866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((G(p1) U p2)))))'
[2024-06-01 14:13:38] [INFO ] Flatten gal took : 5 ms
[2024-06-01 14:13:38] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 14:13:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 16 transitions and 75 arcs took 4 ms.
Total runtime 22629 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PermAdmissibility-COL-01-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLFireability-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717251219711

--------------------
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-01-LTLFireability-06
ltl formula formula --ltl=/tmp/1597/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.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1597/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1597/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1597/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1597/ltl_0_
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 21 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6
pnml2lts-mc( 0/ 4): unique states count: 6
pnml2lts-mc( 0/ 4): unique transitions count: 6
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 24
pnml2lts-mc( 0/ 4): - cum. max stack depth: 24
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 24 states 28 transitions, fanout: 1.167
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 73.3 B/state, compr.: 54.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.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: 0.0MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-COL-01-LTLFireability-09
ltl formula formula --ltl=/tmp/1597/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/1597/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1597/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1597/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1597/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 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 100 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 60
pnml2lts-mc( 0/ 4): unique states count: 60
pnml2lts-mc( 0/ 4): unique transitions count: 323
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 419
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 144
pnml2lts-mc( 0/ 4): - cum. max stack depth: 69
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 144 states 725 transitions, fanout: 5.035
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 32.1 B/state, compr.: 24.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.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: 0.0MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-COL-01-LTLFireability-12
ltl formula formula --ltl=/tmp/1597/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( 1/ 4): LTL layer: formula: /tmp/1597/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1597/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1597/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1597/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 33 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 33, there are 85 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10
pnml2lts-mc( 0/ 4): unique states count: 10
pnml2lts-mc( 0/ 4): unique transitions count: 58
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 96
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 39
pnml2lts-mc( 0/ 4): - cum. max stack depth: 39
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 39 states 236 transitions, fanout: 6.051
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 60.8 B/state, compr.: 45.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.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: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

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