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.r103-tall-167814478300427.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 DES-PT-20a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478300427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 57K 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 DES-PT-20a-LTLCardinality-00
FORMULA_NAME DES-PT-20a-LTLCardinality-01
FORMULA_NAME DES-PT-20a-LTLCardinality-02
FORMULA_NAME DES-PT-20a-LTLCardinality-03
FORMULA_NAME DES-PT-20a-LTLCardinality-04
FORMULA_NAME DES-PT-20a-LTLCardinality-05
FORMULA_NAME DES-PT-20a-LTLCardinality-06
FORMULA_NAME DES-PT-20a-LTLCardinality-07
FORMULA_NAME DES-PT-20a-LTLCardinality-08
FORMULA_NAME DES-PT-20a-LTLCardinality-09
FORMULA_NAME DES-PT-20a-LTLCardinality-10
FORMULA_NAME DES-PT-20a-LTLCardinality-11
FORMULA_NAME DES-PT-20a-LTLCardinality-12
FORMULA_NAME DES-PT-20a-LTLCardinality-13
FORMULA_NAME DES-PT-20a-LTLCardinality-14
FORMULA_NAME DES-PT-20a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678251536935

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=DES-PT-20a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 04:58:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 04:58:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:58:58] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-08 04:58:58] [INFO ] Transformed 195 places.
[2023-03-08 04:58:58] [INFO ] Transformed 152 transitions.
[2023-03-08 04:58:58] [INFO ] Found NUPN structural information;
[2023-03-08 04:58:58] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 111 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-20a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 37 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2023-03-08 04:58:58] [INFO ] Computed 59 place invariants in 26 ms
[2023-03-08 04:58:59] [INFO ] Implicit Places using invariants in 474 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 498 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 540 ms. Remains : 193/195 places, 137/138 transitions.
Support contains 25 out of 193 places after structural reductions.
[2023-03-08 04:58:59] [INFO ] Flatten gal took : 44 ms
[2023-03-08 04:58:59] [INFO ] Flatten gal took : 17 ms
[2023-03-08 04:58:59] [INFO ] Input system was already deterministic with 137 transitions.
Support contains 23 out of 193 places (down from 25) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 217 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 04:58:59] [INFO ] Computed 58 place invariants in 10 ms
[2023-03-08 04:58:59] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:58:59] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 04:58:59] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:58:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:58:59] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-08 04:59:00] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:59:00] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-08 04:59:00] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 70 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 193 transition count 135
Applied a total of 7 rules in 21 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1048867 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1048867 steps, saw 147817 distinct states, run finished after 3005 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 04:59:03] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 04:59:03] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 04:59:03] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 04:59:03] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 04:59:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 04:59:03] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 56 ms returned sat
[2023-03-08 04:59:03] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 04:59:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:59:03] [INFO ] After 35ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 04:59:03] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2023-03-08 04:59:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-08 04:59:03] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-08 04:59:03] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 40 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 04:59:04] [INFO ] Invariant cache hit.
[2023-03-08 04:59:04] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-08 04:59:04] [INFO ] Invariant cache hit.
[2023-03-08 04:59:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:59:04] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-08 04:59:04] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 04:59:04] [INFO ] Invariant cache hit.
[2023-03-08 04:59:04] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 04:59:04] [INFO ] Invariant cache hit.
[2023-03-08 04:59:04] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 04:59:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 04:59:04] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 04:59:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 04:59:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 58 ms returned sat
[2023-03-08 04:59:04] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 04:59:04] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-08 04:59:04] [INFO ] After 322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA DES-PT-20a-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 96 stabilizing places and 91 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(p0)&&F(p1))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /193 variables (removed 1) and now considering 136/137 (removed 1) transitions.
// Phase 1: matrix 136 rows 192 cols
[2023-03-08 04:59:05] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 04:59:05] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-08 04:59:05] [INFO ] Invariant cache hit.
[2023-03-08 04:59:05] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-08 04:59:05] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 04:59:05] [INFO ] Invariant cache hit.
[2023-03-08 04:59:05] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 413 ms. Remains : 192/193 places, 136/137 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-00 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:(OR (EQ s77 0) (EQ s175 1)), p1:(AND (EQ s175 0) (EQ s77 1))], 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]]
Stuttering criterion allowed to conclude after 215 steps with 3 reset in 9 ms.
FORMULA DES-PT-20a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-00 finished in 763 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 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 04:59:05] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 04:59:05] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-08 04:59:05] [INFO ] Invariant cache hit.
[2023-03-08 04:59:06] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-08 04:59:06] [INFO ] Invariant cache hit.
[2023-03-08 04:59:06] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 369 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-01 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:(AND (EQ s110 0) (EQ s26 1))], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-01 finished in 501 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(!p0)&&G((F(p2)||p1)))||G(!p0)))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 11 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 04:59:06] [INFO ] Invariant cache hit.
[2023-03-08 04:59:06] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-08 04:59:06] [INFO ] Invariant cache hit.
[2023-03-08 04:59:06] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-08 04:59:06] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 04:59:06] [INFO ] Invariant cache hit.
[2023-03-08 04:59:06] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 384 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 236 ms :[p0, p0, (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s157 0) (EQ s115 1)), p2:(OR (EQ s71 0) (EQ s82 1)), p0:(OR (EQ s162 0) (EQ s60 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2227 reset in 330 ms.
Product exploration explored 100000 steps with 2236 reset in 271 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 543 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter insensitive) to 6 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[p0, p0, (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 04:59:08] [INFO ] Invariant cache hit.
[2023-03-08 04:59:08] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 04:59:08] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:59:08] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 51 ms returned sat
[2023-03-08 04:59:09] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 04:59:09] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-08 04:59:09] [INFO ] After 637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 110 ms.
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 193 transition count 135
Applied a total of 7 rules in 12 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 157 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 872668 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :{}
Probabilistic random walk after 872668 steps, saw 124391 distinct states, run finished after 3002 ms. (steps per millisecond=290 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 04:59:12] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 04:59:13] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 04:59:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:59:13] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 46 ms returned sat
[2023-03-08 04:59:13] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 04:59:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:59:13] [INFO ] After 205ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 04:59:13] [INFO ] After 477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-08 04:59:14] [INFO ] After 1088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 104 ms.
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 13 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 04:59:14] [INFO ] Invariant cache hit.
[2023-03-08 04:59:14] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 04:59:14] [INFO ] Invariant cache hit.
[2023-03-08 04:59:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:59:14] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-08 04:59:14] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 04:59:14] [INFO ] Invariant cache hit.
[2023-03-08 04:59:14] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 04:59:14] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 04:59:14] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 04:59:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 04:59:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 46 ms returned sat
[2023-03-08 04:59:15] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 04:59:15] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2023-03-08 04:59:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-08 04:59:15] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2023-03-08 04:59:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-08 04:59:15] [INFO ] After 551ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-08 04:59:15] [INFO ] After 868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 13 factoid took 688 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter insensitive) to 6 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 282 ms :[p0, p0, (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 222 ms :[p0, p0, (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 04:59:16] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 04:59:16] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 04:59:16] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 04:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:59:17] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2023-03-08 04:59:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:59:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:59:17] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 46 ms returned sat
[2023-03-08 04:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:59:17] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2023-03-08 04:59:17] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-08 04:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-08 04:59:17] [INFO ] Computed and/alt/rep : 129/387/129 causal constraints (skipped 7 transitions) in 10 ms.
[2023-03-08 04:59:17] [INFO ] Added : 107 causal constraints over 22 iterations in 381 ms. Result :sat
Could not prove EG p0
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 15 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 04:59:17] [INFO ] Invariant cache hit.
[2023-03-08 04:59:18] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-08 04:59:18] [INFO ] Invariant cache hit.
[2023-03-08 04:59:18] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-08 04:59:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:59:18] [INFO ] Invariant cache hit.
[2023-03-08 04:59:18] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 372 ms. Remains : 193/193 places, 137/137 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 574 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter insensitive) to 6 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[p0, p0, (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 04:59:19] [INFO ] Invariant cache hit.
[2023-03-08 04:59:19] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 04:59:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 04:59:19] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 58 ms returned sat
[2023-03-08 04:59:19] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 04:59:20] [INFO ] After 371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-08 04:59:20] [INFO ] After 638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 134 ms.
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 193 transition count 135
Applied a total of 7 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 154 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 856739 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :{}
Probabilistic random walk after 856739 steps, saw 122051 distinct states, run finished after 3002 ms. (steps per millisecond=285 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 04:59:23] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 04:59:23] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 04:59:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 04:59:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 45 ms returned sat
[2023-03-08 04:59:24] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 04:59:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:59:24] [INFO ] After 192ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 04:59:24] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-08 04:59:24] [INFO ] After 1018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 123 ms.
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 04:59:24] [INFO ] Invariant cache hit.
[2023-03-08 04:59:25] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 04:59:25] [INFO ] Invariant cache hit.
[2023-03-08 04:59:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:59:25] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-08 04:59:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:59:25] [INFO ] Invariant cache hit.
[2023-03-08 04:59:25] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 04:59:25] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 04:59:25] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 04:59:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 04:59:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 45 ms returned sat
[2023-03-08 04:59:25] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 04:59:25] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2023-03-08 04:59:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-08 04:59:26] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2023-03-08 04:59:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-08 04:59:26] [INFO ] After 560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 168 ms.
[2023-03-08 04:59:26] [INFO ] After 855ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 13 factoid took 669 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter insensitive) to 6 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 249 ms :[p0, p0, (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 254 ms :[p0, p0, (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 04:59:27] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 04:59:27] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:59:27] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 04:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:59:27] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2023-03-08 04:59:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:59:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:59:27] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 46 ms returned sat
[2023-03-08 04:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:59:28] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-03-08 04:59:28] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2023-03-08 04:59:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-08 04:59:28] [INFO ] Computed and/alt/rep : 129/387/129 causal constraints (skipped 7 transitions) in 8 ms.
[2023-03-08 04:59:28] [INFO ] Added : 107 causal constraints over 22 iterations in 356 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 232 ms :[p0, p0, (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 2215 reset in 207 ms.
Product exploration explored 100000 steps with 2218 reset in 231 ms.
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 04:59:29] [INFO ] Invariant cache hit.
[2023-03-08 04:59:29] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-08 04:59:29] [INFO ] Invariant cache hit.
[2023-03-08 04:59:29] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-08 04:59:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:59:29] [INFO ] Invariant cache hit.
[2023-03-08 04:59:29] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 369 ms. Remains : 193/193 places, 137/137 transitions.
Treatment of property DES-PT-20a-LTLCardinality-06 finished in 23257 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(p0)&&X(p1)))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 04:59:29] [INFO ] Invariant cache hit.
[2023-03-08 04:59:29] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 04:59:29] [INFO ] Invariant cache hit.
[2023-03-08 04:59:29] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-08 04:59:29] [INFO ] Invariant cache hit.
[2023-03-08 04:59:29] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 376 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DES-PT-20a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s181 0), p1:(AND (EQ s88 0) (EQ s107 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-10 finished in 508 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((X(G(p0))&&G(p1))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 13 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 04:59:30] [INFO ] Invariant cache hit.
[2023-03-08 04:59:30] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-08 04:59:30] [INFO ] Invariant cache hit.
[2023-03-08 04:59:30] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-08 04:59:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:59:30] [INFO ] Invariant cache hit.
[2023-03-08 04:59:30] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 420 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s177 0) (EQ s95 1)), p0:(OR (EQ s191 0) (EQ s92 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8446 steps with 189 reset in 33 ms.
FORMULA DES-PT-20a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-13 finished in 577 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((p0||G(F(p1)))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 04:59:30] [INFO ] Invariant cache hit.
[2023-03-08 04:59:30] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-08 04:59:30] [INFO ] Invariant cache hit.
[2023-03-08 04:59:31] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-08 04:59:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:59:31] [INFO ] Invariant cache hit.
[2023-03-08 04:59:31] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 462 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s9 0) (NEQ s123 1)), p1:(AND (NEQ s119 0) (NEQ s178 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12587 steps with 564 reset in 42 ms.
FORMULA DES-PT-20a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-14 finished in 665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(!p0)&&G((F(p2)||p1)))||G(!p0)))))'
[2023-03-08 04:59:31] [INFO ] Flatten gal took : 18 ms
[2023-03-08 04:59:31] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-08 04:59:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 137 transitions and 671 arcs took 2 ms.
Total runtime 33196 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-20a
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLCardinality

FORMULA DES-PT-20a-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678251572683

--------------------
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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DES-PT-20a-LTLCardinality-06
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DES-PT-20a-LTLCardinality-06
lola: result : false
lola: markings : 46
lola: fired transitions : 46
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLCardinality-06: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="DES-PT-20a"
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 DES-PT-20a, 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 r103-tall-167814478300427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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