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-171654421900087.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-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654421900087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 9.5K Apr 12 09:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 09:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 12 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 12 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 09:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 09:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 09:12 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-20-LTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-20-LTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-20-LTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-20-LTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-20-LTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-20-LTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-20-LTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-20-LTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-20-LTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-20-LTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-20-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-20-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-20-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-20-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-20-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716850392880

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-20
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-27 22:53:16] [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 22:53:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:53:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 22:53:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:53:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1110 ms
[2024-05-27 22:53:17] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 22:53:17] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 10 ms.
[2024-05-27 22:53:17] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-COL-20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-LTLCardinality-10 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 10004 steps, including 29 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 29) seen :27
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 40 cols
[2024-05-27 22:53:18] [INFO ] Computed 24 invariants in 9 ms
[2024-05-27 22:53:18] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 22:53:18] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 21 ms returned sat
[2024-05-27 22:53:18] [INFO ] After 98ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-27 22:53:18] [INFO ] Flatten gal took : 38 ms
[2024-05-27 22:53:18] [INFO ] Flatten gal took : 12 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 22:53:18] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 30 ms.
[2024-05-27 22:53:18] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Support contains 30 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 37 transition count 16
Applied a total of 3 rules in 14 ms. Remains 37 /40 variables (removed 3) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 37 cols
[2024-05-27 22:53:18] [INFO ] Computed 21 invariants in 15 ms
[2024-05-27 22:53:18] [INFO ] Implicit Places using invariants in 102 ms returned [7, 17, 20, 27]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 108 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 33/40 places, 16/16 transitions.
Support contains 30 out of 33 places after structural reductions.
[2024-05-27 22:53:19] [INFO ] Flatten gal took : 8 ms
[2024-05-27 22:53:19] [INFO ] Flatten gal took : 8 ms
[2024-05-27 22:53:19] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10010 steps, including 29 resets, run finished after 24 ms. (steps per millisecond=417 ) properties (out of 29) seen :28
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 33 cols
[2024-05-27 22:53:19] [INFO ] Computed 17 invariants in 6 ms
[2024-05-27 22:53:19] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 22:53:19] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 14 ms returned sat
[2024-05-27 22:53:19] [INFO ] After 58ms 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.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 33 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33 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' '!(X(G((!p0 U (p1 U (p1&&G(p2)))))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 16
Applied a total of 6 rules in 5 ms. Remains 27 /33 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2024-05-27 22:53:19] [INFO ] Computed 11 invariants in 1 ms
[2024-05-27 22:53:19] [INFO ] Implicit Places using invariants in 72 ms returned [4, 5, 6, 11, 13, 14, 19, 20, 22]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 74 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/33 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 80 ms. Remains : 18/33 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 663 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=1 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 3}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 2}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ 1 s9), p0:(AND (GT 1 s9) (LEQ s11 s8)), p2:(LEQ s17 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-COL-20-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLCardinality-00 finished in 824 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||G(F(p1))||G(p2)))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 16
Applied a total of 6 rules in 1 ms. Remains 27 /33 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2024-05-27 22:53:20] [INFO ] Computed 11 invariants in 3 ms
[2024-05-27 22:53:20] [INFO ] Implicit Places using invariants in 118 ms returned [4, 5, 6, 11, 12, 13, 14, 19, 22]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 124 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/33 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 126 ms. Remains : 18/33 places, 16/16 transitions.
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-20-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT 3 s17), p1:(AND (LEQ s16 s6) (LEQ s7 s12)), p2:(GT s16 s6)], 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 33333 reset in 492 ms.
Product exploration explored 100000 steps with 33333 reset in 282 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 p1 (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 123 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-20-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-20-LTLCardinality-01 finished in 1445 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 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Graph (complete) has 70 edges and 33 vertex of which 29 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 11 ms. Remains 27 /33 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2024-05-27 22:53:21] [INFO ] Computed 11 invariants in 2 ms
[2024-05-27 22:53:22] [INFO ] Implicit Places using invariants in 102 ms returned [4, 5, 6, 11, 12, 13, 14, 19, 20, 22]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 106 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/33 places, 16/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 16 transition count 2
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 3 transition count 1
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 28 place count 2 transition count 1
Applied a total of 28 rules in 29 ms. Remains 2 /17 variables (removed 15) and now considering 1/16 (removed 15) transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-05-27 22:53:22] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 22:53:22] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-27 22:53:22] [INFO ] Invariant cache hit.
[2024-05-27 22:53:22] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/33 places, 1/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 2/33 places, 1/16 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-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:(LEQ 2 s1)], 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 4761 reset in 253 ms.
Product exploration explored 100000 steps with 4761 reset in 197 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
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 p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 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)]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 138 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-27 22:53:23] [INFO ] Invariant cache hit.
[2024-05-27 22:53:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 22:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:53:23] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-27 22:53:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-27 22:53:23] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-27 22:53:23] [INFO ] Invariant cache hit.
[2024-05-27 22:53:23] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-27 22:53:23] [INFO ] Invariant cache hit.
[2024-05-27 22:53:23] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-27 22:53:23] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 22:53:23] [INFO ] Invariant cache hit.
[2024-05-27 22:53:23] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 2/2 places, 1/1 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
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 p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 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 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 123 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-05-27 22:53:23] [INFO ] Invariant cache hit.
[2024-05-27 22:53:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 22:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:53:23] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-27 22:53:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-27 22:53:23] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4761 reset in 77 ms.
Product exploration explored 100000 steps with 4761 reset in 180 ms.
Built C files in :
/tmp/ltsmin16732772491118302350
[2024-05-27 22:53:23] [INFO ] Computing symmetric may disable matrix : 1 transitions.
[2024-05-27 22:53:23] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:53:23] [INFO ] Computing symmetric may enable matrix : 1 transitions.
[2024-05-27 22:53:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:53:23] [INFO ] Computing Do-Not-Accords matrix : 1 transitions.
[2024-05-27 22:53:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:53:23] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16732772491118302350
Running compilation step : cd /tmp/ltsmin16732772491118302350;'/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 328 ms.
Running link step : cd /tmp/ltsmin16732772491118302350;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin16732772491118302350;'/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/stateBased4517653861371977981.hoa' '--buchi-type=spotba'
LTSmin run took 123 ms.
FORMULA PermAdmissibility-COL-20-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-20-LTLCardinality-02 finished in 2514 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 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Graph (complete) has 70 edges and 33 vertex of which 18 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 2 ms. Remains 16 /33 variables (removed 17) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 16 cols
[2024-05-27 22:53:24] [INFO ] Computed 6 invariants in 1 ms
[2024-05-27 22:53:24] [INFO ] Implicit Places using invariants in 53 ms returned [3, 8, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 55 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/33 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 2 ms. Remains 7 /12 variables (removed 5) and now considering 5/10 (removed 5) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-27 22:53:24] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 22:53:24] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-27 22:53:24] [INFO ] Invariant cache hit.
[2024-05-27 22:53:24] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/33 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 7/33 places, 5/16 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s4 s1)], 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 990 reset in 99 ms.
Product exploration explored 100000 steps with 990 reset in 108 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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 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 49 ms :[(NOT p0)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
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 166 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2024-05-27 22:53:25] [INFO ] Invariant cache hit.
[2024-05-27 22:53:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 22:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:53:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-27 22:53:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:53:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-27 22:53:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 22:53:25] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 22:53:25] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 22:53:25] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-27 22:53:25] [INFO ] Invariant cache hit.
[2024-05-27 22:53:25] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-27 22:53:25] [INFO ] Invariant cache hit.
[2024-05-27 22:53:25] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-27 22:53:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 22:53:25] [INFO ] Invariant cache hit.
[2024-05-27 22:53:25] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 7/7 places, 5/5 transitions.
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 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 49 ms :[(NOT p0)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
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 163 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2024-05-27 22:53:26] [INFO ] Invariant cache hit.
[2024-05-27 22:53:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 22:53:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:53:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-27 22:53:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:53:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 22:53:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 22:53:26] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-27 22:53:26] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 22:53:26] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 990 reset in 76 ms.
Product exploration explored 100000 steps with 990 reset in 100 ms.
Built C files in :
/tmp/ltsmin10828974636763575711
[2024-05-27 22:53:26] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-27 22:53:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:53:26] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-27 22:53:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:53:26] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-27 22:53:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:53:26] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10828974636763575711
Running compilation step : cd /tmp/ltsmin10828974636763575711;'/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 132 ms.
Running link step : cd /tmp/ltsmin10828974636763575711;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10828974636763575711;'/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/stateBased56649819483585858.hoa' '--buchi-type=spotba'
LTSmin run took 1367 ms.
FORMULA PermAdmissibility-COL-20-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-20-LTLCardinality-03 finished in 3533 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(p0)||X(p1)))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 16
Applied a total of 6 rules in 1 ms. Remains 27 /33 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2024-05-27 22:53:27] [INFO ] Computed 11 invariants in 0 ms
[2024-05-27 22:53:28] [INFO ] Implicit Places using invariants in 60 ms returned [4, 5, 6, 11, 12, 13, 14, 20, 22]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 61 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/33 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 63 ms. Remains : 18/33 places, 16/16 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 1 s15), p0:(LEQ s12 s17)], 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]]
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLCardinality-04 finished in 238 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((p0||X(X(F((p1&&X(X(p2)))))))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 16
Applied a total of 6 rules in 2 ms. Remains 27 /33 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2024-05-27 22:53:28] [INFO ] Computed 11 invariants in 1 ms
[2024-05-27 22:53:28] [INFO ] Implicit Places using invariants in 59 ms returned [4, 5, 12, 13, 14, 19, 20, 22]
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 : 19/33 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 63 ms. Remains : 19/33 places, 16/16 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-20-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={0} source=1 dest: 3}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={0} source=6 dest: 1}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=2, aps=[p0:(LEQ s9 s6), p1:(LEQ 1 s6), p2:(GT s18 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 320 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLCardinality-05 finished in 438 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)&&F(G(p1)))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Graph (complete) has 70 edges and 33 vertex of which 25 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 3 ms. Remains 23 /33 variables (removed 10) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 23 cols
[2024-05-27 22:53:28] [INFO ] Computed 9 invariants in 1 ms
[2024-05-27 22:53:28] [INFO ] Implicit Places using invariants in 88 ms returned [4, 5, 6, 12, 13, 14, 19]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 90 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/33 places, 14/16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 16 transition count 6
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 7 transition count 5
Applied a total of 18 rules in 4 ms. Remains 7 /16 variables (removed 9) and now considering 5/14 (removed 9) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-27 22:53:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 22:53:28] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-27 22:53:28] [INFO ] Invariant cache hit.
[2024-05-27 22:53:28] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/33 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 7/33 places, 5/16 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s4), p1:(GT s6 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 990 reset in 132 ms.
Product exploration explored 100000 steps with 991 reset in 149 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 : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 217 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=85 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 274 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 52 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
[2024-05-27 22:53:30] [INFO ] Invariant cache hit.
[2024-05-27 22:53:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 22:53:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:53:30] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-27 22:53:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:53:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-27 22:53:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 22:53:30] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-27 22:53:30] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 22:53:30] [INFO ] Added : 4 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 7 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 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-27 22:53:30] [INFO ] Invariant cache hit.
[2024-05-27 22:53:30] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-27 22:53:30] [INFO ] Invariant cache hit.
[2024-05-27 22:53:30] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-27 22:53:30] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 22:53:30] [INFO ] Invariant cache hit.
[2024-05-27 22:53:30] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 7/7 places, 5/5 transitions.
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 p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 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 51 ms :[(NOT p1)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=85 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 173 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 51 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
[2024-05-27 22:53:30] [INFO ] Invariant cache hit.
[2024-05-27 22:53:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 22:53:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:53:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-27 22:53:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:53:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-27 22:53:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 22:53:30] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-27 22:53:30] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 22:53:30] [INFO ] Added : 4 causal constraints over 1 iterations in 18 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 54 ms :[(NOT p1)]
Product exploration explored 100000 steps with 990 reset in 135 ms.
Product exploration explored 100000 steps with 990 reset in 164 ms.
Built C files in :
/tmp/ltsmin9437639538071919424
[2024-05-27 22:53:31] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-27 22:53:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:53:31] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-27 22:53:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:53:31] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-27 22:53:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:53:31] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9437639538071919424
Running compilation step : cd /tmp/ltsmin9437639538071919424;'/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 125 ms.
Running link step : cd /tmp/ltsmin9437639538071919424;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9437639538071919424;'/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/stateBased265600675813977538.hoa' '--buchi-type=spotba'
LTSmin run took 408 ms.
FORMULA PermAdmissibility-COL-20-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-20-LTLCardinality-06 finished in 3195 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||X(G((p1 U p2)))))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 16
Applied a total of 6 rules in 2 ms. Remains 27 /33 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2024-05-27 22:53:31] [INFO ] Computed 11 invariants in 1 ms
[2024-05-27 22:53:31] [INFO ] Implicit Places using invariants in 107 ms returned [4, 5, 6, 12, 13, 14, 19, 20, 22]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 109 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/33 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 113 ms. Remains : 18/33 places, 16/16 transitions.
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 3 s14), p2:(AND (GT 3 s17) (GT s4 s15)), p1:(GT s4 s15)], 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]]
Entered a terminal (fully accepting) state of product in 289 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLCardinality-08 finished in 391 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(p0))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Graph (complete) has 70 edges and 33 vertex of which 30 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 5 ms. Remains 28 /33 variables (removed 5) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 28 cols
[2024-05-27 22:53:32] [INFO ] Computed 12 invariants in 1 ms
[2024-05-27 22:53:32] [INFO ] Implicit Places using invariants in 101 ms returned [4, 5, 11, 12, 13, 14, 19, 20, 22]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 103 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/33 places, 16/16 transitions.
Graph (complete) has 20 edges and 19 vertex of which 18 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 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 4 place count 17 transition count 11
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 12 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 12 transition count 7
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 15 place count 10 transition count 7
Applied a total of 15 rules in 6 ms. Remains 10 /19 variables (removed 9) and now considering 7/16 (removed 9) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-05-27 22:53:32] [INFO ] Computed 3 invariants in 0 ms
[2024-05-27 22:53:32] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-27 22:53:32] [INFO ] Invariant cache hit.
[2024-05-27 22:53:32] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/33 places, 7/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 10/33 places, 7/16 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NOT (AND (NOT (OR (LEQ 2 s8) (LEQ s3 s1))) (LEQ 3 s9))) (LEQ 3 s9) (LEQ s3 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1941 reset in 180 ms.
Product exploration explored 100000 steps with 1921 reset in 228 ms.
Computed a total of 10 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 7
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 135 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 51 ms :[(NOT p0)]
Finished random walk after 147 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=147 )
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 201 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 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2024-05-27 22:53:33] [INFO ] Invariant cache hit.
[2024-05-27 22:53:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 22:53:33] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 22:53:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:53:33] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-27 22:53:33] [INFO ] Computed and/alt/rep : 6/8/6 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 22:53:33] [INFO ] Added : 6 causal constraints over 2 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 10 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 : 10/10 places, 7/7 transitions.
Graph (complete) has 11 edges and 10 vertex of which 9 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 8 transition count 6
Applied a total of 3 rules in 2 ms. Remains 8 /10 variables (removed 2) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-27 22:53:33] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 22:53:33] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-27 22:53:33] [INFO ] Invariant cache hit.
[2024-05-27 22:53:33] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-27 22:53:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 22:53:33] [INFO ] Invariant cache hit.
[2024-05-27 22:53:33] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/10 places, 6/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 8/10 places, 6/7 transitions.
Treatment of property PermAdmissibility-COL-20-LTLCardinality-11 finished in 1448 ms.
Application raised an uncaught exception Index 8 out of bounds for length 8
java.lang.IndexOutOfBoundsException: Index 8 out of bounds for length 8
at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64)
at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70)
at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:266)
at java.base/java.util.Objects.checkIndex(Objects.java:359)
at java.base/java.util.ArrayList.get(ArrayList.java:427)
at fr.lip6.move.gal.structural.SparsePetriNet.simplifyConstants(SparsePetriNet.java:249)
at fr.lip6.move.gal.structural.SparsePetriNet.simplifyConstants(SparsePetriNet.java:223)
at fr.lip6.move.gal.structural.SparsePetriNet.simplifyConstants(SparsePetriNet.java:234)
at fr.lip6.move.gal.structural.SparsePetriNet.simplifyConstants(SparsePetriNet.java:222)
at fr.lip6.move.gal.structural.SparsePetriNet.simplifyConstants(SparsePetriNet.java:234)
at fr.lip6.move.gal.structural.SparsePetriNet.simplifyConstants(SparsePetriNet.java:222)
at fr.lip6.move.gal.structural.SparsePetriNet.simplifyConstants(SparsePetriNet.java:234)
at fr.lip6.move.gal.structural.SparsePetriNet.readFrom(SparsePetriNet.java:496)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.reduceForProperty(LTLPropertySolver.java:495)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:257)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Total runtime 17410 ms.

BK_STOP 1716850415155

--------------------
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-20"
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-20, 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-171654421900087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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