Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.6K Feb 26 01:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 01:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 01:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 01:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Feb 26 01:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 54K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679044423387

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-50
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 09:13:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 09:13:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 09:13:46] [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.
[2023-03-17 09:13:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 09:13:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 890 ms
[2023-03-17 09:13:47] [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 27 ms.
Working with output stream class java.io.PrintStream
[2023-03-17 09:13:47] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 7 ms.
[2023-03-17 09:13:47] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 7 formulas.
FORMULA PermAdmissibility-COL-50-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-50-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-50-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-50-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-50-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-50-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-50-LTLFireability-13 TRUE 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 9 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10008 steps, including 12 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :12
Finished Best-First random walk after 403 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=67 )
[2023-03-17 09:13:47] [INFO ] Flatten gal took : 36 ms
[2023-03-17 09:13:47] [INFO ] Flatten gal took : 8 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2023-03-17 09:13:47] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 12 ms.
[2023-03-17 09:13:47] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 28 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 10 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2023-03-17 09:13:47] [INFO ] Computed 16 place invariants in 9 ms
[2023-03-17 09:13:48] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-17 09:13:48] [INFO ] Invariant cache hit.
[2023-03-17 09:13:48] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2023-03-17 09:13:48] [INFO ] Invariant cache hit.
[2023-03-17 09:13:48] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/40 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 611 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 28 out of 32 places after structural reductions.
[2023-03-17 09:13:48] [INFO ] Flatten gal took : 5 ms
[2023-03-17 09:13:48] [INFO ] Flatten gal took : 21 ms
[2023-03-17 09:13:48] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10008 steps, including 12 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :12
Finished Best-First random walk after 423 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=52 )
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p1)))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2023-03-17 09:13:48] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-17 09:13:48] [INFO ] Implicit Places using invariants in 81 ms returned [4, 6, 14, 15, 16, 17, 18, 24, 26]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 85 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 22/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 349 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s8 1) (GEQ s11 1)), p0:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s20 1) (GEQ s0 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 3 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-00 finished in 512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((!p0&&F(!p1))) U p2)))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 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
[2023-03-17 09:13:49] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-17 09:13:49] [INFO ] Implicit Places using invariants in 82 ms returned [5, 7, 13, 15, 16, 17, 18, 24, 26]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 84 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 22/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (NOT p2), (OR p0 p1), p1]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s21 1)), p0:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)), p1:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3487 reset in 345 ms.
Product exploration explored 100000 steps with 3742 reset in 278 ms.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 631 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (NOT p2), p0]
Finished random walk after 715 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=357 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p2), (F p0), (F (AND (NOT p2) p0))]
Knowledge based reduction with 13 factoid took 614 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p2)]
// Phase 1: matrix 16 rows 22 cols
[2023-03-17 09:13:51] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 09:13:51] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-17 09:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:13:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-17 09:13:51] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 32 ms.
[2023-03-17 09:13:52] [INFO ] Added : 15 causal constraints over 3 iterations in 81 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-17 09:13:52] [INFO ] Invariant cache hit.
[2023-03-17 09:13:52] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 09:13:52] [INFO ] Invariant cache hit.
[2023-03-17 09:13:52] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-17 09:13:52] [INFO ] Invariant cache hit.
[2023-03-17 09:13:52] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 22/22 places, 16/16 transitions.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 256 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p2)]
Finished random walk after 715 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=357 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
[2023-03-17 09:13:52] [INFO ] Invariant cache hit.
[2023-03-17 09:13:52] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-17 09:13:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:13:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-17 09:13:52] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-17 09:13:52] [INFO ] Added : 15 causal constraints over 3 iterations in 37 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
Product exploration explored 100000 steps with 1348 reset in 143 ms.
Product exploration explored 100000 steps with 1342 reset in 404 ms.
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 12
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 17 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 17 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 13 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 11 transition count 7
Applied a total of 17 rules in 15 ms. Remains 11 /22 variables (removed 11) and now considering 7/16 (removed 9) transitions.
// Phase 1: matrix 7 rows 11 cols
[2023-03-17 09:13:53] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-17 09:13:53] [INFO ] Implicit Places using invariants in 75 ms returned [2, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 7/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 3 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-17 09:13:53] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 09:13:53] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-17 09:13:53] [INFO ] Invariant cache hit.
[2023-03-17 09:13:53] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/22 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 251 ms. Remains : 6/22 places, 4/16 transitions.
Treatment of property PermAdmissibility-COL-50-LTLFireability-03 finished in 4444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F(p1))))'
Support contains 6 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 removed 4 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 3 ms. Remains 22 /32 variables (removed 10) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 22 cols
[2023-03-17 09:13:53] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-17 09:13:53] [INFO ] Implicit Places using invariants in 49 ms returned [4, 6, 12, 13, 14, 16]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 50 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/32 places, 12/16 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 16 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 2 ms. Remains 12 /16 variables (removed 4) and now considering 8/12 (removed 4) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-17 09:13:53] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-17 09:13:53] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-17 09:13:53] [INFO ] Invariant cache hit.
[2023-03-17 09:13:53] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/32 places, 8/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 12/32 places, 8/16 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s9 1) (GEQ s10 1)), p1:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 26438 steps with 1460 reset in 32 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-04 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions 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
[2023-03-17 09:13:54] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-17 09:13:54] [INFO ] Implicit Places using invariants in 68 ms returned [4, 6, 12, 13, 14, 15, 16, 17]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 69 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/32 places, 12/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 10 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 10 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 7 transition count 5
Applied a total of 12 rules in 2 ms. Remains 7 /14 variables (removed 7) and now considering 5/12 (removed 7) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-17 09:13:54] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 09:13:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 09:13:54] [INFO ] Invariant cache hit.
[2023-03-17 09:13:54] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/32 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 7/32 places, 5/16 transitions.
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5016 reset in 140 ms.
Product exploration explored 100000 steps with 5022 reset in 182 ms.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-50-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-50-LTLFireability-05 finished in 665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p1 U (G(!p1)||(!p1&&(!p2||F(G(!p3))))))&&p0))))'
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 7 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2023-03-17 09:13:54] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-17 09:13:54] [INFO ] Implicit Places using invariants in 61 ms returned [5, 7, 13, 15, 16, 17, 18]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 74 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 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 82 ms. Remains : 24/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p3), (OR (AND (NOT p0) p3) (AND p1 p3))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p3 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={1} source=2 dest: 3}, { cond=(AND p3 p1), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 p3 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1)), acceptance={1} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p3) (AND p3 p1)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s8 1) (LT s10 1) (LT s11 1)) (OR (LT s17 1) (LT s19 1) (LT s21 1))), p1:(AND (GEQ s16 1) (GEQ s18 1) (GEQ s22 1)), p2:(AND (GEQ s2 1) (GEQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Computed a total of 24 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : [(X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1))))]
Property proved to be true thanks to knowledge :(F (G (NOT p3)))
Knowledge based reduction with 12 factoid took 428 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-50-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-50-LTLFireability-06 finished in 1022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
[2023-03-17 09:13:55] [INFO ] Invariant cache hit.
[2023-03-17 09:13:55] [INFO ] Implicit Places using invariants in 59 ms returned [4, 6, 13, 15, 16, 17, 18, 23, 24, 25, 26]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 60 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)), p1:(OR (LT s0 1) (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 86 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-09 finished in 169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G((p1||G(!p2))))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2023-03-17 09:13:55] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-17 09:13:55] [INFO ] Implicit Places using invariants in 63 ms returned [5, 7, 12, 13, 22, 23, 24, 25]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 79 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 22/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 267 ms :[true, (AND (NOT p0) p2 (NOT p1)), p2, (AND p2 (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p0)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (GEQ s10 1) (GEQ s12 1) (GEQ s16 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1)), p2:(AND (GEQ s11 1) (GEQ s13 1) (GEQ s15 1)), p1:(AND (GEQ s10 1) (GEQ s12 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-12 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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.
[2023-03-17 09:13:56] [INFO ] Invariant cache hit.
[2023-03-17 09:13:56] [INFO ] Implicit Places using invariants in 68 ms returned [5, 7, 12, 13, 14, 15, 16, 17, 22, 23, 24, 25]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 70 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 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 73 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 75 ms.
Product exploration explored 100000 steps with 50000 reset in 97 ms.
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 (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 4 factoid took 113 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-50-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-50-LTLFireability-14 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U 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 20 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 3 ms. Remains 18 /32 variables (removed 14) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 18 cols
[2023-03-17 09:13:56] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-17 09:13:56] [INFO ] Implicit Places using invariants in 60 ms returned [8, 9, 10, 11, 12, 13]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 75 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/32 places, 10/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 7 transition count 5
Applied a total of 8 rules in 6 ms. Remains 7 /12 variables (removed 5) and now considering 5/10 (removed 5) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-17 09:13:56] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 09:13:56] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-17 09:13:56] [INFO ] Invariant cache hit.
[2023-03-17 09:13:56] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/32 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 147 ms. Remains : 7/32 places, 5/16 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)), p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4037 steps with 91 reset in 6 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-15 finished in 255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((!p0&&F(!p1))) U p2)))'
[2023-03-17 09:13:57] [INFO ] Flatten gal took : 4 ms
[2023-03-17 09:13:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-17 09:13:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 16 transitions and 75 arcs took 0 ms.
Total runtime 10972 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/926/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PermAdmissibility-COL-50-LTLFireability-03

BK_STOP 1679044439020

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name PermAdmissibility-COL-50-LTLFireability-03
ltl formula formula --ltl=/tmp/926/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 16 transitions and 75 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/926/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/926/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/926/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/926/ltl_0_
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), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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