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.r137-smll-167819418800564.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 DoubleLock-PT-p3s3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418800564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 6.9K Feb 25 14:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 14:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 14:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 14:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 14:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 14:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 DoubleLock-PT-p3s3-LTLFireability-00
FORMULA_NAME DoubleLock-PT-p3s3-LTLFireability-01
FORMULA_NAME DoubleLock-PT-p3s3-LTLFireability-02
FORMULA_NAME DoubleLock-PT-p3s3-LTLFireability-03
FORMULA_NAME DoubleLock-PT-p3s3-LTLFireability-04
FORMULA_NAME DoubleLock-PT-p3s3-LTLFireability-05
FORMULA_NAME DoubleLock-PT-p3s3-LTLFireability-06
FORMULA_NAME DoubleLock-PT-p3s3-LTLFireability-07
FORMULA_NAME DoubleLock-PT-p3s3-LTLFireability-08
FORMULA_NAME DoubleLock-PT-p3s3-LTLFireability-09
FORMULA_NAME DoubleLock-PT-p3s3-LTLFireability-10
FORMULA_NAME DoubleLock-PT-p3s3-LTLFireability-11
FORMULA_NAME DoubleLock-PT-p3s3-LTLFireability-12
FORMULA_NAME DoubleLock-PT-p3s3-LTLFireability-13
FORMULA_NAME DoubleLock-PT-p3s3-LTLFireability-14
FORMULA_NAME DoubleLock-PT-p3s3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678963407462

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s3
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 10:43:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 10:43:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 10:43:30] [INFO ] Load time of PNML (sax parser for PT used): 348 ms
[2023-03-16 10:43:30] [INFO ] Transformed 306 places.
[2023-03-16 10:43:30] [INFO ] Transformed 3136 transitions.
[2023-03-16 10:43:30] [INFO ] Parsed PT model containing 306 places and 3136 transitions and 12672 arcs in 489 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 68 places in 16 ms
Reduce places removed 68 places and 128 transitions.
FORMULA DoubleLock-PT-p3s3-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 3008/3008 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 235 transition count 3008
Applied a total of 3 rules in 76 ms. Remains 235 /238 variables (removed 3) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:43:30] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2023-03-16 10:43:31] [INFO ] Computed 2 place invariants in 55 ms
[2023-03-16 10:43:31] [INFO ] Implicit Places using invariants in 601 ms returned []
[2023-03-16 10:43:31] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:43:31] [INFO ] Invariant cache hit.
[2023-03-16 10:43:32] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:43:34] [INFO ] Implicit Places using invariants and state equation in 3349 ms returned []
Implicit Place search using SMT with State Equation took 3993 ms to find 0 implicit places.
[2023-03-16 10:43:34] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:43:34] [INFO ] Invariant cache hit.
[2023-03-16 10:43:36] [INFO ] Dead Transitions using invariants and state equation in 1425 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/238 places, 3008/3008 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5497 ms. Remains : 235/238 places, 3008/3008 transitions.
Support contains 46 out of 235 places after structural reductions.
[2023-03-16 10:43:37] [INFO ] Flatten gal took : 315 ms
[2023-03-16 10:43:37] [INFO ] Flatten gal took : 187 ms
[2023-03-16 10:43:37] [INFO ] Input system was already deterministic with 3008 transitions.
Incomplete random walk after 10000 steps, including 96 resets, run finished after 738 ms. (steps per millisecond=13 ) properties (out of 24) seen :10
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-16 10:43:39] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:43:39] [INFO ] Invariant cache hit.
[2023-03-16 10:43:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:43:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 10:43:41] [INFO ] After 1864ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:3
[2023-03-16 10:43:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:43:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 10:43:42] [INFO ] After 1088ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2023-03-16 10:43:42] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:43:43] [INFO ] After 1183ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :5 sat :3
[2023-03-16 10:43:44] [INFO ] After 2708ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :3
Attempting to minimize the solution found.
Minimization took 1167 ms.
[2023-03-16 10:43:46] [INFO ] After 5085ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :3
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 235 transition count 2977
Applied a total of 31 rules in 170 ms. Remains 235 /235 variables (removed 0) and now considering 2977/3008 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 235/235 places, 2977/3008 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 120922 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 120922 steps, saw 92197 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 10:43:49] [INFO ] Flow matrix only has 2090 transitions (discarded 887 similar events)
// Phase 1: matrix 2090 rows 235 cols
[2023-03-16 10:43:49] [INFO ] Computed 2 place invariants in 21 ms
[2023-03-16 10:43:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:43:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-16 10:43:51] [INFO ] After 1964ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 10:43:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:43:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 10:43:53] [INFO ] After 1437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 10:43:53] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:44:00] [INFO ] After 7491ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 10:44:01] [INFO ] After 8643ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1661 ms.
[2023-03-16 10:44:03] [INFO ] After 11848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 42 ms.
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2977/2977 transitions.
Applied a total of 0 rules in 86 ms. Remains 235 /235 variables (removed 0) and now considering 2977/2977 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 235/235 places, 2977/2977 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2977/2977 transitions.
Applied a total of 0 rules in 76 ms. Remains 235 /235 variables (removed 0) and now considering 2977/2977 (removed 0) transitions.
[2023-03-16 10:44:03] [INFO ] Flow matrix only has 2090 transitions (discarded 887 similar events)
[2023-03-16 10:44:03] [INFO ] Invariant cache hit.
[2023-03-16 10:44:04] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-16 10:44:04] [INFO ] Flow matrix only has 2090 transitions (discarded 887 similar events)
[2023-03-16 10:44:04] [INFO ] Invariant cache hit.
[2023-03-16 10:44:04] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:44:07] [INFO ] Implicit Places using invariants and state equation in 3591 ms returned []
Implicit Place search using SMT with State Equation took 3999 ms to find 0 implicit places.
[2023-03-16 10:44:07] [INFO ] Redundant transitions in 242 ms returned []
[2023-03-16 10:44:07] [INFO ] Flow matrix only has 2090 transitions (discarded 887 similar events)
[2023-03-16 10:44:07] [INFO ] Invariant cache hit.
[2023-03-16 10:44:09] [INFO ] Dead Transitions using invariants and state equation in 1858 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6184 ms. Remains : 235/235 places, 2977/2977 transitions.
Ensure Unique test removed 887 transitions
Reduce isomorphic transitions removed 887 transitions.
Iterating post reduction 0 with 887 rules applied. Total rules applied 887 place count 235 transition count 2090
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 887 place count 235 transition count 2084
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 899 place count 229 transition count 2084
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 901 place count 228 transition count 2083
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 902 place count 228 transition count 2082
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 903 place count 227 transition count 2082
Applied a total of 903 rules in 219 ms. Remains 227 /235 variables (removed 8) and now considering 2082/2977 (removed 895) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2082 rows 227 cols
[2023-03-16 10:44:09] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-16 10:44:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:44:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 10:44:11] [INFO ] After 1372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 10:44:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-16 10:44:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 10:44:12] [INFO ] After 1189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 10:44:12] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-16 10:44:13] [INFO ] After 704ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 10:44:13] [INFO ] After 1362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 385 ms.
[2023-03-16 10:44:14] [INFO ] After 3026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA DoubleLock-PT-p3s3-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 960 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' '!(F(X(F(G((F(G((!(p1 U p2)||p0)))&&!p1))))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 127 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:44:14] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2023-03-16 10:44:14] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-16 10:44:15] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-16 10:44:15] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:44:15] [INFO ] Invariant cache hit.
[2023-03-16 10:44:15] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:44:20] [INFO ] Implicit Places using invariants and state equation in 5239 ms returned []
Implicit Place search using SMT with State Equation took 5623 ms to find 0 implicit places.
[2023-03-16 10:44:20] [INFO ] Redundant transitions in 220 ms returned []
[2023-03-16 10:44:20] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:44:20] [INFO ] Invariant cache hit.
[2023-03-16 10:44:22] [INFO ] Dead Transitions using invariants and state equation in 1935 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7917 ms. Remains : 235/235 places, 3008/3008 transitions.
Stuttering acceptance computed with spot in 343 ms :[(OR p1 (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : DoubleLock-PT-p3s3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 1}], [{ cond=(OR p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s201 1)), p0:(OR (LT s13 1) (LT s197 1)), p2:(AND (GEQ s13 1) (GEQ s197 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1469 reset in 858 ms.
Product exploration explored 100000 steps with 1445 reset in 805 ms.
Computed a total of 9 stabilizing places and 960 stable transitions
Computed a total of 9 stabilizing places and 960 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (OR p0 (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (OR p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 627 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR p1 (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 97 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-16 10:44:25] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:44:25] [INFO ] Invariant cache hit.
[2023-03-16 10:44:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:44:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 10:44:28] [INFO ] After 2289ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-16 10:44:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:44:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 10:44:29] [INFO ] After 1729ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-16 10:44:30] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:44:37] [INFO ] After 7296ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-16 10:44:38] [INFO ] After 8541ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 749 ms.
[2023-03-16 10:44:39] [INFO ] After 11101ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 235 transition count 2978
Applied a total of 30 rules in 72 ms. Remains 235 /235 variables (removed 0) and now considering 2978/3008 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 235/235 places, 2978/3008 transitions.
Incomplete random walk after 10001 steps, including 89 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 155873 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 155873 steps, saw 117551 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 10:44:42] [INFO ] Flow matrix only has 2091 transitions (discarded 887 similar events)
// Phase 1: matrix 2091 rows 235 cols
[2023-03-16 10:44:42] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-16 10:44:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:44:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 10:44:43] [INFO ] After 1363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 10:44:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:44:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 10:44:45] [INFO ] After 1387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 10:44:45] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:44:54] [INFO ] After 8795ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 10:44:56] [INFO ] After 10640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2073 ms.
[2023-03-16 10:44:58] [INFO ] After 14182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2978/2978 transitions.
Applied a total of 0 rules in 72 ms. Remains 235 /235 variables (removed 0) and now considering 2978/2978 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 235/235 places, 2978/2978 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2978/2978 transitions.
Applied a total of 0 rules in 66 ms. Remains 235 /235 variables (removed 0) and now considering 2978/2978 (removed 0) transitions.
[2023-03-16 10:44:58] [INFO ] Flow matrix only has 2091 transitions (discarded 887 similar events)
[2023-03-16 10:44:58] [INFO ] Invariant cache hit.
[2023-03-16 10:44:58] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-16 10:44:58] [INFO ] Flow matrix only has 2091 transitions (discarded 887 similar events)
[2023-03-16 10:44:58] [INFO ] Invariant cache hit.
[2023-03-16 10:44:59] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:45:03] [INFO ] Implicit Places using invariants and state equation in 4909 ms returned []
Implicit Place search using SMT with State Equation took 5283 ms to find 0 implicit places.
[2023-03-16 10:45:03] [INFO ] Redundant transitions in 115 ms returned []
[2023-03-16 10:45:03] [INFO ] Flow matrix only has 2091 transitions (discarded 887 similar events)
[2023-03-16 10:45:03] [INFO ] Invariant cache hit.
[2023-03-16 10:45:05] [INFO ] Dead Transitions using invariants and state equation in 1708 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7183 ms. Remains : 235/235 places, 2978/2978 transitions.
Ensure Unique test removed 887 transitions
Reduce isomorphic transitions removed 887 transitions.
Iterating post reduction 0 with 887 rules applied. Total rules applied 887 place count 235 transition count 2091
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 887 place count 235 transition count 2084
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 901 place count 228 transition count 2084
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 903 place count 227 transition count 2083
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 904 place count 227 transition count 2082
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 905 place count 226 transition count 2082
Applied a total of 905 rules in 101 ms. Remains 226 /235 variables (removed 9) and now considering 2082/2978 (removed 896) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2082 rows 226 cols
[2023-03-16 10:45:05] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-16 10:45:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:45:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 10:45:06] [INFO ] After 1267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 10:45:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:45:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 10:45:07] [INFO ] After 860ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 10:45:07] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-16 10:45:08] [INFO ] After 1174ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 10:45:10] [INFO ] After 2715ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1522 ms.
[2023-03-16 10:45:11] [INFO ] After 5172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (OR p0 (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (OR p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (OR p0 (NOT p2)))), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 15 factoid took 1090 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR p1 p2), p2]
Stuttering acceptance computed with spot in 80 ms :[(OR p1 p2), p2]
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 58 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:45:13] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2023-03-16 10:45:13] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-16 10:45:13] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-16 10:45:13] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:45:13] [INFO ] Invariant cache hit.
[2023-03-16 10:45:14] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:45:18] [INFO ] Implicit Places using invariants and state equation in 5219 ms returned []
Implicit Place search using SMT with State Equation took 5594 ms to find 0 implicit places.
[2023-03-16 10:45:19] [INFO ] Redundant transitions in 113 ms returned []
[2023-03-16 10:45:19] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:45:19] [INFO ] Invariant cache hit.
[2023-03-16 10:45:20] [INFO ] Dead Transitions using invariants and state equation in 1847 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7622 ms. Remains : 235/235 places, 3008/3008 transitions.
Computed a total of 9 stabilizing places and 960 stable transitions
Computed a total of 9 stabilizing places and 960 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 320 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR p1 p2), p2]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-16 10:45:21] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:45:21] [INFO ] Invariant cache hit.
[2023-03-16 10:45:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:45:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 10:45:22] [INFO ] After 983ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 10:45:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:45:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 10:45:23] [INFO ] After 1049ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 10:45:23] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:45:31] [INFO ] After 7832ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 10:45:31] [INFO ] After 8196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-16 10:45:31] [INFO ] After 9417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 235 transition count 2977
Applied a total of 31 rules in 60 ms. Remains 235 /235 variables (removed 0) and now considering 2977/3008 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 235/235 places, 2977/3008 transitions.
Incomplete random walk after 10005 steps, including 93 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 250736 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250736 steps, saw 186328 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 10:45:35] [INFO ] Flow matrix only has 2090 transitions (discarded 887 similar events)
// Phase 1: matrix 2090 rows 235 cols
[2023-03-16 10:45:35] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-16 10:45:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:45:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 10:45:35] [INFO ] After 757ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 10:45:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:45:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 10:45:36] [INFO ] After 689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 10:45:36] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:45:45] [INFO ] After 9048ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 10:45:45] [INFO ] After 9804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2977/2977 transitions.
Applied a total of 0 rules in 55 ms. Remains 235 /235 variables (removed 0) and now considering 2977/2977 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 235/235 places, 2977/2977 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2977/2977 transitions.
Applied a total of 0 rules in 62 ms. Remains 235 /235 variables (removed 0) and now considering 2977/2977 (removed 0) transitions.
[2023-03-16 10:45:45] [INFO ] Flow matrix only has 2090 transitions (discarded 887 similar events)
[2023-03-16 10:45:45] [INFO ] Invariant cache hit.
[2023-03-16 10:45:46] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-16 10:45:46] [INFO ] Flow matrix only has 2090 transitions (discarded 887 similar events)
[2023-03-16 10:45:46] [INFO ] Invariant cache hit.
[2023-03-16 10:45:46] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:45:51] [INFO ] Implicit Places using invariants and state equation in 5654 ms returned []
Implicit Place search using SMT with State Equation took 6081 ms to find 0 implicit places.
[2023-03-16 10:45:51] [INFO ] Redundant transitions in 112 ms returned []
[2023-03-16 10:45:51] [INFO ] Flow matrix only has 2090 transitions (discarded 887 similar events)
[2023-03-16 10:45:51] [INFO ] Invariant cache hit.
[2023-03-16 10:45:53] [INFO ] Dead Transitions using invariants and state equation in 1907 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8178 ms. Remains : 235/235 places, 2977/2977 transitions.
Ensure Unique test removed 887 transitions
Reduce isomorphic transitions removed 887 transitions.
Iterating post reduction 0 with 887 rules applied. Total rules applied 887 place count 235 transition count 2090
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 887 place count 235 transition count 2083
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 901 place count 228 transition count 2083
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 903 place count 227 transition count 2082
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 904 place count 227 transition count 2081
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 905 place count 226 transition count 2081
Applied a total of 905 rules in 92 ms. Remains 226 /235 variables (removed 9) and now considering 2081/2977 (removed 896) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2081 rows 226 cols
[2023-03-16 10:45:53] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-16 10:45:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:45:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 10:45:54] [INFO ] After 977ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 10:45:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:45:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 10:45:55] [INFO ] After 732ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 10:45:55] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-16 10:45:55] [INFO ] After 118ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 10:45:56] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-16 10:45:56] [INFO ] After 1417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(OR p1 p2), p2]
Stuttering acceptance computed with spot in 74 ms :[(OR p1 p2), p2]
Stuttering acceptance computed with spot in 73 ms :[(OR p1 p2), p2]
Product exploration explored 100000 steps with 1481 reset in 669 ms.
Product exploration explored 100000 steps with 1465 reset in 605 ms.
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 71 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:45:58] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2023-03-16 10:45:58] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-16 10:45:58] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-16 10:45:58] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:45:58] [INFO ] Invariant cache hit.
[2023-03-16 10:45:59] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:46:03] [INFO ] Implicit Places using invariants and state equation in 4901 ms returned []
Implicit Place search using SMT with State Equation took 5368 ms to find 0 implicit places.
[2023-03-16 10:46:03] [INFO ] Redundant transitions in 115 ms returned []
[2023-03-16 10:46:03] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:03] [INFO ] Invariant cache hit.
[2023-03-16 10:46:05] [INFO ] Dead Transitions using invariants and state equation in 1865 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7429 ms. Remains : 235/235 places, 3008/3008 transitions.
Treatment of property DoubleLock-PT-p3s3-LTLFireability-01 finished in 111319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 56 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:46:06] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:06] [INFO ] Invariant cache hit.
[2023-03-16 10:46:06] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-16 10:46:06] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:06] [INFO ] Invariant cache hit.
[2023-03-16 10:46:06] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:46:10] [INFO ] Implicit Places using invariants and state equation in 4357 ms returned []
Implicit Place search using SMT with State Equation took 4718 ms to find 0 implicit places.
[2023-03-16 10:46:10] [INFO ] Redundant transitions in 113 ms returned []
[2023-03-16 10:46:10] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:10] [INFO ] Invariant cache hit.
[2023-03-16 10:46:12] [INFO ] Dead Transitions using invariants and state equation in 1677 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6572 ms. Remains : 235/235 places, 3008/3008 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p3s3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s27 1) (LT s197 1)), p1:(AND (OR (LT s27 1) (LT s197 1)) (OR (LT s51 1) (LT s196 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]]
Product exploration explored 100000 steps with 1886 reset in 752 ms.
Product exploration explored 100000 steps with 1931 reset in 638 ms.
Computed a total of 9 stabilizing places and 960 stable transitions
Computed a total of 9 stabilizing places and 960 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 5039 steps, including 48 resets, run visited all 2 properties in 17 ms. (steps per millisecond=296 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 259 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 54 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:46:15] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:15] [INFO ] Invariant cache hit.
[2023-03-16 10:46:15] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-16 10:46:15] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:15] [INFO ] Invariant cache hit.
[2023-03-16 10:46:15] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:46:20] [INFO ] Implicit Places using invariants and state equation in 4602 ms returned []
Implicit Place search using SMT with State Equation took 5049 ms to find 0 implicit places.
[2023-03-16 10:46:20] [INFO ] Redundant transitions in 109 ms returned []
[2023-03-16 10:46:20] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:20] [INFO ] Invariant cache hit.
[2023-03-16 10:46:21] [INFO ] Dead Transitions using invariants and state equation in 1452 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6671 ms. Remains : 235/235 places, 3008/3008 transitions.
Computed a total of 9 stabilizing places and 960 stable transitions
Computed a total of 9 stabilizing places and 960 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 5958 steps, including 58 resets, run visited all 2 properties in 33 ms. (steps per millisecond=180 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 251 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1902 reset in 587 ms.
Product exploration explored 100000 steps with 1880 reset in 601 ms.
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 54 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:46:23] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:23] [INFO ] Invariant cache hit.
[2023-03-16 10:46:24] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-16 10:46:24] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:24] [INFO ] Invariant cache hit.
[2023-03-16 10:46:24] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:46:28] [INFO ] Implicit Places using invariants and state equation in 4146 ms returned []
Implicit Place search using SMT with State Equation took 4565 ms to find 0 implicit places.
[2023-03-16 10:46:28] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-16 10:46:28] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:28] [INFO ] Invariant cache hit.
[2023-03-16 10:46:30] [INFO ] Dead Transitions using invariants and state equation in 1643 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6377 ms. Remains : 235/235 places, 3008/3008 transitions.
Treatment of property DoubleLock-PT-p3s3-LTLFireability-02 finished in 24479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 8 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 9 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:46:30] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:30] [INFO ] Invariant cache hit.
[2023-03-16 10:46:30] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-16 10:46:30] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:30] [INFO ] Invariant cache hit.
[2023-03-16 10:46:31] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:46:34] [INFO ] Implicit Places using invariants and state equation in 3761 ms returned []
Implicit Place search using SMT with State Equation took 4118 ms to find 0 implicit places.
[2023-03-16 10:46:34] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:34] [INFO ] Invariant cache hit.
[2023-03-16 10:46:36] [INFO ] Dead Transitions using invariants and state equation in 1482 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5612 ms. Remains : 235/235 places, 3008/3008 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s3-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (OR (LT s18 1) (LT s213 1)) (OR (AND (GEQ s56 1) (GEQ s230 1)) (LT s62 1) (LT s218 1))), p0:(AND (GEQ s17 1) (GEQ s193 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2285 steps with 32 reset in 18 ms.
FORMULA DoubleLock-PT-p3s3-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s3-LTLFireability-09 finished in 5815 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(F(p0))&&F(p1))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 8 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:46:36] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:36] [INFO ] Invariant cache hit.
[2023-03-16 10:46:36] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-16 10:46:36] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:36] [INFO ] Invariant cache hit.
[2023-03-16 10:46:37] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:46:42] [INFO ] Implicit Places using invariants and state equation in 5986 ms returned []
Implicit Place search using SMT with State Equation took 6358 ms to find 0 implicit places.
[2023-03-16 10:46:42] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:42] [INFO ] Invariant cache hit.
[2023-03-16 10:46:43] [INFO ] Dead Transitions using invariants and state equation in 1302 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7674 ms. Remains : 235/235 places, 3008/3008 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p3s3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s9 1) (LT s214 1)), p0:(OR (LT s0 1) (LT s192 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]]
Product exploration explored 100000 steps with 26666 reset in 583 ms.
Product exploration explored 100000 steps with 26562 reset in 514 ms.
Computed a total of 9 stabilizing places and 960 stable transitions
Computed a total of 9 stabilizing places and 960 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-16 10:46:45] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:45] [INFO ] Invariant cache hit.
[2023-03-16 10:46:48] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-16 10:46:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 10:46:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 10:46:48] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2023-03-16 10:46:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 10:46:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:46:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 10:46:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 10:46:51] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2023-03-16 10:46:51] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:46:51] [INFO ] [Nat]Added 143 Read/Feed constraints in 164 ms returned sat
[2023-03-16 10:46:51] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 310 ms.
[2023-03-16 10:46:51] [INFO ] Added : 0 causal constraints over 0 iterations in 479 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 235 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 8 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:46:51] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:51] [INFO ] Invariant cache hit.
[2023-03-16 10:46:52] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-03-16 10:46:52] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:52] [INFO ] Invariant cache hit.
[2023-03-16 10:46:52] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:46:57] [INFO ] Implicit Places using invariants and state equation in 5031 ms returned []
Implicit Place search using SMT with State Equation took 5467 ms to find 0 implicit places.
[2023-03-16 10:46:57] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:57] [INFO ] Invariant cache hit.
[2023-03-16 10:46:58] [INFO ] Dead Transitions using invariants and state equation in 1463 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6940 ms. Remains : 235/235 places, 3008/3008 transitions.
Computed a total of 9 stabilizing places and 960 stable transitions
Computed a total of 9 stabilizing places and 960 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-16 10:46:59] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:46:59] [INFO ] Invariant cache hit.
[2023-03-16 10:47:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:47:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 10:47:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 10:47:01] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2023-03-16 10:47:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 10:47:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:47:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 10:47:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 10:47:04] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2023-03-16 10:47:04] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:47:04] [INFO ] [Nat]Added 143 Read/Feed constraints in 153 ms returned sat
[2023-03-16 10:47:04] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 231 ms.
[2023-03-16 10:47:04] [INFO ] Added : 0 causal constraints over 0 iterations in 378 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 26622 reset in 573 ms.
Product exploration explored 100000 steps with 26711 reset in 583 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 82 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:47:06] [INFO ] Redundant transitions in 113 ms returned []
[2023-03-16 10:47:06] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:06] [INFO ] Invariant cache hit.
[2023-03-16 10:47:07] [INFO ] Dead Transitions using invariants and state equation in 1349 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1552 ms. Remains : 235/235 places, 3008/3008 transitions.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 9 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:47:07] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:07] [INFO ] Invariant cache hit.
[2023-03-16 10:47:08] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-16 10:47:08] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:08] [INFO ] Invariant cache hit.
[2023-03-16 10:47:08] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:47:13] [INFO ] Implicit Places using invariants and state equation in 4991 ms returned []
Implicit Place search using SMT with State Equation took 5412 ms to find 0 implicit places.
[2023-03-16 10:47:13] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:13] [INFO ] Invariant cache hit.
[2023-03-16 10:47:14] [INFO ] Dead Transitions using invariants and state equation in 1355 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6777 ms. Remains : 235/235 places, 3008/3008 transitions.
Treatment of property DoubleLock-PT-p3s3-LTLFireability-10 finished in 38484 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 U G(p1)) U X(p0))||(F(p2)&&G(p3)))))'
Support contains 6 out of 235 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 8 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:47:14] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:14] [INFO ] Invariant cache hit.
[2023-03-16 10:47:15] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-16 10:47:15] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:15] [INFO ] Invariant cache hit.
[2023-03-16 10:47:15] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:47:20] [INFO ] Implicit Places using invariants and state equation in 5610 ms returned []
Implicit Place search using SMT with State Equation took 6031 ms to find 0 implicit places.
[2023-03-16 10:47:20] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:20] [INFO ] Invariant cache hit.
[2023-03-16 10:47:22] [INFO ] Dead Transitions using invariants and state equation in 1375 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7414 ms. Remains : 235/235 places, 3008/3008 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : DoubleLock-PT-p3s3-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 2}, { cond=p3, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s9 1) (GEQ s234 1)), p2:(AND (GEQ s62 1) (GEQ s197 1)), p0:(AND (GEQ s10 1) (GEQ s196 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 72 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p3s3-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s3-LTLFireability-12 finished in 7638 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((F(G(p0))||G((p1&&F(p2))))))'
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 8 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:47:22] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:22] [INFO ] Invariant cache hit.
[2023-03-16 10:47:22] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-16 10:47:22] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:22] [INFO ] Invariant cache hit.
[2023-03-16 10:47:23] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:47:27] [INFO ] Implicit Places using invariants and state equation in 4774 ms returned []
Implicit Place search using SMT with State Equation took 5187 ms to find 0 implicit places.
[2023-03-16 10:47:27] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:27] [INFO ] Invariant cache hit.
[2023-03-16 10:47:29] [INFO ] Dead Transitions using invariants and state equation in 1529 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6725 ms. Remains : 235/235 places, 3008/3008 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DoubleLock-PT-p3s3-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(OR (LT s71 1) (LT s200 1)), p0:(AND (GEQ s31 1) (GEQ s199 1)), p2:(OR (LT s185 1) (LT s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 860 steps with 10 reset in 7 ms.
FORMULA DoubleLock-PT-p3s3-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s3-LTLFireability-14 finished in 6918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 8 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:47:29] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:29] [INFO ] Invariant cache hit.
[2023-03-16 10:47:29] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-16 10:47:29] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:29] [INFO ] Invariant cache hit.
[2023-03-16 10:47:30] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:47:35] [INFO ] Implicit Places using invariants and state equation in 5645 ms returned []
Implicit Place search using SMT with State Equation took 6057 ms to find 0 implicit places.
[2023-03-16 10:47:35] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:35] [INFO ] Invariant cache hit.
[2023-03-16 10:47:36] [INFO ] Dead Transitions using invariants and state equation in 1406 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7472 ms. Remains : 235/235 places, 3008/3008 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s29 1) (GEQ s211 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p3s3-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s3-LTLFireability-15 finished in 7569 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(F(G((F(G((!(p1 U p2)||p0)))&&!p1))))))'
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))))'
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(F(p0))&&F(p1))))'
Found a Shortening insensitive property : DoubleLock-PT-p3s3-LTLFireability-10
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 22 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:47:37] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:37] [INFO ] Invariant cache hit.
[2023-03-16 10:47:37] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-16 10:47:37] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:37] [INFO ] Invariant cache hit.
[2023-03-16 10:47:38] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:47:42] [INFO ] Implicit Places using invariants and state equation in 4595 ms returned []
Implicit Place search using SMT with State Equation took 5013 ms to find 0 implicit places.
[2023-03-16 10:47:42] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:42] [INFO ] Invariant cache hit.
[2023-03-16 10:47:43] [INFO ] Dead Transitions using invariants and state equation in 1376 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6412 ms. Remains : 235/235 places, 3008/3008 transitions.
Running random walk in product with property : DoubleLock-PT-p3s3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s9 1) (LT s214 1)), p0:(OR (LT s0 1) (LT s192 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 26639 reset in 487 ms.
Product exploration explored 100000 steps with 26645 reset in 516 ms.
Computed a total of 9 stabilizing places and 960 stable transitions
Computed a total of 9 stabilizing places and 960 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-16 10:47:45] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:45] [INFO ] Invariant cache hit.
[2023-03-16 10:47:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:47:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 10:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 10:47:47] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2023-03-16 10:47:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 10:47:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:47:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 10:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 10:47:50] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2023-03-16 10:47:50] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:47:50] [INFO ] [Nat]Added 143 Read/Feed constraints in 155 ms returned sat
[2023-03-16 10:47:50] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 206 ms.
[2023-03-16 10:47:50] [INFO ] Added : 0 causal constraints over 0 iterations in 349 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 235 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 8 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:47:50] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:50] [INFO ] Invariant cache hit.
[2023-03-16 10:47:51] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-16 10:47:51] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:51] [INFO ] Invariant cache hit.
[2023-03-16 10:47:51] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:47:55] [INFO ] Implicit Places using invariants and state equation in 4876 ms returned []
Implicit Place search using SMT with State Equation took 5297 ms to find 0 implicit places.
[2023-03-16 10:47:55] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:55] [INFO ] Invariant cache hit.
[2023-03-16 10:47:57] [INFO ] Dead Transitions using invariants and state equation in 1859 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7165 ms. Remains : 235/235 places, 3008/3008 transitions.
Computed a total of 9 stabilizing places and 960 stable transitions
Computed a total of 9 stabilizing places and 960 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-16 10:47:58] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:47:58] [INFO ] Invariant cache hit.
[2023-03-16 10:48:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 10:48:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 10:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 10:48:01] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2023-03-16 10:48:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 10:48:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-16 10:48:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 10:48:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 10:48:03] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2023-03-16 10:48:03] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:48:03] [INFO ] [Nat]Added 143 Read/Feed constraints in 157 ms returned sat
[2023-03-16 10:48:04] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 215 ms.
[2023-03-16 10:48:04] [INFO ] Added : 0 causal constraints over 0 iterations in 360 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 26666 reset in 505 ms.
Product exploration explored 100000 steps with 26734 reset in 537 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 54 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:48:05] [INFO ] Redundant transitions in 114 ms returned []
[2023-03-16 10:48:05] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:48:05] [INFO ] Invariant cache hit.
[2023-03-16 10:48:07] [INFO ] Dead Transitions using invariants and state equation in 1335 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1516 ms. Remains : 235/235 places, 3008/3008 transitions.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 7 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2023-03-16 10:48:07] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:48:07] [INFO ] Invariant cache hit.
[2023-03-16 10:48:07] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-16 10:48:07] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:48:07] [INFO ] Invariant cache hit.
[2023-03-16 10:48:08] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-16 10:48:12] [INFO ] Implicit Places using invariants and state equation in 4816 ms returned []
Implicit Place search using SMT with State Equation took 5244 ms to find 0 implicit places.
[2023-03-16 10:48:12] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2023-03-16 10:48:12] [INFO ] Invariant cache hit.
[2023-03-16 10:48:14] [INFO ] Dead Transitions using invariants and state equation in 1794 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7046 ms. Remains : 235/235 places, 3008/3008 transitions.
Treatment of property DoubleLock-PT-p3s3-LTLFireability-10 finished in 37195 ms.
[2023-03-16 10:48:14] [INFO ] Flatten gal took : 121 ms
[2023-03-16 10:48:14] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-16 10:48:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 235 places, 3008 transitions and 12032 arcs took 26 ms.
Total runtime 284470 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1635/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1635/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1635/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DoubleLock-PT-p3s3-LTLFireability-01
Could not compute solution for formula : DoubleLock-PT-p3s3-LTLFireability-02
Could not compute solution for formula : DoubleLock-PT-p3s3-LTLFireability-10

BK_STOP 1678963697241

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DoubleLock-PT-p3s3-LTLFireability-01
ltl formula formula --ltl=/tmp/1635/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 235 places, 3008 transitions and 12032 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.330 real 0.090 user 0.120 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1635/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1635/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1635/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1635/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name DoubleLock-PT-p3s3-LTLFireability-02
ltl formula formula --ltl=/tmp/1635/ltl_1_
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 235 places, 3008 transitions and 12032 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.340 real 0.100 user 0.090 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1635/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1635/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1635/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1635/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name DoubleLock-PT-p3s3-LTLFireability-10
ltl formula formula --ltl=/tmp/1635/ltl_2_
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 235 places, 3008 transitions and 12032 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.330 real 0.090 user 0.110 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1635/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1635/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1635/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1635/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 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="DoubleLock-PT-p3s3"
export BK_EXAMINATION="LTLFireability"
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 DoubleLock-PT-p3s3, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r137-smll-167819418800564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p3s3.tgz
mv DoubleLock-PT-p3s3 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;