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.r285-smll-171654421900072.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 gold2023
Input is PermAdmissibility-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654421900072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.3K Apr 12 09:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 09:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 09:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 09:08 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.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 09:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 09:16 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-02-LTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716846088533

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-02
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-27 21:41:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 21:41:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:41:31] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 21:41:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 21:41:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 758 ms
[2024-05-27 21:41:31] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 21:41:32] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 7 ms.
[2024-05-27 21:41:32] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-COL-02-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLCardinality-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 13 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 208 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 26) seen :21
Incomplete Best-First random walk after 10000 steps, including 153 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 158 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 126 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 16 rows 40 cols
[2024-05-27 21:41:33] [INFO ] Computed 24 invariants in 11 ms
[2024-05-27 21:41:33] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-27 21:41:33] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA PermAdmissibility-COL-02-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 21:41:33] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-27 21:41:33] [INFO ] Flatten gal took : 29 ms
FORMULA PermAdmissibility-COL-02-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 21:41:33] [INFO ] Flatten gal took : 19 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2024-05-27 21:41:33] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 11 ms.
[2024-05-27 21:41:33] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Support contains 20 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 34 transition count 16
Applied a total of 6 rules in 10 ms. Remains 34 /40 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 34 cols
[2024-05-27 21:41:33] [INFO ] Computed 18 invariants in 2 ms
[2024-05-27 21:41:34] [INFO ] Implicit Places using invariants in 91 ms returned [16, 22, 29, 30]
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 : 30/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 30/40 places, 16/16 transitions.
Support contains 20 out of 30 places after structural reductions.
[2024-05-27 21:41:34] [INFO ] Flatten gal took : 4 ms
[2024-05-27 21:41:34] [INFO ] Flatten gal took : 4 ms
[2024-05-27 21:41:34] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10001 steps, including 207 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10000 steps, including 153 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 30 cols
[2024-05-27 21:41:34] [INFO ] Computed 14 invariants in 5 ms
[2024-05-27 21:41:34] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 11 ms returned sat
[2024-05-27 21:41:34] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 30 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(!p1)) U X(p2)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 26 transition count 16
Applied a total of 4 rules in 2 ms. Remains 26 /30 variables (removed 4) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2024-05-27 21:41:34] [INFO ] Computed 10 invariants in 1 ms
[2024-05-27 21:41:34] [INFO ] Implicit Places using invariants in 89 ms returned [3, 5, 11, 13, 14, 18, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 91 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/30 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 19/30 places, 16/16 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 426 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2), true, p1]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 3 s5), p1:(OR (LEQ 3 s4) (LEQ 3 s12)), p2:(OR (LEQ 3 s5) (AND (LEQ 3 s12) (LEQ s13 s3)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-00 finished in 593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Graph (complete) has 64 edges and 30 vertex of which 27 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
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 26 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 24 transition count 14
Applied a total of 5 rules in 21 ms. Remains 24 /30 variables (removed 6) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 24 cols
[2024-05-27 21:41:35] [INFO ] Computed 10 invariants in 1 ms
[2024-05-27 21:41:35] [INFO ] Implicit Places using invariants in 122 ms returned [3, 5, 6, 7, 11, 12, 13, 15, 16, 20]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 128 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/30 places, 14/16 transitions.
Graph (complete) has 13 edges and 14 vertex of which 13 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 12 transition count 3
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 3 transition count 2
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 21 place count 2 transition count 2
Applied a total of 21 rules in 4 ms. Remains 2 /14 variables (removed 12) and now considering 2/14 (removed 12) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-27 21:41:35] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 21:41:35] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-27 21:41:35] [INFO ] Invariant cache hit.
[2024-05-27 21:41:35] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/30 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 207 ms. Remains : 2/30 places, 2/16 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 20000 reset in 504 ms.
Product exploration explored 100000 steps with 20000 reset in 232 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-02-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLCardinality-02 finished in 1068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0)||X(F(p1))) U X(p2))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 28 transition count 16
Applied a total of 2 rules in 1 ms. Remains 28 /30 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 28 cols
[2024-05-27 21:41:36] [INFO ] Computed 12 invariants in 1 ms
[2024-05-27 21:41:36] [INFO ] Implicit Places using invariants in 57 ms returned [5, 7, 8, 9, 16, 19, 20, 24]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 59 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/30 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 20/30 places, 16/16 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s1 s10), p2:(LEQ s9 s0), p1:(GT 3 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22673 reset in 192 ms.
Product exploration explored 100000 steps with 22830 reset in 201 ms.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 2523 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 208 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16 rows 20 cols
[2024-05-27 21:41:39] [INFO ] Computed 4 invariants in 1 ms
[2024-05-27 21:41:39] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 21:41:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-27 21:41:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 21:41:39] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p2) p1)), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT p2)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 21 factoid took 9217 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 11
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 14 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 14 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 13 transition count 9
Applied a total of 14 rules in 5 ms. Remains 13 /20 variables (removed 7) and now considering 9/16 (removed 7) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-05-27 21:41:49] [INFO ] Computed 4 invariants in 0 ms
[2024-05-27 21:41:49] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-27 21:41:49] [INFO ] Invariant cache hit.
[2024-05-27 21:41:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-27 21:41:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 21:41:49] [INFO ] Invariant cache hit.
[2024-05-27 21:41:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/20 places, 9/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 13/20 places, 9/16 transitions.
Computed a total of 13 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 13 transition count 9
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 p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1099 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 361 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 245 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:41:50] [INFO ] Invariant cache hit.
[2024-05-27 21:41:51] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 21:41:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 21:41:51] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 21:41:51] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 3151 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 8265 reset in 119 ms.
Product exploration explored 100000 steps with 8228 reset in 119 ms.
Built C files in :
/tmp/ltsmin16941403288037757443
[2024-05-27 21:41:54] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2024-05-27 21:41:54] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:41:54] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2024-05-27 21:41:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:41:54] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2024-05-27 21:41:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:41:54] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16941403288037757443
Running compilation step : cd /tmp/ltsmin16941403288037757443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 292 ms.
Running link step : cd /tmp/ltsmin16941403288037757443;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16941403288037757443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10483386828550706567.hoa' '--buchi-type=spotba'
LTSmin run took 114 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLCardinality-03 finished in 19298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Graph (complete) has 64 edges and 30 vertex of which 4 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 1 ms. Remains 3 /30 variables (removed 27) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 3 cols
[2024-05-27 21:41:55] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 21:41:55] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-27 21:41:55] [INFO ] Invariant cache hit.
[2024-05-27 21:41:55] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-27 21:41:55] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 21:41:55] [INFO ] Invariant cache hit.
[2024-05-27 21:41:55] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/30 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 3/30 places, 2/16 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s0), p1:(LEQ 3 s0)], 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 4 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-04 finished in 175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((p1||F(p2))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 26 transition count 16
Applied a total of 4 rules in 1 ms. Remains 26 /30 variables (removed 4) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2024-05-27 21:41:55] [INFO ] Computed 10 invariants in 0 ms
[2024-05-27 21:41:55] [INFO ] Implicit Places using invariants in 68 ms returned [3, 6, 7, 11, 17, 18, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 70 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/30 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 19/30 places, 16/16 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 s10), p1:(GT 2 s9), p2:(GT s18 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6375 reset in 78 ms.
Product exploration explored 100000 steps with 6402 reset in 138 ms.
Computed a total of 19 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 1714 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 25 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F p2)]
Knowledge based reduction with 12 factoid took 1962 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 p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 3 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, 16/16 transitions.
Graph (complete) has 24 edges and 19 vertex of which 17 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 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 16 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 5 place count 14 transition count 11
Applied a total of 5 rules in 4 ms. Remains 14 /19 variables (removed 5) and now considering 11/16 (removed 5) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-27 21:42:00] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 21:42:00] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-27 21:42:00] [INFO ] Invariant cache hit.
[2024-05-27 21:42:00] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-27 21:42:00] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 21:42:00] [INFO ] Invariant cache hit.
[2024-05-27 21:42:00] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/19 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 14/19 places, 11/16 transitions.
Computed a total of 14 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 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 p1 (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 129 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 73 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 19 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F p2)]
Knowledge based reduction with 5 factoid took 200 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 73 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering criterion allowed to conclude after 83820 steps with 6922 reset in 65 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-05 finished in 5341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(p1)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 27 transition count 16
Applied a total of 3 rules in 1 ms. Remains 27 /30 variables (removed 3) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2024-05-27 21:42:00] [INFO ] Computed 11 invariants in 0 ms
[2024-05-27 21:42:01] [INFO ] Implicit Places using invariants in 51 ms returned [4, 6, 8, 12, 14, 15, 18, 19, 23]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 53 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/30 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 56 ms. Remains : 18/30 places, 16/16 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ s5 s0), p1:(LEQ 1 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 50 ms.
Product exploration explored 100000 steps with 33333 reset in 67 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 : [(AND p0 (NOT p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
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 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-02-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLCardinality-06 finished in 395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 26 transition count 16
Applied a total of 4 rules in 2 ms. Remains 26 /30 variables (removed 4) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2024-05-27 21:42:01] [INFO ] Computed 10 invariants in 1 ms
[2024-05-27 21:42:01] [INFO ] Implicit Places using invariants in 57 ms returned [5, 6, 7, 11, 13, 14, 17, 18]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 64 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/30 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 67 ms. Remains : 18/30 places, 16/16 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s14 s3)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-08 finished in 170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(p0&&G(p1)&&(p2||X(p3))))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 27 transition count 16
Applied a total of 3 rules in 2 ms. Remains 27 /30 variables (removed 3) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2024-05-27 21:42:01] [INFO ] Computed 11 invariants in 0 ms
[2024-05-27 21:42:01] [INFO ] Implicit Places using invariants in 62 ms returned [4, 6, 7, 8, 12, 14, 18, 23]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 64 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/30 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 19/30 places, 16/16 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2) p0 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 2 s18), p0:(GT s12 s0), p2:(LEQ 2 s9), p3:(GT 1 s18)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3527 reset in 127 ms.
Product exploration explored 100000 steps with 3532 reset in 141 ms.
Computed a total of 19 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 p0 (NOT p3)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p3))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 1084 ms. Reduced automaton from 4 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 21 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3)), false]
Incomplete random walk after 10000 steps, including 207 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10000 steps, including 140 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 16 rows 19 cols
[2024-05-27 21:42:03] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 21:42:03] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-27 21:42:03] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 21:42:03] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 p0 (NOT p3)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p3)), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (OR (AND p0 p1 p2) (AND p0 p1 p3))), (F p0), (F (AND p0 p1 (NOT p2) p3)), (F (AND p0 p1 (NOT p2))), (F (AND p0 p1 p2 (NOT p3))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND p0 p1 (NOT p2) (NOT p3))), (F (AND p0 (NOT p1) (NOT p3)))]
Knowledge based reduction with 25 factoid took 3929 ms. Reduced automaton from 5 states, 21 edges and 4 AP (stutter insensitive) to 5 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 329 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false]
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false]
[2024-05-27 21:42:08] [INFO ] Invariant cache hit.
[2024-05-27 21:42:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 21:42:08] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 21:42:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-27 21:42:08] [INFO ] Computed and/alt/rep : 15/19/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 21:42:08] [INFO ] Added : 6 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 16/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 18 transition count 13
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 16 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 14 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 14 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 12 transition count 9
Applied a total of 12 rules in 7 ms. Remains 12 /19 variables (removed 7) and now considering 9/16 (removed 7) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-27 21:42:08] [INFO ] Computed 3 invariants in 0 ms
[2024-05-27 21:42:08] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-27 21:42:08] [INFO ] Invariant cache hit.
[2024-05-27 21:42:08] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-27 21:42:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 21:42:08] [INFO ] Invariant cache hit.
[2024-05-27 21:42:08] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/19 places, 9/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 12/19 places, 9/16 transitions.
Computed a total of 12 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p3) p1 p2))), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 p2))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 p3 p1) (AND p0 p1 p2)))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p3) p1 p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 p3 p1) (AND p0 p1 p2))))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G p3)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 35 factoid took 2396 ms. Reduced automaton from 5 states, 23 edges and 4 AP (stutter insensitive) to 5 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false]
Incomplete random walk after 10000 steps, including 362 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10000 steps, including 267 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 261 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 277 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 256 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-27 21:42:11] [INFO ] Invariant cache hit.
[2024-05-27 21:42:11] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-27 21:42:11] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 21:42:11] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-27 21:42:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 21:42:11] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 21:42:11] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p3) p1 p2))), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 p2))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 p3 p1) (AND p0 p1 p2)))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p3) p1 p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 p3 p1) (AND p0 p1 p2))))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G p3)), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p3))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p1 (NOT p2) (NOT p3))), (F (OR (AND p0 p1 p2) (AND p0 p1 p3))), (F p0), (F (AND p0 p1 (NOT p2) p3)), (F (AND p0 p1 p2 (NOT p3))), (F (AND p0 p1 (NOT p2))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND p0 p1 (NOT p2) (NOT p3))), (F (AND p0 (NOT p1) (NOT p3)))]
Knowledge based reduction with 39 factoid took 9088 ms. Reduced automaton from 5 states, 23 edges and 4 AP (stutter insensitive) to 5 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false]
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false]
[2024-05-27 21:42:21] [INFO ] Invariant cache hit.
[2024-05-27 21:42:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 21:42:21] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 21:42:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:21] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-27 21:42:21] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 21:42:21] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false]
Stuttering criterion allowed to conclude after 4334 steps with 292 reset in 7 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-10 finished in 19878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 26 transition count 16
Applied a total of 4 rules in 1 ms. Remains 26 /30 variables (removed 4) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2024-05-27 21:42:21] [INFO ] Computed 10 invariants in 1 ms
[2024-05-27 21:42:21] [INFO ] Implicit Places using invariants in 60 ms returned [3, 5, 6, 7, 11, 13, 14, 17, 18, 22]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 62 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/30 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 16/30 places, 16/16 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s2)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-11 finished in 159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Graph (complete) has 64 edges and 30 vertex of which 4 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 1 ms. Remains 3 /30 variables (removed 27) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 3 cols
[2024-05-27 21:42:21] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 21:42:21] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-27 21:42:21] [INFO ] Invariant cache hit.
[2024-05-27 21:42:21] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-27 21:42:21] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 21:42:21] [INFO ] Invariant cache hit.
[2024-05-27 21:42:21] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/30 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 3/30 places, 2/16 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 20000 reset in 49 ms.
Product exploration explored 100000 steps with 20000 reset in 76 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-27 21:42:22] [INFO ] Invariant cache hit.
[2024-05-27 21:42:22] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 21:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:22] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-27 21:42:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:42:22] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-27 21:42:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-27 21:42:22] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 21:42:22] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-05-27 21:42:22] [INFO ] Invariant cache hit.
[2024-05-27 21:42:22] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-27 21:42:22] [INFO ] Invariant cache hit.
[2024-05-27 21:42:22] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-27 21:42:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 21:42:22] [INFO ] Invariant cache hit.
[2024-05-27 21:42:22] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 3/3 places, 2/2 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-27 21:42:22] [INFO ] Invariant cache hit.
[2024-05-27 21:42:22] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 21:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-27 21:42:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:42:22] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 21:42:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:22] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-27 21:42:22] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-27 21:42:22] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 54 ms.
Product exploration explored 100000 steps with 20000 reset in 67 ms.
Built C files in :
/tmp/ltsmin1305859493259332329
[2024-05-27 21:42:22] [INFO ] Computing symmetric may disable matrix : 2 transitions.
[2024-05-27 21:42:22] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:42:22] [INFO ] Computing symmetric may enable matrix : 2 transitions.
[2024-05-27 21:42:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:42:22] [INFO ] Computing Do-Not-Accords matrix : 2 transitions.
[2024-05-27 21:42:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:42:22] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1305859493259332329
Running compilation step : cd /tmp/ltsmin1305859493259332329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 85 ms.
Running link step : cd /tmp/ltsmin1305859493259332329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1305859493259332329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6882997880842019095.hoa' '--buchi-type=spotba'
LTSmin run took 42 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLCardinality-12 finished in 1473 ms.
All properties solved by simple procedures.
Total runtime 52112 ms.

BK_STOP 1716846144550

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

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

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