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.r231-tall-167856415700187.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 lolaxred
Input is JoinFreeModules-PT-0100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856415700187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 304K Mar 5 18:22 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 JoinFreeModules-PT-0100-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679436416653

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 22:06:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 22:06:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:06:58] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-21 22:06:58] [INFO ] Transformed 501 places.
[2023-03-21 22:06:58] [INFO ] Transformed 801 transitions.
[2023-03-21 22:06:58] [INFO ] Parsed PT model containing 501 places and 801 transitions and 2302 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 42 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 500 cols
[2023-03-21 22:06:58] [INFO ] Computed 100 place invariants in 26 ms
[2023-03-21 22:06:59] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
[2023-03-21 22:06:59] [INFO ] Invariant cache hit.
[2023-03-21 22:06:59] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-21 22:06:59] [INFO ] Invariant cache hit.
[2023-03-21 22:06:59] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:06:59] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-03-21 22:06:59] [INFO ] Invariant cache hit.
[2023-03-21 22:06:59] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1266 ms. Remains : 500/500 places, 801/801 transitions.
Support contains 44 out of 500 places after structural reductions.
[2023-03-21 22:07:00] [INFO ] Flatten gal took : 71 ms
[2023-03-21 22:07:00] [INFO ] Flatten gal took : 34 ms
[2023-03-21 22:07:00] [INFO ] Input system was already deterministic with 801 transitions.
Support contains 43 out of 500 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10097 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 28) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 22:07:01] [INFO ] Invariant cache hit.
[2023-03-21 22:07:01] [INFO ] [Real]Absence check using 100 positive place invariants in 16 ms returned sat
[2023-03-21 22:07:01] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:07:01] [INFO ] [Nat]Absence check using 100 positive place invariants in 13 ms returned sat
[2023-03-21 22:07:02] [INFO ] After 667ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:07:02] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:02] [INFO ] After 321ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:07:02] [INFO ] After 631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 582 ms.
[2023-03-21 22:07:03] [INFO ] After 2015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 474 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=67 )
Parikh walk visited 4 properties in 402 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(X(p1))&&F(p2))||p0))))'
Support contains 5 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 47 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:04] [INFO ] Invariant cache hit.
[2023-03-21 22:07:04] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
[2023-03-21 22:07:04] [INFO ] Invariant cache hit.
[2023-03-21 22:07:04] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-21 22:07:04] [INFO ] Invariant cache hit.
[2023-03-21 22:07:04] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:04] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-21 22:07:04] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-21 22:07:04] [INFO ] Invariant cache hit.
[2023-03-21 22:07:05] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1025 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s3 s422) (LEQ 1 s77)), p2:(LEQ s3 s422), p1:(LEQ s410 s111)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 4763 ms.
Product exploration explored 100000 steps with 1 reset in 4995 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 p2 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 262 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter insensitive) to 5 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 275 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10021 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 136931 steps, run timeout after 3002 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136931 steps, saw 135875 distinct states, run finished after 3003 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-21 22:07:19] [INFO ] Invariant cache hit.
[2023-03-21 22:07:19] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:07:19] [INFO ] [Nat]Absence check using 100 positive place invariants in 14 ms returned sat
[2023-03-21 22:07:20] [INFO ] After 919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:07:20] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:20] [INFO ] After 315ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:07:20] [INFO ] After 750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 247 ms.
[2023-03-21 22:07:21] [INFO ] After 2055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 3976 steps, including 0 resets, run visited all 4 properties in 118 ms. (steps per millisecond=33 )
Parikh walk visited 4 properties in 118 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 6 factoid took 326 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter insensitive) to 5 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 72 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:22] [INFO ] Invariant cache hit.
[2023-03-21 22:07:22] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
[2023-03-21 22:07:22] [INFO ] Invariant cache hit.
[2023-03-21 22:07:22] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-21 22:07:22] [INFO ] Invariant cache hit.
[2023-03-21 22:07:23] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:23] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-21 22:07:23] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-21 22:07:23] [INFO ] Invariant cache hit.
[2023-03-21 22:07:23] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1233 ms. Remains : 500/500 places, 801/801 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 p0 p2 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (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) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 297 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter insensitive) to 5 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 298 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10032 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 147717 steps, run timeout after 3003 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147717 steps, saw 146568 distinct states, run finished after 3003 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-21 22:07:27] [INFO ] Invariant cache hit.
[2023-03-21 22:07:27] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:07:27] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2023-03-21 22:07:28] [INFO ] After 876ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:07:28] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:29] [INFO ] After 300ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:07:29] [INFO ] After 655ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 231 ms.
[2023-03-21 22:07:29] [INFO ] After 1912ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 4164 steps, including 0 resets, run visited all 4 properties in 122 ms. (steps per millisecond=34 )
Parikh walk visited 4 properties in 122 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (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) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 6 factoid took 284 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter insensitive) to 5 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 4287 ms.
Product exploration explored 100000 steps with 1 reset in 4528 ms.
Support contains 5 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 30 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:39] [INFO ] Invariant cache hit.
[2023-03-21 22:07:39] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
[2023-03-21 22:07:39] [INFO ] Invariant cache hit.
[2023-03-21 22:07:39] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-21 22:07:39] [INFO ] Invariant cache hit.
[2023-03-21 22:07:40] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:40] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-21 22:07:40] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-21 22:07:40] [INFO ] Invariant cache hit.
[2023-03-21 22:07:40] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 945 ms. Remains : 500/500 places, 801/801 transitions.
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-00 finished in 36461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 5 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:40] [INFO ] Invariant cache hit.
[2023-03-21 22:07:40] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
[2023-03-21 22:07:40] [INFO ] Invariant cache hit.
[2023-03-21 22:07:40] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-21 22:07:40] [INFO ] Invariant cache hit.
[2023-03-21 22:07:41] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:41] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-21 22:07:41] [INFO ] Invariant cache hit.
[2023-03-21 22:07:41] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1053 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 1 s191), p0:(LEQ 3 s224)], 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 50000 reset in 1317 ms.
Product exploration explored 100000 steps with 50000 reset in 1400 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 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0100-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-01 finished in 4241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 18 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:44] [INFO ] Invariant cache hit.
[2023-03-21 22:07:44] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
[2023-03-21 22:07:44] [INFO ] Invariant cache hit.
[2023-03-21 22:07:45] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-21 22:07:45] [INFO ] Invariant cache hit.
[2023-03-21 22:07:45] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:45] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-21 22:07:45] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-21 22:07:45] [INFO ] Invariant cache hit.
[2023-03-21 22:07:45] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 876 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-02 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s274), p1:(GT 2 s219)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 31 reset in 3522 ms.
Stack based approach found an accepted trace after 196 steps with 0 reset with depth 197 and stack size 197 in 6 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-02 finished in 4526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 14 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:49] [INFO ] Invariant cache hit.
[2023-03-21 22:07:49] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
[2023-03-21 22:07:49] [INFO ] Invariant cache hit.
[2023-03-21 22:07:49] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-21 22:07:49] [INFO ] Invariant cache hit.
[2023-03-21 22:07:49] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:49] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-21 22:07:49] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-21 22:07:49] [INFO ] Invariant cache hit.
[2023-03-21 22:07:50] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 865 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-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:(GT s241 s208)], 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 3914 ms.
Stack based approach found an accepted trace after 131 steps with 0 reset with depth 132 and stack size 132 in 3 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-03 finished in 4833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:54] [INFO ] Invariant cache hit.
[2023-03-21 22:07:54] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
[2023-03-21 22:07:54] [INFO ] Invariant cache hit.
[2023-03-21 22:07:54] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-21 22:07:54] [INFO ] Invariant cache hit.
[2023-03-21 22:07:54] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:54] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-21 22:07:54] [INFO ] Invariant cache hit.
[2023-03-21 22:07:54] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 890 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 3 s427)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-04 finished in 1027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(!p1)||(!p1&&F(p2)))) U X(!p2)))'
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:55] [INFO ] Invariant cache hit.
[2023-03-21 22:07:55] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
[2023-03-21 22:07:55] [INFO ] Invariant cache hit.
[2023-03-21 22:07:55] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-21 22:07:55] [INFO ] Invariant cache hit.
[2023-03-21 22:07:55] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:55] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-21 22:07:55] [INFO ] Invariant cache hit.
[2023-03-21 22:07:55] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 823 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 275 ms :[p2, p2, p2, (AND p1 p2), true, p1, (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND p2 p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=7 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(OR (LEQ s232 s494) (LEQ 2 s169)), p0:(LEQ 3 s399), p2:(GT 2 s169)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-05 finished in 1127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G((p1||F(p2)||X(p3)))))))'
Support contains 7 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:56] [INFO ] Invariant cache hit.
[2023-03-21 22:07:56] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
[2023-03-21 22:07:56] [INFO ] Invariant cache hit.
[2023-03-21 22:07:56] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-21 22:07:56] [INFO ] Invariant cache hit.
[2023-03-21 22:07:56] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:56] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-21 22:07:56] [INFO ] Invariant cache hit.
[2023-03-21 22:07:57] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 869 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(LEQ s291 s15), p1:(LEQ s48 s362), p2:(LEQ s251 s282), p3:(LEQ 1 s357)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1244 ms.
Product exploration explored 100000 steps with 50000 reset in 1341 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 p2 p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 11 factoid took 179 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0100-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-06 finished in 4072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:00] [INFO ] Invariant cache hit.
[2023-03-21 22:08:00] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
[2023-03-21 22:08:00] [INFO ] Invariant cache hit.
[2023-03-21 22:08:00] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-21 22:08:00] [INFO ] Invariant cache hit.
[2023-03-21 22:08:00] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:00] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-21 22:08:00] [INFO ] Invariant cache hit.
[2023-03-21 22:08:01] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 824 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ 1 s226), p0:(LEQ 2 s284)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3971 ms.
Entered a terminal (fully accepting) state of product in 353 steps with 0 reset in 8 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-08 finished in 4936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 19 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:05] [INFO ] Invariant cache hit.
[2023-03-21 22:08:05] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
[2023-03-21 22:08:05] [INFO ] Invariant cache hit.
[2023-03-21 22:08:05] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-21 22:08:05] [INFO ] Invariant cache hit.
[2023-03-21 22:08:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:05] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-21 22:08:05] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-21 22:08:05] [INFO ] Invariant cache hit.
[2023-03-21 22:08:06] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 861 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-10 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 s208 s460)], 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 3984 ms.
Stack based approach found an accepted trace after 4037 steps with 0 reset with depth 4038 and stack size 4037 in 149 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-10 finished in 5044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U !X((p0 U p1))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:10] [INFO ] Invariant cache hit.
[2023-03-21 22:08:10] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
[2023-03-21 22:08:10] [INFO ] Invariant cache hit.
[2023-03-21 22:08:10] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-21 22:08:10] [INFO ] Invariant cache hit.
[2023-03-21 22:08:10] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:10] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-21 22:08:10] [INFO ] Invariant cache hit.
[2023-03-21 22:08:11] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 812 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 129 ms :[p1, p1, p1, true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s469 s390), p1:(LEQ 2 s129)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 255 reset in 2234 ms.
Product exploration explored 100000 steps with 269 reset in 2354 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 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 384 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[p1, p1, true, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10052 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=193 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :1
Finished Best-First random walk after 603 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=150 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 8 factoid took 465 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[p1, p1, true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[p1, p1, true, (AND (NOT p0) (NOT p1))]
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 10 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:17] [INFO ] Invariant cache hit.
[2023-03-21 22:08:17] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
[2023-03-21 22:08:17] [INFO ] Invariant cache hit.
[2023-03-21 22:08:17] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-21 22:08:17] [INFO ] Invariant cache hit.
[2023-03-21 22:08:17] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:17] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-21 22:08:17] [INFO ] Invariant cache hit.
[2023-03-21 22:08:18] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 818 ms. Remains : 500/500 places, 801/801 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 p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[p1, p1, true, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10035 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :1
Finished Best-First random walk after 1005 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=201 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 366 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[p1, p1, true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[p1, p1, true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[p1, p1, true, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 279 reset in 2187 ms.
Entered a terminal (fully accepting) state of product in 44385 steps with 114 reset in 1064 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-11 finished in 12598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:22] [INFO ] Invariant cache hit.
[2023-03-21 22:08:23] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
[2023-03-21 22:08:23] [INFO ] Invariant cache hit.
[2023-03-21 22:08:23] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-21 22:08:23] [INFO ] Invariant cache hit.
[2023-03-21 22:08:23] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:23] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-21 22:08:23] [INFO ] Invariant cache hit.
[2023-03-21 22:08:23] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 821 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT s263 s45)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-13 finished in 971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p1&&F(p0)))))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:23] [INFO ] Invariant cache hit.
[2023-03-21 22:08:24] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
[2023-03-21 22:08:24] [INFO ] Invariant cache hit.
[2023-03-21 22:08:24] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-21 22:08:24] [INFO ] Invariant cache hit.
[2023-03-21 22:08:24] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:24] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-21 22:08:24] [INFO ] Invariant cache hit.
[2023-03-21 22:08:24] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 820 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s394 s66), p0:(GT 1 s398)], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 6604 reset in 3062 ms.
Stack based approach found an accepted trace after 2498 steps with 449 reset with depth 1601 and stack size 1601 in 60 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-14 finished in 4089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 8 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 20 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:27] [INFO ] Invariant cache hit.
[2023-03-21 22:08:28] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
[2023-03-21 22:08:28] [INFO ] Invariant cache hit.
[2023-03-21 22:08:28] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-21 22:08:28] [INFO ] Invariant cache hit.
[2023-03-21 22:08:28] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:28] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-21 22:08:28] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 22:08:28] [INFO ] Invariant cache hit.
[2023-03-21 22:08:28] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 837 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-15 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:(OR (LEQ s111 s467) (GT s97 s70)), p1:(AND (LEQ s422 s244) (LEQ s202 s205))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-15 finished in 951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(X(p1))&&F(p2))||p0))))'
[2023-03-21 22:08:28] [INFO ] Flatten gal took : 32 ms
[2023-03-21 22:08:29] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-21 22:08:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 500 places, 801 transitions and 2300 arcs took 7 ms.
Total runtime 90782 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT JoinFreeModules-PT-0100
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1679436540245

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 JoinFreeModules-PT-0100-LTLCardinality-00
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 6/32 JoinFreeModules-PT-0100-LTLCardinality-00 893602 m, 178720 m/sec, 1342981 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 12/32 JoinFreeModules-PT-0100-LTLCardinality-00 1780774 m, 177434 m/sec, 2676268 t fired, .

Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 18/32 JoinFreeModules-PT-0100-LTLCardinality-00 2658408 m, 175526 m/sec, 3995283 t fired, .

Time elapsed: 15 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 24/32 JoinFreeModules-PT-0100-LTLCardinality-00 3537951 m, 175908 m/sec, 5317340 t fired, .

Time elapsed: 20 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 29/32 JoinFreeModules-PT-0100-LTLCardinality-00 4411383 m, 174686 m/sec, 6630003 t fired, .

Time elapsed: 25 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for JoinFreeModules-PT-0100-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
JoinFreeModules-PT-0100-LTLCardinality-00: LTL unknown AGGR


Time elapsed: 30 secs. Pages in use: 32

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="JoinFreeModules-PT-0100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is JoinFreeModules-PT-0100, 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 r231-tall-167856415700187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0100.tgz
mv JoinFreeModules-PT-0100 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 ;