Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.9K Mar 23 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 23 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 7 12:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 7 12:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 7 12:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 12:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Mar 23 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 23 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 23 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 11K Mar 31 16:48 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 PGCD-COL-D02N006-LTLCardinality-00
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-01
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-02
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-03
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-04
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-05
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-06
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-07
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-08
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-09
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-10
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-11
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-12
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-13
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-14
FORMULA_NAME PGCD-COL-D02N006-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680940360035

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-COL-D02N006
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-08 07:52:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-08 07:52:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:52:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-08 07:52:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-08 07:52:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 674 ms
[2023-04-08 07:52:42] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 9 PT places and 9.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-04-08 07:52:42] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 4 ms.
[2023-04-08 07:52:42] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PGCD-COL-D02N006-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10006 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 3 rows 3 cols
[2023-04-08 07:52:43] [INFO ] Computed 2 invariants in 4 ms
[2023-04-08 07:52:43] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-08 07:52:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-04-08 07:52:43] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
FORMULA PGCD-COL-D02N006-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-08 07:52:43] [INFO ] Flatten gal took : 13 ms
[2023-04-08 07:52:43] [INFO ] Flatten gal took : 1 ms
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2023-04-08 07:52:43] [INFO ] Unfolded HLPN to a Petri net with 9 places and 9 transitions 42 arcs in 5 ms.
[2023-04-08 07:52:43] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 6 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-08 07:52:43] [INFO ] Computed 4 invariants in 1 ms
[2023-04-08 07:52:43] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-04-08 07:52:43] [INFO ] Invariant cache hit.
[2023-04-08 07:52:43] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:52:43] [INFO ] Invariant cache hit.
[2023-04-08 07:52:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:52:43] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-08 07:52:43] [INFO ] Invariant cache hit.
[2023-04-08 07:52:43] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 9/9 places, 9/9 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-04-08 07:52:43] [INFO ] Flatten gal took : 2 ms
[2023-04-08 07:52:43] [INFO ] Flatten gal took : 2 ms
[2023-04-08 07:52:43] [INFO ] Input system was already deterministic with 9 transitions.
Incomplete random walk after 10011 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-08 07:52:43] [INFO ] Invariant cache hit.
[2023-04-08 07:52:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:52:43] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:52:43] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-08 07:52:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:52:43] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:52:43] [INFO ] After 123ms 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.
FORMULA PGCD-COL-D02N006-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 6 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
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))||(X(!p0) U (X(G(!p0))||(p1&&X(!p0))))))'
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:52:43] [INFO ] Invariant cache hit.
[2023-04-08 07:52:43] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:52:43] [INFO ] Invariant cache hit.
[2023-04-08 07:52:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-08 07:52:44] [INFO ] Invariant cache hit.
[2023-04-08 07:52:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:52:44] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-08 07:52:44] [INFO ] Invariant cache hit.
[2023-04-08 07:52:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 9/9 places, 9/9 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 241 ms :[false, false, (NOT p0)]
Running random walk in product with property : PGCD-COL-D02N006-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(GT (ADD s3 s4 s5) (ADD s6 s7 s8)), p0:(LEQ (ADD s6 s7 s8) (ADD s3 s4 s5))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 300 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 48 in 0 ms.
FORMULA PGCD-COL-D02N006-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N006-LTLCardinality-04 finished in 726 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&&X(p1))))'
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:52:44] [INFO ] Invariant cache hit.
[2023-04-08 07:52:44] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-04-08 07:52:44] [INFO ] Invariant cache hit.
[2023-04-08 07:52:44] [INFO ] Implicit Places using invariants in 33 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 6/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PGCD-COL-D02N006-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s3 s4 s5) (ADD s0 s1 s2)), p1:(GT 1 (ADD s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 258 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA PGCD-COL-D02N006-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N006-LTLCardinality-07 finished in 426 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(F(p0))||G((p1||X(F(p2)))))))'
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:52:45] [INFO ] Invariant cache hit.
[2023-04-08 07:52:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-04-08 07:52:45] [INFO ] Invariant cache hit.
[2023-04-08 07:52:45] [INFO ] Implicit Places using invariants in 25 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 6/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PGCD-COL-D02N006-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 (ADD s0 s1 s2)), p0:(GT (ADD s3 s4 s5) (ADD s0 s1 s2)), p2:(LEQ 2 (ADD s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 123 ms.
Product exploration explored 100000 steps with 1 reset in 211 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 129 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:52:46] [INFO ] Computed 1 invariants in 1 ms
[2023-04-08 07:52:46] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-04-08 07:52:46] [INFO ] After 21ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p1)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 10 factoid took 262 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:52:46] [INFO ] Invariant cache hit.
[2023-04-08 07:52:46] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-04-08 07:52:46] [INFO ] Invariant cache hit.
[2023-04-08 07:52:46] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:52:46] [INFO ] Invariant cache hit.
[2023-04-08 07:52:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:52:46] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-08 07:52:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:52:46] [INFO ] Invariant cache hit.
[2023-04-08 07:52:46] [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 111 ms. Remains : 6/6 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 113 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:52:46] [INFO ] Invariant cache hit.
[2023-04-08 07:52:46] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-04-08 07:52:46] [INFO ] After 23ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p1)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 267 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 114 ms.
Product exploration explored 100000 steps with 1 reset in 117 ms.
Support contains 6 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:52:47] [INFO ] Invariant cache hit.
[2023-04-08 07:52:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-04-08 07:52:47] [INFO ] Invariant cache hit.
[2023-04-08 07:52:47] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-08 07:52:47] [INFO ] Invariant cache hit.
[2023-04-08 07:52:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:52:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-04-08 07:52:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:52:47] [INFO ] Invariant cache hit.
[2023-04-08 07:52:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 6/6 places, 9/9 transitions.
Treatment of property PGCD-COL-D02N006-LTLCardinality-09 finished in 2883 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 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-08 07:52:47] [INFO ] Computed 4 invariants in 1 ms
[2023-04-08 07:52:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 07:52:47] [INFO ] Invariant cache hit.
[2023-04-08 07:52:47] [INFO ] Implicit Places using invariants in 23 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57 ms. Remains : 6/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : PGCD-COL-D02N006-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:(LEQ 3 (ADD s3 s4 s5))], 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 0 reset in 85 ms.
Stack based approach found an accepted trace after 382 steps with 0 reset with depth 383 and stack size 314 in 0 ms.
FORMULA PGCD-COL-D02N006-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N006-LTLCardinality-12 finished in 183 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 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:52:48] [INFO ] Invariant cache hit.
[2023-04-08 07:52:48] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-04-08 07:52:48] [INFO ] Invariant cache hit.
[2023-04-08 07:52:48] [INFO ] Implicit Places using invariants in 25 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 6/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, p0, p0]
Running random walk in product with property : PGCD-COL-D02N006-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 (ADD s3 s4 s5))], 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 94 steps with 0 reset in 1 ms.
FORMULA PGCD-COL-D02N006-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PGCD-COL-D02N006-LTLCardinality-14 finished in 156 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)||X(G(p1))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:52:48] [INFO ] Invariant cache hit.
[2023-04-08 07:52:48] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 07:52:48] [INFO ] Invariant cache hit.
[2023-04-08 07:52:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-08 07:52:48] [INFO ] Invariant cache hit.
[2023-04-08 07:52:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:52:48] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-08 07:52:48] [INFO ] Invariant cache hit.
[2023-04-08 07:52:48] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 91 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : PGCD-COL-D02N006-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s6 s7 s8) (ADD s3 s4 s5)), p1:(LEQ (ADD s0 s1 s2) (ADD s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2565 reset in 166 ms.
Product exploration explored 100000 steps with 2536 reset in 186 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-08 07:52:49] [INFO ] Invariant cache hit.
[2023-04-08 07:52:49] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-08 07:52:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:52:49] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:52:49] [INFO ] After 27ms 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 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 14 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PGCD-COL-D02N006-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PGCD-COL-D02N006-LTLCardinality-15 finished in 1061 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(F(p0))||G((p1||X(F(p2)))))))'
Found a Lengthening insensitive property : PGCD-COL-D02N006-LTLCardinality-09
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:52:49] [INFO ] Invariant cache hit.
[2023-04-08 07:52:49] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-04-08 07:52:49] [INFO ] Invariant cache hit.
[2023-04-08 07:52:49] [INFO ] Implicit Places using invariants in 19 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 20 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 46 ms. Remains : 6/9 places, 9/9 transitions.
Running random walk in product with property : PGCD-COL-D02N006-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 (ADD s0 s1 s2)), p0:(GT (ADD s3 s4 s5) (ADD s0 s1 s2)), p2:(LEQ 2 (ADD s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 112 ms.
Product exploration explored 100000 steps with 4 reset in 119 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 115 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 9 rows 6 cols
[2023-04-08 07:52:50] [INFO ] Computed 1 invariants in 1 ms
[2023-04-08 07:52:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:52:50] [INFO ] After 16ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p1)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 10 factoid took 254 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:52:50] [INFO ] Invariant cache hit.
[2023-04-08 07:52:50] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-04-08 07:52:50] [INFO ] Invariant cache hit.
[2023-04-08 07:52:50] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-08 07:52:50] [INFO ] Invariant cache hit.
[2023-04-08 07:52:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:52:50] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-04-08 07:52:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:52:50] [INFO ] Invariant cache hit.
[2023-04-08 07:52:50] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 6/6 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:52:51] [INFO ] Invariant cache hit.
[2023-04-08 07:52:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:52:51] [INFO ] After 25ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p1)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 263 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3 reset in 103 ms.
Product exploration explored 100000 steps with 2 reset in 129 ms.
Support contains 6 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:52:52] [INFO ] Invariant cache hit.
[2023-04-08 07:52:52] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-04-08 07:52:52] [INFO ] Invariant cache hit.
[2023-04-08 07:52:52] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-08 07:52:52] [INFO ] Invariant cache hit.
[2023-04-08 07:52:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:52:52] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-04-08 07:52:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:52:52] [INFO ] Invariant cache hit.
[2023-04-08 07:52:52] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 6/6 places, 9/9 transitions.
Treatment of property PGCD-COL-D02N006-LTLCardinality-09 finished in 2768 ms.
[2023-04-08 07:52:52] [INFO ] Flatten gal took : 2 ms
[2023-04-08 07:52:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-04-08 07:52:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 9 transitions and 42 arcs took 0 ms.
Total runtime 10659 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1039/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PGCD-COL-D02N006-LTLCardinality-09

BK_STOP 1680940373453

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name PGCD-COL-D02N006-LTLCardinality-09
ltl formula formula --ltl=/tmp/1039/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 9 places, 9 transitions and 42 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1039/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1039/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1039/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1039/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x563de13e13f4]
1: pnml2lts-mc(+0xa2496) [0x563de13e1496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f3016f4b140]
3: pnml2lts-mc(+0x405b30) [0x563de1744b30]
4: pnml2lts-mc(+0x164ad3) [0x563de14a3ad3]
5: pnml2lts-mc(+0x272e0a) [0x563de15b1e0a]
6: pnml2lts-mc(+0xb61f0) [0x563de13f51f0]
7: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f3016d9e4d7]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f3016d9e67a]
9: pnml2lts-mc(+0xa1581) [0x563de13e0581]
10: pnml2lts-mc(+0xa1910) [0x563de13e0910]
11: pnml2lts-mc(+0xa32a2) [0x563de13e22a2]
12: pnml2lts-mc(+0xa50f4) [0x563de13e40f4]
13: pnml2lts-mc(+0xa516b) [0x563de13e416b]
14: pnml2lts-mc(+0x3f34b3) [0x563de17324b3]
15: pnml2lts-mc(+0x7c63d) [0x563de13bb63d]
16: pnml2lts-mc(+0x67d86) [0x563de13a6d86]
17: pnml2lts-mc(+0x60a8a) [0x563de139fa8a]
18: pnml2lts-mc(+0x5eb15) [0x563de139db15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f3016d86d0a]
20: pnml2lts-mc(+0x6075e) [0x563de139f75e]

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="PGCD-COL-D02N006"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is PGCD-COL-D02N006, 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 r521-tall-167987246600387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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