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.r101-tall-167814475400444.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 itstools
Input is DES-PT-30a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475400444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-30a-LTLFireability-00
FORMULA_NAME DES-PT-30a-LTLFireability-01
FORMULA_NAME DES-PT-30a-LTLFireability-02
FORMULA_NAME DES-PT-30a-LTLFireability-03
FORMULA_NAME DES-PT-30a-LTLFireability-04
FORMULA_NAME DES-PT-30a-LTLFireability-05
FORMULA_NAME DES-PT-30a-LTLFireability-06
FORMULA_NAME DES-PT-30a-LTLFireability-07
FORMULA_NAME DES-PT-30a-LTLFireability-08
FORMULA_NAME DES-PT-30a-LTLFireability-09
FORMULA_NAME DES-PT-30a-LTLFireability-10
FORMULA_NAME DES-PT-30a-LTLFireability-11
FORMULA_NAME DES-PT-30a-LTLFireability-12
FORMULA_NAME DES-PT-30a-LTLFireability-13
FORMULA_NAME DES-PT-30a-LTLFireability-14
FORMULA_NAME DES-PT-30a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678270399179

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 10:13:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 10:13:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 10:13:21] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-08 10:13:21] [INFO ] Transformed 234 places.
[2023-03-08 10:13:21] [INFO ] Transformed 191 transitions.
[2023-03-08 10:13:21] [INFO ] Found NUPN structural information;
[2023-03-08 10:13:21] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-30a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 177/177 transitions.
Applied a total of 0 rules in 26 ms. Remains 234 /234 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 234 cols
[2023-03-08 10:13:22] [INFO ] Computed 59 place invariants in 26 ms
[2023-03-08 10:13:23] [INFO ] Implicit Places using invariants in 328 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 354 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 233/234 places, 177/177 transitions.
Applied a total of 0 rules in 14 ms. Remains 233 /233 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 395 ms. Remains : 233/234 places, 177/177 transitions.
Support contains 52 out of 233 places after structural reductions.
[2023-03-08 10:13:23] [INFO ] Flatten gal took : 44 ms
[2023-03-08 10:13:23] [INFO ] Flatten gal took : 19 ms
[2023-03-08 10:13:23] [INFO ] Input system was already deterministic with 177 transitions.
Support contains 50 out of 233 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 223 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 31) seen :14
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 177 rows 233 cols
[2023-03-08 10:13:23] [INFO ] Computed 58 place invariants in 14 ms
[2023-03-08 10:13:24] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-08 10:13:24] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-08 10:13:24] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-08 10:13:24] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-08 10:13:24] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 28 ms returned sat
[2023-03-08 10:13:26] [INFO ] After 1839ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-08 10:13:26] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 3 ms to minimize.
[2023-03-08 10:13:26] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-08 10:13:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2023-03-08 10:13:28] [INFO ] After 4338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 2241 ms.
[2023-03-08 10:13:31] [INFO ] After 6918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 12 properties in 525 ms.
Support contains 12 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 177/177 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 233 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 232 transition count 174
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 232 transition count 174
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 232 transition count 174
Applied a total of 8 rules in 50 ms. Remains 232 /233 variables (removed 1) and now considering 174/177 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 232/233 places, 174/177 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 982560 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 982560 steps, saw 139154 distinct states, run finished after 3002 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 10:13:34] [INFO ] Computed 60 place invariants in 14 ms
[2023-03-08 10:13:35] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 10:13:35] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 10:13:35] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 10:13:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 10:13:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 54 ms returned sat
[2023-03-08 10:13:35] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 10:13:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:13:35] [INFO ] After 131ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 10:13:35] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
[2023-03-08 10:13:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-08 10:13:35] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-08 10:13:35] [INFO ] After 834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 189 ms.
Support contains 12 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-08 10:13:36] [INFO ] Invariant cache hit.
[2023-03-08 10:13:36] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-08 10:13:36] [INFO ] Invariant cache hit.
[2023-03-08 10:13:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:13:36] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2023-03-08 10:13:36] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-08 10:13:36] [INFO ] Invariant cache hit.
[2023-03-08 10:13:36] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 496 ms. Remains : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-08 10:13:36] [INFO ] Invariant cache hit.
[2023-03-08 10:13:36] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 10:13:36] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 10:13:36] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 10:13:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 10:13:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 68 ms returned sat
[2023-03-08 10:13:37] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 10:13:37] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2023-03-08 10:13:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-08 10:13:37] [INFO ] After 644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-08 10:13:37] [INFO ] After 980ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA DES-PT-30a-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 136 stabilizing places and 131 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(G(p0)))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 14 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 10:13:38] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 10:13:38] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 10:13:38] [INFO ] Invariant cache hit.
[2023-03-08 10:13:38] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2023-03-08 10:13:38] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 10:13:38] [INFO ] Invariant cache hit.
[2023-03-08 10:13:38] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 494 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s82 1) (EQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 2 ms.
FORMULA DES-PT-30a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-00 finished in 683 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(G(p0))||G(p1)))))'
Support contains 10 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 7 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 10:13:38] [INFO ] Invariant cache hit.
[2023-03-08 10:13:38] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-08 10:13:38] [INFO ] Invariant cache hit.
[2023-03-08 10:13:39] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2023-03-08 10:13:39] [INFO ] Invariant cache hit.
[2023-03-08 10:13:39] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-30a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s78 1) (EQ s148 1)), p0:(OR (EQ s191 0) (EQ s193 0) (EQ s195 0) (EQ s197 0) (EQ s199 0) (EQ s201 0) (EQ s203 0) (EQ s205 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2220 reset in 308 ms.
Product exploration explored 100000 steps with 2208 reset in 276 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 8 out of 232 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 10:13:40] [INFO ] Invariant cache hit.
[2023-03-08 10:13:40] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-08 10:13:40] [INFO ] Invariant cache hit.
[2023-03-08 10:13:40] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-08 10:13:40] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 10:13:40] [INFO ] Invariant cache hit.
[2023-03-08 10:13:40] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 448 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 86 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2233 reset in 219 ms.
Product exploration explored 100000 steps with 2247 reset in 334 ms.
Built C files in :
/tmp/ltsmin7376443211248667383
[2023-03-08 10:13:41] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2023-03-08 10:13:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:13:41] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2023-03-08 10:13:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:13:41] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2023-03-08 10:13:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:13:41] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7376443211248667383
Running compilation step : cd /tmp/ltsmin7376443211248667383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 458 ms.
Running link step : cd /tmp/ltsmin7376443211248667383;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7376443211248667383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6097418205290232347.hoa' '--buchi-type=spotba'
LTSmin run took 2920 ms.
FORMULA DES-PT-30a-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-30a-LTLFireability-01 finished in 6575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 231 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 175
Applied a total of 2 rules in 15 ms. Remains 231 /233 variables (removed 2) and now considering 175/177 (removed 2) transitions.
// Phase 1: matrix 175 rows 231 cols
[2023-03-08 10:13:45] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 10:13:45] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-08 10:13:45] [INFO ] Invariant cache hit.
[2023-03-08 10:13:45] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-08 10:13:45] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 10:13:45] [INFO ] Invariant cache hit.
[2023-03-08 10:13:45] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/233 places, 175/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 474 ms. Remains : 231/233 places, 175/177 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-30a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s21 1) (EQ s150 1) (EQ s152 1)), p0:(AND (EQ s25 1) (EQ s150 1) (EQ s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-02 finished in 523 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 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Applied a total of 0 rules in 3 ms. Remains 233 /233 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 233 cols
[2023-03-08 10:13:45] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 10:13:45] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-08 10:13:45] [INFO ] Invariant cache hit.
[2023-03-08 10:13:46] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2023-03-08 10:13:46] [INFO ] Invariant cache hit.
[2023-03-08 10:13:46] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 799 ms. Remains : 233/233 places, 177/177 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-30a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s151 1) (EQ s153 1)), p0:(OR (EQ s156 0) (EQ s225 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 381 ms.
Product exploration explored 100000 steps with 33333 reset in 354 ms.
Computed a total of 136 stabilizing places and 131 stable transitions
Computed a total of 136 stabilizing places and 131 stable transitions
Detected a total of 136/233 stabilizing places and 131/177 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-03 finished in 1750 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(F(p0)) U p1)))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 11 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 10:13:47] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 10:13:47] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-08 10:13:47] [INFO ] Invariant cache hit.
[2023-03-08 10:13:47] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-03-08 10:13:47] [INFO ] Invariant cache hit.
[2023-03-08 10:13:48] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s66 1) (EQ s148 1)), p0:(AND (EQ s170 1) (EQ s187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 106 steps with 1 reset in 1 ms.
FORMULA DES-PT-30a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-04 finished in 653 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)))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 19 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 10:13:48] [INFO ] Invariant cache hit.
[2023-03-08 10:13:48] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-08 10:13:48] [INFO ] Invariant cache hit.
[2023-03-08 10:13:48] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-08 10:13:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:13:48] [INFO ] Invariant cache hit.
[2023-03-08 10:13:48] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 462 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s115 1) (EQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA DES-PT-30a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-05 finished in 651 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(!((!p1 U p2)&&p0)) U X(p1)))'
Support contains 6 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 11 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 10:13:48] [INFO ] Invariant cache hit.
[2023-03-08 10:13:48] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-08 10:13:48] [INFO ] Invariant cache hit.
[2023-03-08 10:13:49] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-08 10:13:49] [INFO ] Invariant cache hit.
[2023-03-08 10:13:49] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 450 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (EQ s214 1) (EQ s228 1)), p0:(AND (EQ s152 1) (EQ s224 1)), p2:(AND (EQ s48 1) (EQ s227 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9486 reset in 246 ms.
Product exploration explored 100000 steps with 9479 reset in 264 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 378 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 10:13:50] [INFO ] Invariant cache hit.
[2023-03-08 10:13:50] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 10:13:50] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-08 10:13:50] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 10:13:50] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 10:13:50] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 35 ms returned sat
[2023-03-08 10:13:51] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 10:13:51] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-08 10:13:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-08 10:13:51] [INFO ] After 285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-08 10:13:51] [INFO ] After 451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 50 ms.
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 232 transition count 174
Applied a total of 8 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1047772 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1047772 steps, saw 147642 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 10:13:54] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 10:13:54] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:13:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 10:13:54] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 10:13:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:13:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 78 ms returned sat
[2023-03-08 10:13:54] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 10:13:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 10:13:54] [INFO ] After 68ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 10:13:54] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2023-03-08 10:13:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-08 10:13:55] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2023-03-08 10:13:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-08 10:13:55] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-08 10:13:55] [INFO ] After 640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 60 ms.
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-08 10:13:55] [INFO ] Invariant cache hit.
[2023-03-08 10:13:55] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 10:13:55] [INFO ] Invariant cache hit.
[2023-03-08 10:13:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 10:13:55] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-08 10:13:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:13:55] [INFO ] Invariant cache hit.
[2023-03-08 10:13:55] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 512 ms. Remains : 232/232 places, 174/174 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 174
Applied a total of 1 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 10:13:55] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 10:13:55] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:13:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 10:13:55] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 10:13:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:13:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 78 ms returned sat
[2023-03-08 10:13:56] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 10:13:56] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-08 10:13:56] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 11 factoid took 461 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 10:13:57] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 10:13:57] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2023-03-08 10:13:57] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 16 ms returned sat
[2023-03-08 10:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:13:57] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2023-03-08 10:13:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:13:57] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-08 10:13:57] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 89 ms returned sat
[2023-03-08 10:13:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:13:58] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2023-03-08 10:13:58] [INFO ] Computed and/alt/rep : 168/504/168 causal constraints (skipped 7 transitions) in 16 ms.
[2023-03-08 10:13:59] [INFO ] Added : 130 causal constraints over 26 iterations in 751 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 10:13:59] [INFO ] Invariant cache hit.
[2023-03-08 10:13:59] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-08 10:13:59] [INFO ] Invariant cache hit.
[2023-03-08 10:13:59] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-08 10:13:59] [INFO ] Invariant cache hit.
[2023-03-08 10:13:59] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 428 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 667 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 220 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 46 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 48 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 10:14:00] [INFO ] Invariant cache hit.
[2023-03-08 10:14:00] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 10:14:00] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-08 10:14:00] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 10:14:00] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 10:14:00] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 25 ms returned sat
[2023-03-08 10:14:00] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 10:14:00] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-08 10:14:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-08 10:14:00] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-08 10:14:00] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 49 ms.
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 232 transition count 174
Applied a total of 8 rules in 12 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1146465 steps, run timeout after 3001 ms. (steps per millisecond=382 ) properties seen :{}
Probabilistic random walk after 1146465 steps, saw 160666 distinct states, run finished after 3001 ms. (steps per millisecond=382 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 10:14:04] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 10:14:04] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:14:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 10:14:04] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 10:14:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:14:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 80 ms returned sat
[2023-03-08 10:14:04] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 10:14:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 10:14:04] [INFO ] After 66ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 10:14:04] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2023-03-08 10:14:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-08 10:14:04] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2023-03-08 10:14:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-08 10:14:04] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-08 10:14:04] [INFO ] After 633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 ms.
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-08 10:14:04] [INFO ] Invariant cache hit.
[2023-03-08 10:14:05] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-08 10:14:05] [INFO ] Invariant cache hit.
[2023-03-08 10:14:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 10:14:05] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-08 10:14:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:14:05] [INFO ] Invariant cache hit.
[2023-03-08 10:14:05] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 507 ms. Remains : 232/232 places, 174/174 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 174
Applied a total of 1 rules in 16 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 10:14:05] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 10:14:05] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:14:05] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-08 10:14:05] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 10:14:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:14:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 79 ms returned sat
[2023-03-08 10:14:05] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 10:14:05] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-08 10:14:06] [INFO ] After 455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 11 factoid took 475 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 10:14:06] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 10:14:06] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-08 10:14:06] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-08 10:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:07] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2023-03-08 10:14:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:07] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-08 10:14:07] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 98 ms returned sat
[2023-03-08 10:14:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:07] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2023-03-08 10:14:08] [INFO ] Computed and/alt/rep : 168/504/168 causal constraints (skipped 7 transitions) in 11 ms.
[2023-03-08 10:14:08] [INFO ] Added : 130 causal constraints over 26 iterations in 769 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
Product exploration explored 100000 steps with 9507 reset in 241 ms.
Product exploration explored 100000 steps with 9481 reset in 258 ms.
Applying partial POR strategy [true, true, true, false]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 25 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 10:14:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:14:09] [INFO ] Invariant cache hit.
[2023-03-08 10:14:09] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin14755091196877355988
[2023-03-08 10:14:09] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14755091196877355988
Running compilation step : cd /tmp/ltsmin14755091196877355988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 347 ms.
Running link step : cd /tmp/ltsmin14755091196877355988;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14755091196877355988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7421966135959728841.hoa' '--buchi-type=spotba'
LTSmin run took 299 ms.
FORMULA DES-PT-30a-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-30a-LTLFireability-06 finished in 21675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 24 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 10:14:10] [INFO ] Invariant cache hit.
[2023-03-08 10:14:10] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-08 10:14:10] [INFO ] Invariant cache hit.
[2023-03-08 10:14:10] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-08 10:14:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:14:10] [INFO ] Invariant cache hit.
[2023-03-08 10:14:10] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 419 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s151 1) (EQ s153 1)), p1:(OR (NEQ s109 1) (NEQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-07 finished in 539 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((G(p1)||p0))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 13 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 10:14:11] [INFO ] Invariant cache hit.
[2023-03-08 10:14:11] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-08 10:14:11] [INFO ] Invariant cache hit.
[2023-03-08 10:14:11] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-08 10:14:11] [INFO ] Invariant cache hit.
[2023-03-08 10:14:11] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-30a-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=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s11 1) (EQ s151 1) (EQ s153 1)), p0:(OR (EQ s71 0) (EQ s148 0) (AND (EQ s11 1) (EQ s151 1) (EQ s153 1) (EQ s71 1) (EQ s148 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2237 reset in 223 ms.
Product exploration explored 100000 steps with 2226 reset in 246 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 409 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 989070 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 989070 steps, saw 141310 distinct states, run finished after 3001 ms. (steps per millisecond=329 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 10:14:15] [INFO ] Invariant cache hit.
[2023-03-08 10:14:16] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 10:14:16] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-08 10:14:16] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 10:14:16] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 10:14:16] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 26 ms returned sat
[2023-03-08 10:14:16] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-08 10:14:16] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-08 10:14:16] [INFO ] After 507ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 54 ms.
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 232 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 231 transition count 173
Applied a total of 9 rules in 13 ms. Remains 231 /232 variables (removed 1) and now considering 173/176 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 231/232 places, 173/176 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1632211 steps, run timeout after 3001 ms. (steps per millisecond=543 ) properties seen :{}
Probabilistic random walk after 1632211 steps, saw 229062 distinct states, run finished after 3001 ms. (steps per millisecond=543 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 231 cols
[2023-03-08 10:14:19] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 10:14:19] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:14:19] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 10:14:19] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:14:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:14:19] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 65 ms returned sat
[2023-03-08 10:14:19] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:14:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:14:19] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:14:19] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 10:14:19] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1105 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=221 )
Parikh walk visited 1 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 12 factoid took 422 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 10:14:20] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 10:14:20] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-08 10:14:20] [INFO ] Invariant cache hit.
[2023-03-08 10:14:20] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-08 10:14:20] [INFO ] Invariant cache hit.
[2023-03-08 10:14:21] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 220 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1795187 steps, run timeout after 3001 ms. (steps per millisecond=598 ) properties seen :{}
Probabilistic random walk after 1795187 steps, saw 243614 distinct states, run finished after 3002 ms. (steps per millisecond=597 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:14:24] [INFO ] Invariant cache hit.
[2023-03-08 10:14:24] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:14:24] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-08 10:14:24] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 26 ms returned sat
[2023-03-08 10:14:24] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:14:24] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-08 10:14:24] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 232 transition count 174
Applied a total of 7 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1739133 steps, run timeout after 3001 ms. (steps per millisecond=579 ) properties seen :{}
Probabilistic random walk after 1739133 steps, saw 242707 distinct states, run finished after 3001 ms. (steps per millisecond=579 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 10:14:27] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 10:14:27] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:14:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 10:14:27] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 87 ms returned sat
[2023-03-08 10:14:28] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:14:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:14:28] [INFO ] After 39ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:14:28] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-08 10:14:28] [INFO ] After 416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-08 10:14:28] [INFO ] Invariant cache hit.
[2023-03-08 10:14:28] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-08 10:14:28] [INFO ] Invariant cache hit.
[2023-03-08 10:14:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:14:28] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-08 10:14:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:14:28] [INFO ] Invariant cache hit.
[2023-03-08 10:14:28] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 576 ms. Remains : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 10:14:28] [INFO ] Invariant cache hit.
[2023-03-08 10:14:28] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:14:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:14:28] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 93 ms returned sat
[2023-03-08 10:14:29] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:14:29] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 10:14:29] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2226 reset in 215 ms.
Product exploration explored 100000 steps with 2220 reset in 229 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 10:14:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 10:14:30] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 10:14:30] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin10817418472898449079
[2023-03-08 10:14:30] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10817418472898449079
Running compilation step : cd /tmp/ltsmin10817418472898449079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 310 ms.
Running link step : cd /tmp/ltsmin10817418472898449079;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10817418472898449079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12057023982746636926.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 10:14:45] [INFO ] Invariant cache hit.
[2023-03-08 10:14:45] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-08 10:14:45] [INFO ] Invariant cache hit.
[2023-03-08 10:14:45] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-08 10:14:45] [INFO ] Invariant cache hit.
[2023-03-08 10:14:45] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 440 ms. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin12619138059327839096
[2023-03-08 10:14:45] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12619138059327839096
Running compilation step : cd /tmp/ltsmin12619138059327839096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 313 ms.
Running link step : cd /tmp/ltsmin12619138059327839096;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12619138059327839096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11656170660368063322.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 10:15:01] [INFO ] Flatten gal took : 16 ms
[2023-03-08 10:15:01] [INFO ] Flatten gal took : 16 ms
[2023-03-08 10:15:01] [INFO ] Time to serialize gal into /tmp/LTL10610669550848889636.gal : 3 ms
[2023-03-08 10:15:01] [INFO ] Time to serialize properties into /tmp/LTL9176377518675226580.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10610669550848889636.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7252675319230415597.hoa' '-atoms' '/tmp/LTL9176377518675226580.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9176377518675226580.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7252675319230415597.hoa
Detected timeout of ITS tools.
[2023-03-08 10:15:16] [INFO ] Flatten gal took : 15 ms
[2023-03-08 10:15:16] [INFO ] Flatten gal took : 14 ms
[2023-03-08 10:15:16] [INFO ] Time to serialize gal into /tmp/LTL14094919114461830881.gal : 3 ms
[2023-03-08 10:15:16] [INFO ] Time to serialize properties into /tmp/LTL8842171049234758271.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14094919114461830881.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8842171049234758271.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p71==0)||(p149==0))")||((G("(((p11==1)&&(p152==1))&&(p154==1))"))||("((((p11==1)&&(p152==1))&&((p154==1)&&(p71==1)))&&(p149...167
Formula 0 simplified : XF(!"((((p11==1)&&(p152==1))&&((p154==1)&&(p71==1)))&&(p149==1))" & !"((p71==0)||(p149==0))" & F!"(((p11==1)&&(p152==1))&&(p154==1))...157
Detected timeout of ITS tools.
[2023-03-08 10:15:31] [INFO ] Flatten gal took : 19 ms
[2023-03-08 10:15:31] [INFO ] Applying decomposition
[2023-03-08 10:15:31] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3615385220391238634.txt' '-o' '/tmp/graph3615385220391238634.bin' '-w' '/tmp/graph3615385220391238634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3615385220391238634.bin' '-l' '-1' '-v' '-w' '/tmp/graph3615385220391238634.weights' '-q' '0' '-e' '0.001'
[2023-03-08 10:15:31] [INFO ] Decomposing Gal with order
[2023-03-08 10:15:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 10:15:31] [INFO ] Removed a total of 13 redundant transitions.
[2023-03-08 10:15:31] [INFO ] Flatten gal took : 41 ms
[2023-03-08 10:15:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-08 10:15:31] [INFO ] Time to serialize gal into /tmp/LTL1289274780248078265.gal : 5 ms
[2023-03-08 10:15:31] [INFO ] Time to serialize properties into /tmp/LTL2235942572526313535.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1289274780248078265.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2235942572526313535.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("((u12.p71==0)||(u12.p149==0))")||((G("(((u13.p11==1)&&(u13.p152==1))&&(u13.p154==1))"))||("((((u13.p11==1)&&(u13.p152==1))&&(...207
Formula 0 simplified : XF(!"((((u13.p11==1)&&(u13.p152==1))&&((u13.p154==1)&&(u12.p71==1)))&&(u12.p149==1))" & !"((u12.p71==0)||(u12.p149==0))" & F!"(((u13...197
Reverse transition relation is NOT exact ! Due to transitions t1, t136, t137, t170, u12.t129, u13.t11, u46.t5, u46.t40, i0.i0.t0, i0.i0.t168, i0.i0.t174, i...629
Computing Next relation with stutter on 1.99965e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17763568225161985545
[2023-03-08 10:15:46] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17763568225161985545
Running compilation step : cd /tmp/ltsmin17763568225161985545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 317 ms.
Running link step : cd /tmp/ltsmin17763568225161985545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17763568225161985545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30a-LTLFireability-09 finished in 110587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 7 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 8 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 10:16:01] [INFO ] Invariant cache hit.
[2023-03-08 10:16:01] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-08 10:16:01] [INFO ] Invariant cache hit.
[2023-03-08 10:16:02] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-03-08 10:16:02] [INFO ] Invariant cache hit.
[2023-03-08 10:16:02] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-30a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s19 0) (EQ s151 0) (EQ s153 0) (EQ s131 0) (EQ s138 0)), p0:(AND (EQ s130 1) (EQ s223 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 327 ms.
Product exploration explored 100000 steps with 33333 reset in 332 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-10 finished in 1557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 7 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 10:16:03] [INFO ] Invariant cache hit.
[2023-03-08 10:16:03] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-08 10:16:03] [INFO ] Invariant cache hit.
[2023-03-08 10:16:03] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-08 10:16:03] [INFO ] Invariant cache hit.
[2023-03-08 10:16:03] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 449 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s141 1) (EQ s143 1)), p1:(OR (EQ s141 0) (EQ s143 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 37 steps with 0 reset in 1 ms.
FORMULA DES-PT-30a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-12 finished in 541 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(p0)||G(p1))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 8 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 10:16:03] [INFO ] Invariant cache hit.
[2023-03-08 10:16:03] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-08 10:16:03] [INFO ] Invariant cache hit.
[2023-03-08 10:16:04] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-08 10:16:04] [INFO ] Invariant cache hit.
[2023-03-08 10:16:04] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 451 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s21 1) (EQ s151 1) (EQ s153 1)), p1:(AND (EQ s121 1) (EQ s133 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-13 finished in 571 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(p0)||G(p1))))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 6 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 10:16:04] [INFO ] Invariant cache hit.
[2023-03-08 10:16:04] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-08 10:16:04] [INFO ] Invariant cache hit.
[2023-03-08 10:16:04] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-08 10:16:04] [INFO ] Invariant cache hit.
[2023-03-08 10:16:04] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s117 0) (EQ s124 0)), p1:(OR (NEQ s117 1) (NEQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 421 ms.
Product exploration explored 100000 steps with 50000 reset in 438 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 134 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-14 finished in 1553 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(G((p2 U X(p3))))&&p1))&&p0)))'
Support contains 7 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 4 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 10:16:05] [INFO ] Invariant cache hit.
[2023-03-08 10:16:05] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-08 10:16:06] [INFO ] Invariant cache hit.
[2023-03-08 10:16:06] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-08 10:16:06] [INFO ] Invariant cache hit.
[2023-03-08 10:16:06] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p3)), true, (OR (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : DES-PT-30a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 5}, { cond=p2, acceptance={0} source=4 dest: 6}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s115 1) (EQ s124 1)), p1:(AND (EQ s98 1) (EQ s124 1)), p2:(AND (EQ s162 1) (EQ s179 1)), p3:(AND (EQ s208 1) (EQ s211 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-15 finished in 712 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((G(p1)||p0))))'
Found a Lengthening insensitive property : DES-PT-30a-LTLFireability-09
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 13 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 10:16:06] [INFO ] Invariant cache hit.
[2023-03-08 10:16:06] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-08 10:16:06] [INFO ] Invariant cache hit.
[2023-03-08 10:16:07] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-08 10:16:07] [INFO ] Invariant cache hit.
[2023-03-08 10:16:07] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 481 ms. Remains : 232/233 places, 176/177 transitions.
Running random walk in product with property : DES-PT-30a-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=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s11 1) (EQ s151 1) (EQ s153 1)), p0:(OR (EQ s71 0) (EQ s148 0) (AND (EQ s11 1) (EQ s151 1) (EQ s153 1) (EQ s71 1) (EQ s148 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2225 reset in 218 ms.
Product exploration explored 100000 steps with 2226 reset in 246 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 409 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 878685 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :{}
Probabilistic random walk after 878685 steps, saw 129477 distinct states, run finished after 3001 ms. (steps per millisecond=292 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 10:16:11] [INFO ] Invariant cache hit.
[2023-03-08 10:16:11] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 10:16:11] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-08 10:16:11] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 10:16:11] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 10:16:11] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 26 ms returned sat
[2023-03-08 10:16:12] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-08 10:16:12] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-08 10:16:12] [INFO ] After 508ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 232 transition count 174
Applied a total of 7 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 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 24 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1079223 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :{}
Probabilistic random walk after 1079223 steps, saw 151363 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 10:16:15] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 10:16:15] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:16:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 10:16:15] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 10:16:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:16:15] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 84 ms returned sat
[2023-03-08 10:16:16] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 10:16:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:16:16] [INFO ] After 78ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 10:16:16] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-08 10:16:16] [INFO ] After 628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 64 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-08 10:16:16] [INFO ] Invariant cache hit.
[2023-03-08 10:16:16] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-08 10:16:16] [INFO ] Invariant cache hit.
[2023-03-08 10:16:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:16:16] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-08 10:16:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:16:16] [INFO ] Invariant cache hit.
[2023-03-08 10:16:16] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 506 ms. Remains : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-08 10:16:16] [INFO ] Invariant cache hit.
[2023-03-08 10:16:16] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:16:16] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 10:16:16] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 10:16:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:16:17] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 93 ms returned sat
[2023-03-08 10:16:17] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 10:16:17] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2023-03-08 10:16:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-08 10:16:17] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-08 10:16:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-08 10:16:17] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-08 10:16:17] [INFO ] After 583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 381 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 10:16:18] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 10:16:18] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-08 10:16:18] [INFO ] Invariant cache hit.
[2023-03-08 10:16:18] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-08 10:16:18] [INFO ] Invariant cache hit.
[2023-03-08 10:16:18] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1690481 steps, run timeout after 3001 ms. (steps per millisecond=563 ) properties seen :{}
Probabilistic random walk after 1690481 steps, saw 231190 distinct states, run finished after 3001 ms. (steps per millisecond=563 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:16:21] [INFO ] Invariant cache hit.
[2023-03-08 10:16:21] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:16:21] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 10:16:21] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 26 ms returned sat
[2023-03-08 10:16:22] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:16:22] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 10:16:22] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 232 transition count 174
Applied a total of 7 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 144 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1751950 steps, run timeout after 3001 ms. (steps per millisecond=583 ) properties seen :{}
Probabilistic random walk after 1751950 steps, saw 244678 distinct states, run finished after 3001 ms. (steps per millisecond=583 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 10:16:25] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 10:16:25] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:16:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:16:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 85 ms returned sat
[2023-03-08 10:16:25] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:16:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:16:25] [INFO ] After 41ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:16:25] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-08 10:16:25] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-08 10:16:25] [INFO ] Invariant cache hit.
[2023-03-08 10:16:25] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-08 10:16:25] [INFO ] Invariant cache hit.
[2023-03-08 10:16:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:16:26] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-08 10:16:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:16:26] [INFO ] Invariant cache hit.
[2023-03-08 10:16:26] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 487 ms. Remains : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 10:16:26] [INFO ] Invariant cache hit.
[2023-03-08 10:16:26] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:16:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:16:26] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 92 ms returned sat
[2023-03-08 10:16:26] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:16:26] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 10:16:26] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2249 reset in 205 ms.
Product exploration explored 100000 steps with 2225 reset in 234 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 10:16:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 10:16:27] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 10:16:27] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin17423870231507206436
[2023-03-08 10:16:27] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17423870231507206436
Running compilation step : cd /tmp/ltsmin17423870231507206436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 304 ms.
Running link step : cd /tmp/ltsmin17423870231507206436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17423870231507206436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10501297089637430184.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 10:16:42] [INFO ] Invariant cache hit.
[2023-03-08 10:16:42] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-08 10:16:42] [INFO ] Invariant cache hit.
[2023-03-08 10:16:43] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-08 10:16:43] [INFO ] Invariant cache hit.
[2023-03-08 10:16:43] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin13233905228518666585
[2023-03-08 10:16:43] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13233905228518666585
Running compilation step : cd /tmp/ltsmin13233905228518666585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 328 ms.
Running link step : cd /tmp/ltsmin13233905228518666585;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13233905228518666585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5877232117002264660.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 10:16:58] [INFO ] Flatten gal took : 19 ms
[2023-03-08 10:16:58] [INFO ] Flatten gal took : 12 ms
[2023-03-08 10:16:58] [INFO ] Time to serialize gal into /tmp/LTL9562831416053208297.gal : 2 ms
[2023-03-08 10:16:58] [INFO ] Time to serialize properties into /tmp/LTL14217445001135887408.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9562831416053208297.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13755899109043328883.hoa' '-atoms' '/tmp/LTL14217445001135887408.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14217445001135887408.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13755899109043328883.hoa
Detected timeout of ITS tools.
[2023-03-08 10:17:13] [INFO ] Flatten gal took : 12 ms
[2023-03-08 10:17:13] [INFO ] Flatten gal took : 11 ms
[2023-03-08 10:17:13] [INFO ] Time to serialize gal into /tmp/LTL8950419762443972481.gal : 2 ms
[2023-03-08 10:17:13] [INFO ] Time to serialize properties into /tmp/LTL17849726578703907787.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8950419762443972481.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17849726578703907787.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p71==0)||(p149==0))")||((G("(((p11==1)&&(p152==1))&&(p154==1))"))||("((((p11==1)&&(p152==1))&&((p154==1)&&(p71==1)))&&(p149...167
Formula 0 simplified : XF(!"((((p11==1)&&(p152==1))&&((p154==1)&&(p71==1)))&&(p149==1))" & !"((p71==0)||(p149==0))" & F!"(((p11==1)&&(p152==1))&&(p154==1))...157
Detected timeout of ITS tools.
[2023-03-08 10:17:28] [INFO ] Flatten gal took : 11 ms
[2023-03-08 10:17:28] [INFO ] Applying decomposition
[2023-03-08 10:17:28] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7618919917844958358.txt' '-o' '/tmp/graph7618919917844958358.bin' '-w' '/tmp/graph7618919917844958358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7618919917844958358.bin' '-l' '-1' '-v' '-w' '/tmp/graph7618919917844958358.weights' '-q' '0' '-e' '0.001'
[2023-03-08 10:17:28] [INFO ] Decomposing Gal with order
[2023-03-08 10:17:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 10:17:28] [INFO ] Removed a total of 38 redundant transitions.
[2023-03-08 10:17:28] [INFO ] Flatten gal took : 22 ms
[2023-03-08 10:17:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 6 ms.
[2023-03-08 10:17:28] [INFO ] Time to serialize gal into /tmp/LTL15723548354216926473.gal : 7 ms
[2023-03-08 10:17:28] [INFO ] Time to serialize properties into /tmp/LTL10919292803039077074.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15723548354216926473.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10919292803039077074.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("((u13.p71==0)||(u13.p149==0))")||((G("(((i3.u15.p11==1)&&(i3.u14.p152==1))&&(i3.u15.p154==1))"))||("((((i3.u15.p11==1)&&(i3.u...225
Formula 0 simplified : XF(!"((((i3.u15.p11==1)&&(i3.u14.p152==1))&&((i3.u15.p154==1)&&(u13.p71==1)))&&(u13.p149==1))" & !"((u13.p71==0)||(u13.p149==0))" & ...215
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9359323474966807579
[2023-03-08 10:17:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9359323474966807579
Running compilation step : cd /tmp/ltsmin9359323474966807579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 303 ms.
Running link step : cd /tmp/ltsmin9359323474966807579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9359323474966807579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30a-LTLFireability-09 finished in 112229 ms.
[2023-03-08 10:17:58] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
[2023-03-08 10:17:58] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin7792964538263335248
[2023-03-08 10:17:58] [INFO ] Flatten gal took : 8 ms
[2023-03-08 10:17:58] [INFO ] Computing symmetric may disable matrix : 177 transitions.
[2023-03-08 10:17:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:17:58] [INFO ] Computing symmetric may enable matrix : 177 transitions.
[2023-03-08 10:17:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:17:58] [INFO ] Computing Do-Not-Accords matrix : 177 transitions.
[2023-03-08 10:17:58] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:17:58] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7792964538263335248
Running compilation step : cd /tmp/ltsmin7792964538263335248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5226440212631123076.txt' '-o' '/tmp/graph5226440212631123076.bin' '-w' '/tmp/graph5226440212631123076.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5226440212631123076.bin' '-l' '-1' '-v' '-w' '/tmp/graph5226440212631123076.weights' '-q' '0' '-e' '0.001'
[2023-03-08 10:17:58] [INFO ] Decomposing Gal with order
[2023-03-08 10:17:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 10:17:58] [INFO ] Removed a total of 15 redundant transitions.
[2023-03-08 10:17:58] [INFO ] Flatten gal took : 13 ms
[2023-03-08 10:17:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2023-03-08 10:17:58] [INFO ] Time to serialize gal into /tmp/LTLFireability4984876127078884898.gal : 3 ms
[2023-03-08 10:17:58] [INFO ] Time to serialize properties into /tmp/LTLFireability7130240518115452897.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4984876127078884898.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7130240518115452897.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((u13.p71==0)||(u13.p149==0))")||(("((((u14.p11==1)&&(u14.p152==1))&&((u14.p154==1)&&(u13.p71==1)))&&(u13.p149==1))")||(G("((...207
Formula 0 simplified : XF(!"((((u14.p11==1)&&(u14.p152==1))&&((u14.p154==1)&&(u13.p71==1)))&&(u13.p149==1))" & !"((u13.p71==0)||(u13.p149==0))" & F!"(((u14...197
Compilation finished in 370 ms.
Running link step : cd /tmp/ltsmin7792964538263335248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7792964538263335248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t136, t137, t170, u13.t129, u14.t11, u48.t5, u48.t40, i0.i0.t0, i0.i0.t168, i0.i0.t174, i...639
Computing Next relation with stutter on 2.19322e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
30494 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,304.963,2948008,1,0,9.44e+06,88471,855,5.73092e+06,1096,556535,12934182
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DES-PT-30a-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1020023 ms.

BK_STOP 1678271422566

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-30a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DES-PT-30a, 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 r101-tall-167814475400444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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