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.r105-tall-167814481200443.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DES-PT-30a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481200443
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:40 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.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:44 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 70K 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-30a-LTLCardinality-00
FORMULA_NAME DES-PT-30a-LTLCardinality-01
FORMULA_NAME DES-PT-30a-LTLCardinality-02
FORMULA_NAME DES-PT-30a-LTLCardinality-03
FORMULA_NAME DES-PT-30a-LTLCardinality-04
FORMULA_NAME DES-PT-30a-LTLCardinality-05
FORMULA_NAME DES-PT-30a-LTLCardinality-06
FORMULA_NAME DES-PT-30a-LTLCardinality-07
FORMULA_NAME DES-PT-30a-LTLCardinality-08
FORMULA_NAME DES-PT-30a-LTLCardinality-09
FORMULA_NAME DES-PT-30a-LTLCardinality-10
FORMULA_NAME DES-PT-30a-LTLCardinality-11
FORMULA_NAME DES-PT-30a-LTLCardinality-12
FORMULA_NAME DES-PT-30a-LTLCardinality-13
FORMULA_NAME DES-PT-30a-LTLCardinality-14
FORMULA_NAME DES-PT-30a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678299901990

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 18:25:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 18:25:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 18:25:03] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-08 18:25:03] [INFO ] Transformed 234 places.
[2023-03-08 18:25:03] [INFO ] Transformed 191 transitions.
[2023-03-08 18:25:03] [INFO ] Found NUPN structural information;
[2023-03-08 18:25:03] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 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 5 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-30a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 233 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 176
Applied a total of 2 rules in 53 ms. Remains 233 /234 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 233 cols
[2023-03-08 18:25:04] [INFO ] Computed 59 place invariants in 19 ms
[2023-03-08 18:25:04] [INFO ] Implicit Places using invariants in 295 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 547 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/234 places, 176/177 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 606 ms. Remains : 232/234 places, 176/177 transitions.
Support contains 27 out of 232 places after structural reductions.
[2023-03-08 18:25:04] [INFO ] Flatten gal took : 52 ms
[2023-03-08 18:25:04] [INFO ] Flatten gal took : 23 ms
[2023-03-08 18:25:04] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 22 out of 232 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 212 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 18:25:04] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 18:25:04] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-08 18:25:04] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-08 18:25:04] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 18:25:05] [INFO ] [Nat]Absence check using 32 positive place invariants in 12 ms returned sat
[2023-03-08 18:25:05] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 44 ms returned sat
[2023-03-08 18:25:05] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 18:25:05] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 4 ms to minimize.
[2023-03-08 18:25:05] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2023-03-08 18:25:05] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2023-03-08 18:25:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 163 ms
[2023-03-08 18:25:05] [INFO ] After 322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-08 18:25:05] [INFO ] After 507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 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 232 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 232 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 231 transition count 173
Applied a total of 9 rules in 37 ms. Remains 231 /232 variables (removed 1) and now considering 173/176 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 231/232 places, 173/176 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1172225 steps, run timeout after 3001 ms. (steps per millisecond=390 ) properties seen :{}
Probabilistic random walk after 1172225 steps, saw 164246 distinct states, run finished after 3002 ms. (steps per millisecond=390 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 173 rows 231 cols
[2023-03-08 18:25:08] [INFO ] Computed 60 place invariants in 12 ms
[2023-03-08 18:25:08] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 18:25:08] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 18:25:08] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 18:25:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 18:25:08] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 92 ms returned sat
[2023-03-08 18:25:09] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 18:25:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:25:09] [INFO ] After 26ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 18:25:09] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-08 18:25:09] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 ms.
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 10 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 8 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-08 18:25:09] [INFO ] Invariant cache hit.
[2023-03-08 18:25:09] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-08 18:25:09] [INFO ] Invariant cache hit.
[2023-03-08 18:25:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:25:09] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-08 18:25:09] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 18:25:09] [INFO ] Invariant cache hit.
[2023-03-08 18:25:09] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 603 ms. Remains : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 18:25:09] [INFO ] Invariant cache hit.
[2023-03-08 18:25:09] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 18:25:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 18:25:09] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 18:25:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 18:25:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 65 ms returned sat
[2023-03-08 18:25:10] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 18:25:10] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2023-03-08 18:25:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-08 18:25:10] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-08 18:25:10] [INFO ] After 494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 135 stabilizing places and 130 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(G(p1)))))'
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 18:25:10] [INFO ] Computed 58 place invariants in 15 ms
[2023-03-08 18:25:10] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-08 18:25:10] [INFO ] Invariant cache hit.
[2023-03-08 18:25:11] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-08 18:25:11] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 18:25:11] [INFO ] Invariant cache hit.
[2023-03-08 18:25:11] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 526 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-30a-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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s178 1), p1:(AND (OR (EQ s4 0) (EQ s160 1)) (OR (EQ s223 0) (EQ s24 1)))], 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 23027 steps with 1069 reset in 226 ms.
FORMULA DES-PT-30a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLCardinality-02 finished in 1124 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))'
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 18:25:11] [INFO ] Invariant cache hit.
[2023-03-08 18:25:11] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-08 18:25:11] [INFO ] Invariant cache hit.
[2023-03-08 18:25:12] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-08 18:25:12] [INFO ] Invariant cache hit.
[2023-03-08 18:25:12] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 512 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-30a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s47 0) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLCardinality-05 finished in 633 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(X(G((p0 U p1)))))))'
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 18:25:12] [INFO ] Invariant cache hit.
[2023-03-08 18:25:12] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-08 18:25:12] [INFO ] Invariant cache hit.
[2023-03-08 18:25:12] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-08 18:25:12] [INFO ] Invariant cache hit.
[2023-03-08 18:25:12] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 511 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(OR p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s196 0) (EQ s213 1)), p0:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 271 steps with 6 reset in 2 ms.
FORMULA DES-PT-30a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLCardinality-07 finished in 834 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 p1)||F(p2)) U X(p3)))'
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 18:25:13] [INFO ] Invariant cache hit.
[2023-03-08 18:25:13] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-08 18:25:13] [INFO ] Invariant cache hit.
[2023-03-08 18:25:13] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-08 18:25:13] [INFO ] Invariant cache hit.
[2023-03-08 18:25:13] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-30a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s194 0) (EQ s156 1)), p0:(OR (EQ s13 0) (EQ s134 1)), p2:(OR (EQ s154 0) (EQ s67 1)), p3:(OR (EQ s211 0) (EQ s184 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 389 ms.
Product exploration explored 100000 steps with 50000 reset in 489 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X p3), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p3)
Knowledge based reduction with 18 factoid took 370 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLCardinality-09 finished in 2131 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(!p1))))'
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 18:25:15] [INFO ] Invariant cache hit.
[2023-03-08 18:25:15] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-08 18:25:15] [INFO ] Invariant cache hit.
[2023-03-08 18:25:15] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2023-03-08 18:25:15] [INFO ] Invariant cache hit.
[2023-03-08 18:25:15] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 485 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 375 ms :[p1, p1, p1, true]
Running random walk in product with property : DES-PT-30a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s164 0) (EQ s111 1) (EQ s170 0) (EQ s74 1)), p1:(OR (EQ s170 0) (EQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33271 reset in 296 ms.
Product exploration explored 100000 steps with 33346 reset in 309 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 284 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[p1, p1, p1, true]
Incomplete random walk after 10000 steps, including 232 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 18:25:17] [INFO ] Invariant cache hit.
[2023-03-08 18:25:17] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 415 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[p1, p1, p1, true]
Stuttering acceptance computed with spot in 130 ms :[p1, p1, p1, true]
[2023-03-08 18:25:17] [INFO ] Invariant cache hit.
[2023-03-08 18:25:18] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2023-03-08 18:25:18] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 20 ms returned sat
[2023-03-08 18:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:25:18] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2023-03-08 18:25:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:25:18] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-08 18:25:18] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 71 ms returned sat
[2023-03-08 18:25:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:25:19] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2023-03-08 18:25:19] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2023-03-08 18:25:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-08 18:25:19] [INFO ] Computed and/alt/rep : 168/504/168 causal constraints (skipped 7 transitions) in 11 ms.
[2023-03-08 18:25:19] [INFO ] Added : 64 causal constraints over 13 iterations in 318 ms. Result :sat
Could not prove EG p1
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 18:25:19] [INFO ] Invariant cache hit.
[2023-03-08 18:25:19] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-08 18:25:19] [INFO ] Invariant cache hit.
[2023-03-08 18:25:19] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-08 18:25:19] [INFO ] Invariant cache hit.
[2023-03-08 18:25:19] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 483 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[p1, p1, p1, true]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 214 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[p1, p1, p1, true]
Stuttering acceptance computed with spot in 135 ms :[p1, p1, p1, true]
[2023-03-08 18:25:20] [INFO ] Invariant cache hit.
[2023-03-08 18:25:20] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-08 18:25:20] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 19 ms returned sat
[2023-03-08 18:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:25:21] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2023-03-08 18:25:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:25:21] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-08 18:25:21] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 70 ms returned sat
[2023-03-08 18:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:25:21] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2023-03-08 18:25:21] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-08 18:25:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-08 18:25:21] [INFO ] Computed and/alt/rep : 168/504/168 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-08 18:25:22] [INFO ] Added : 64 causal constraints over 13 iterations in 326 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 127 ms :[p1, p1, p1, true]
Product exploration explored 100000 steps with 33374 reset in 289 ms.
Product exploration explored 100000 steps with 33344 reset in 327 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 136 ms :[p1, p1, p1, true]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 18:25:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 18:25:23] [INFO ] Invariant cache hit.
[2023-03-08 18:25:23] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 232/232 places, 176/176 transitions.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 18:25:23] [INFO ] Invariant cache hit.
[2023-03-08 18:25:23] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-08 18:25:23] [INFO ] Invariant cache hit.
[2023-03-08 18:25:23] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-08 18:25:23] [INFO ] Invariant cache hit.
[2023-03-08 18:25:23] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 497 ms. Remains : 232/232 places, 176/176 transitions.
Treatment of property DES-PT-30a-LTLCardinality-11 finished in 8658 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(!p1))))'
Found a Lengthening insensitive property : DES-PT-30a-LTLCardinality-11
Stuttering acceptance computed with spot in 133 ms :[p1, p1, p1, true]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 18:25:24] [INFO ] Invariant cache hit.
[2023-03-08 18:25:24] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-08 18:25:24] [INFO ] Invariant cache hit.
[2023-03-08 18:25:24] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-08 18:25:24] [INFO ] Invariant cache hit.
[2023-03-08 18:25:24] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 463 ms. Remains : 232/232 places, 176/176 transitions.
Running random walk in product with property : DES-PT-30a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s164 0) (EQ s111 1) (EQ s170 0) (EQ s74 1)), p1:(OR (EQ s170 0) (EQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33360 reset in 288 ms.
Product exploration explored 100000 steps with 33348 reset in 303 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 342 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[p1, p1, p1, true]
Incomplete random walk after 10000 steps, including 231 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 18:25:25] [INFO ] Invariant cache hit.
[2023-03-08 18:25:25] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 491 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[p1, p1, p1, true]
Stuttering acceptance computed with spot in 106 ms :[p1, p1, p1, true]
[2023-03-08 18:25:26] [INFO ] Invariant cache hit.
[2023-03-08 18:25:26] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-08 18:25:26] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 18 ms returned sat
[2023-03-08 18:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:25:27] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2023-03-08 18:25:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:25:27] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-08 18:25:27] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 78 ms returned sat
[2023-03-08 18:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:25:27] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2023-03-08 18:25:27] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-08 18:25:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-08 18:25:27] [INFO ] Computed and/alt/rep : 168/504/168 causal constraints (skipped 7 transitions) in 11 ms.
[2023-03-08 18:25:27] [INFO ] Added : 64 causal constraints over 13 iterations in 327 ms. Result :sat
Could not prove EG p1
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 18:25:27] [INFO ] Invariant cache hit.
[2023-03-08 18:25:28] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-08 18:25:28] [INFO ] Invariant cache hit.
[2023-03-08 18:25:28] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-08 18:25:28] [INFO ] Invariant cache hit.
[2023-03-08 18:25:28] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 498 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[p1, p1, p1, true]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[p1, p1, p1, true]
Stuttering acceptance computed with spot in 154 ms :[p1, p1, p1, true]
[2023-03-08 18:25:29] [INFO ] Invariant cache hit.
[2023-03-08 18:25:29] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-08 18:25:29] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 19 ms returned sat
[2023-03-08 18:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:25:29] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2023-03-08 18:25:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:25:29] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-08 18:25:30] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 70 ms returned sat
[2023-03-08 18:25:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:25:30] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2023-03-08 18:25:30] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2023-03-08 18:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-08 18:25:30] [INFO ] Computed and/alt/rep : 168/504/168 causal constraints (skipped 7 transitions) in 11 ms.
[2023-03-08 18:25:30] [INFO ] Added : 64 causal constraints over 13 iterations in 327 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 209 ms :[p1, p1, p1, true]
Product exploration explored 100000 steps with 33403 reset in 294 ms.
Product exploration explored 100000 steps with 33342 reset in 305 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 120 ms :[p1, p1, p1, true]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 18:25:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 18:25:31] [INFO ] Invariant cache hit.
[2023-03-08 18:25:31] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 232/232 places, 176/176 transitions.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 18:25:31] [INFO ] Invariant cache hit.
[2023-03-08 18:25:32] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-08 18:25:32] [INFO ] Invariant cache hit.
[2023-03-08 18:25:32] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2023-03-08 18:25:32] [INFO ] Invariant cache hit.
[2023-03-08 18:25:32] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 485 ms. Remains : 232/232 places, 176/176 transitions.
Treatment of property DES-PT-30a-LTLCardinality-11 finished in 8505 ms.
[2023-03-08 18:25:32] [INFO ] Flatten gal took : 16 ms
[2023-03-08 18:25:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-08 18:25:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 232 places, 176 transitions and 855 arcs took 2 ms.
Total runtime 29003 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1221/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DES-PT-30a-LTLCardinality-11

BK_STOP 1678299933834

--------------------
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
mcc2023
ltl formula name DES-PT-30a-LTLCardinality-11
ltl formula formula --ltl=/tmp/1221/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 232 places, 176 transitions and 855 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1221/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1221/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1221/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1221/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DES-PT-30a, 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 r105-tall-167814481200443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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