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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 11:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b032-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b032-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678505547153

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b032
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:32:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:32:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:32:28] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-11 03:32:28] [INFO ] Transformed 306 places.
[2023-03-11 03:32:28] [INFO ] Transformed 840 transitions.
[2023-03-11 03:32:28] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 380 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 84 places in 4 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b032-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 34 place count 188 transition count 510
Iterating global reduction 1 with 24 rules applied. Total rules applied 58 place count 188 transition count 510
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 90 place count 188 transition count 478
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 103 place count 175 transition count 452
Iterating global reduction 2 with 13 rules applied. Total rules applied 116 place count 175 transition count 452
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 122 place count 169 transition count 440
Iterating global reduction 2 with 6 rules applied. Total rules applied 128 place count 169 transition count 440
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 132 place count 165 transition count 424
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 165 transition count 424
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 139 place count 162 transition count 418
Iterating global reduction 2 with 3 rules applied. Total rules applied 142 place count 162 transition count 418
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 144 place count 160 transition count 410
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 160 transition count 410
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 159 transition count 406
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 159 transition count 406
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 158 transition count 404
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 158 transition count 404
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 157 transition count 402
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 157 transition count 402
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 156 transition count 400
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 156 transition count 400
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 155 transition count 398
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 155 transition count 398
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 154 transition count 396
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 154 transition count 396
Applied a total of 158 rules in 81 ms. Remains 154 /222 variables (removed 68) and now considering 396/648 (removed 252) transitions.
[2023-03-11 03:32:29] [INFO ] Flow matrix only has 267 transitions (discarded 129 similar events)
// Phase 1: matrix 267 rows 154 cols
[2023-03-11 03:32:29] [INFO ] Computed 2 place invariants in 27 ms
[2023-03-11 03:32:29] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-11 03:32:29] [INFO ] Flow matrix only has 267 transitions (discarded 129 similar events)
[2023-03-11 03:32:29] [INFO ] Invariant cache hit.
[2023-03-11 03:32:29] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-11 03:32:29] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2023-03-11 03:32:29] [INFO ] Flow matrix only has 267 transitions (discarded 129 similar events)
[2023-03-11 03:32:29] [INFO ] Invariant cache hit.
[2023-03-11 03:32:29] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/222 places, 396/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 832 ms. Remains : 154/222 places, 396/648 transitions.
Support contains 26 out of 154 places after structural reductions.
[2023-03-11 03:32:30] [INFO ] Flatten gal took : 47 ms
[2023-03-11 03:32:30] [INFO ] Flatten gal took : 28 ms
[2023-03-11 03:32:30] [INFO ] Input system was already deterministic with 396 transitions.
Support contains 25 out of 154 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10009 steps, including 7 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :2
Running SMT prover for 3 properties.
[2023-03-11 03:32:30] [INFO ] Flow matrix only has 267 transitions (discarded 129 similar events)
[2023-03-11 03:32:30] [INFO ] Invariant cache hit.
[2023-03-11 03:32:30] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-11 03:32:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 03:32:30] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-11 03:32:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:32:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:32:31] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-11 03:32:31] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-11 03:32:31] [INFO ] After 30ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-11 03:32:31] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-11 03:32:31] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 396/396 transitions.
Graph (complete) has 621 edges and 154 vertex of which 130 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 130 transition count 348
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 121 transition count 318
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 121 transition count 318
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 75 place count 121 transition count 310
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 82 place count 114 transition count 294
Iterating global reduction 2 with 7 rules applied. Total rules applied 89 place count 114 transition count 294
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 93 place count 114 transition count 290
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 98 place count 109 transition count 272
Iterating global reduction 3 with 5 rules applied. Total rules applied 103 place count 109 transition count 272
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 108 place count 104 transition count 256
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 104 transition count 256
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 118 place count 99 transition count 246
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 99 transition count 246
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 128 place count 94 transition count 236
Iterating global reduction 3 with 5 rules applied. Total rules applied 133 place count 94 transition count 236
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 90 transition count 228
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 90 transition count 228
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 86 transition count 220
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 86 transition count 220
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 152 place count 83 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 83 transition count 214
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 83 transition count 210
Applied a total of 159 rules in 101 ms. Remains 83 /154 variables (removed 71) and now considering 210/396 (removed 186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 83/154 places, 210/396 transitions.
Finished random walk after 6960 steps, including 2 resets, run visited all 1 properties in 14 ms. (steps per millisecond=497 )
FORMULA FunctionPointer-PT-b032-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA FunctionPointer-PT-b032-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 64 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' '!(X(F((G(!p0)||(!p0&&G(F(!p1)))))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 396/396 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 370
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 146 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 140 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 140 transition count 348
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 140 transition count 344
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 136 transition count 330
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 136 transition count 330
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 132 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 132 transition count 314
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 128 transition count 304
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 128 transition count 304
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 124 transition count 296
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 124 transition count 296
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 120 transition count 288
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 84 place count 116 transition count 280
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 116 transition count 280
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 112 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 112 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 111 transition count 270
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 111 transition count 270
Applied a total of 98 rules in 21 ms. Remains 111 /154 variables (removed 43) and now considering 270/396 (removed 126) transitions.
[2023-03-11 03:32:31] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
// Phase 1: matrix 184 rows 111 cols
[2023-03-11 03:32:31] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:32:31] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-11 03:32:31] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2023-03-11 03:32:31] [INFO ] Invariant cache hit.
[2023-03-11 03:32:31] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 03:32:31] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-11 03:32:31] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2023-03-11 03:32:31] [INFO ] Invariant cache hit.
[2023-03-11 03:32:32] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/154 places, 270/396 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 368 ms. Remains : 111/154 places, 270/396 transitions.
Stuttering acceptance computed with spot in 322 ms :[p0, (AND p1 p0), (AND p1 p0), p0, p0]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p1:(AND (GEQ s1 1) (GEQ s98 1)), p0:(AND (GEQ s1 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 962 reset in 417 ms.
Product exploration explored 100000 steps with 945 reset in 325 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:32:33] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2023-03-11 03:32:33] [INFO ] Invariant cache hit.
[2023-03-11 03:32:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:32:33] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:32:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:32:33] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:32:33] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 03:32:33] [INFO ] After 15ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:32:33] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-11 03:32:33] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 270/270 transitions.
Graph (complete) has 451 edges and 111 vertex of which 87 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 87 transition count 222
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 87 transition count 216
Applied a total of 55 rules in 22 ms. Remains 87 /111 variables (removed 24) and now considering 216/270 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 87/111 places, 216/270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished Best-First random walk after 2210 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1105 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 299 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 133 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 270/270 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 111 transition count 264
Applied a total of 6 rules in 33 ms. Remains 111 /111 variables (removed 0) and now considering 264/270 (removed 6) transitions.
[2023-03-11 03:32:34] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
// Phase 1: matrix 181 rows 111 cols
[2023-03-11 03:32:34] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-11 03:32:34] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 03:32:34] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2023-03-11 03:32:34] [INFO ] Invariant cache hit.
[2023-03-11 03:32:34] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 03:32:34] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-11 03:32:34] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-11 03:32:34] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2023-03-11 03:32:34] [INFO ] Invariant cache hit.
[2023-03-11 03:32:34] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/111 places, 264/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 348 ms. Remains : 111/111 places, 264/270 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:32:35] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2023-03-11 03:32:35] [INFO ] Invariant cache hit.
[2023-03-11 03:32:35] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 03:32:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:32:35] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:32:35] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 03:32:35] [INFO ] After 14ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:32:35] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:32:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:32:35] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:32:35] [INFO ] After 14ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:32:35] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 03:32:35] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 264/264 transitions.
Graph (complete) has 448 edges and 111 vertex of which 87 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 87 transition count 216
Applied a total of 49 rules in 11 ms. Remains 87 /111 variables (removed 24) and now considering 216/264 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 87/111 places, 216/264 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished Best-First random walk after 4811 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1202 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 107 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 118 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 957 reset in 274 ms.
Product exploration explored 100000 steps with 994 reset in 264 ms.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 264/264 transitions.
Applied a total of 0 rules in 6 ms. Remains 111 /111 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2023-03-11 03:32:36] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2023-03-11 03:32:36] [INFO ] Invariant cache hit.
[2023-03-11 03:32:36] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 03:32:36] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2023-03-11 03:32:36] [INFO ] Invariant cache hit.
[2023-03-11 03:32:36] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 03:32:36] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-11 03:32:36] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-11 03:32:36] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2023-03-11 03:32:36] [INFO ] Invariant cache hit.
[2023-03-11 03:32:36] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 315 ms. Remains : 111/111 places, 264/264 transitions.
Treatment of property FunctionPointer-PT-b032-LTLFireability-00 finished in 5217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 396/396 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 370
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 146 transition count 364
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 139 transition count 346
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 139 transition count 346
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 139 transition count 342
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 45 place count 134 transition count 326
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 134 transition count 326
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 55 place count 129 transition count 310
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 129 transition count 310
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 124 transition count 298
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 124 transition count 298
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 119 transition count 288
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 119 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 84 place count 115 transition count 280
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 115 transition count 280
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 111 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 111 transition count 272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 108 transition count 266
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 108 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 107 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 107 transition count 264
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 107 transition count 260
Applied a total of 108 rules in 53 ms. Remains 107 /154 variables (removed 47) and now considering 260/396 (removed 136) transitions.
[2023-03-11 03:32:36] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 107 cols
[2023-03-11 03:32:36] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 03:32:37] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-11 03:32:37] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-11 03:32:37] [INFO ] Invariant cache hit.
[2023-03-11 03:32:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:32:37] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-11 03:32:37] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-11 03:32:37] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-11 03:32:37] [INFO ] Invariant cache hit.
[2023-03-11 03:32:37] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/154 places, 260/396 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 519 ms. Remains : 107/154 places, 260/396 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s95 1)), p0:(AND (GEQ s1 1) (GEQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 969 reset in 263 ms.
Product exploration explored 100000 steps with 1016 reset in 258 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2253 steps, including 2 resets, run visited all 2 properties in 11 ms. (steps per millisecond=204 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 260/260 transitions.
Applied a total of 0 rules in 11 ms. Remains 107 /107 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 03:32:38] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-11 03:32:38] [INFO ] Invariant cache hit.
[2023-03-11 03:32:38] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-11 03:32:38] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-11 03:32:38] [INFO ] Invariant cache hit.
[2023-03-11 03:32:38] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:32:38] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-11 03:32:38] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-11 03:32:38] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-11 03:32:38] [INFO ] Invariant cache hit.
[2023-03-11 03:32:38] [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 343 ms. Remains : 107/107 places, 260/260 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1242 steps, including 1 resets, run visited all 2 properties in 10 ms. (steps per millisecond=124 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 994 reset in 258 ms.
Product exploration explored 100000 steps with 1006 reset in 267 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 260/260 transitions.
Applied a total of 0 rules in 5 ms. Remains 107 /107 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 03:32:40] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-11 03:32:40] [INFO ] Invariant cache hit.
[2023-03-11 03:32:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-11 03:32:40] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-11 03:32:40] [INFO ] Invariant cache hit.
[2023-03-11 03:32:40] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:32:40] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-11 03:32:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:32:40] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-11 03:32:40] [INFO ] Invariant cache hit.
[2023-03-11 03:32:40] [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 314 ms. Remains : 107/107 places, 260/260 transitions.
Treatment of property FunctionPointer-PT-b032-LTLFireability-02 finished in 3707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 396/396 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 144 transition count 364
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 144 transition count 364
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 144 transition count 356
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 136 transition count 336
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 136 transition count 336
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 48 place count 136 transition count 332
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 130 transition count 312
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 130 transition count 312
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 124 transition count 292
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 124 transition count 292
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 118 transition count 278
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 118 transition count 278
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 90 place count 112 transition count 266
Iterating global reduction 2 with 6 rules applied. Total rules applied 96 place count 112 transition count 266
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 101 place count 107 transition count 256
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 107 transition count 256
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 111 place count 102 transition count 246
Iterating global reduction 2 with 5 rules applied. Total rules applied 116 place count 102 transition count 246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 98 transition count 238
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 97 transition count 236
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 97 transition count 236
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 97 transition count 234
Applied a total of 128 rules in 28 ms. Remains 97 /154 variables (removed 57) and now considering 234/396 (removed 162) transitions.
[2023-03-11 03:32:40] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2023-03-11 03:32:40] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:32:40] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 03:32:40] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-11 03:32:40] [INFO ] Invariant cache hit.
[2023-03-11 03:32:40] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 03:32:40] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-11 03:32:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:32:40] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-11 03:32:40] [INFO ] Invariant cache hit.
[2023-03-11 03:32:40] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/154 places, 234/396 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 345 ms. Remains : 97/154 places, 234/396 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s89 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 26 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-03 finished in 391 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 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 396/396 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 144 transition count 364
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 144 transition count 364
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 144 transition count 356
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 136 transition count 336
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 136 transition count 336
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 48 place count 136 transition count 332
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 130 transition count 312
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 130 transition count 312
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 124 transition count 292
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 124 transition count 292
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 77 place count 119 transition count 280
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 119 transition count 280
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 114 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 114 transition count 270
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 96 place count 110 transition count 262
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 110 transition count 262
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 106 transition count 254
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 106 transition count 254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 111 place count 103 transition count 248
Iterating global reduction 2 with 3 rules applied. Total rules applied 114 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 102 transition count 246
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 102 transition count 246
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 102 transition count 244
Applied a total of 118 rules in 42 ms. Remains 102 /154 variables (removed 52) and now considering 244/396 (removed 152) transitions.
[2023-03-11 03:32:40] [INFO ] Flow matrix only has 167 transitions (discarded 77 similar events)
// Phase 1: matrix 167 rows 102 cols
[2023-03-11 03:32:40] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-11 03:32:41] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 03:32:41] [INFO ] Flow matrix only has 167 transitions (discarded 77 similar events)
[2023-03-11 03:32:41] [INFO ] Invariant cache hit.
[2023-03-11 03:32:41] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:32:41] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-11 03:32:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 03:32:41] [INFO ] Flow matrix only has 167 transitions (discarded 77 similar events)
[2023-03-11 03:32:41] [INFO ] Invariant cache hit.
[2023-03-11 03:32:41] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/154 places, 244/396 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 340 ms. Remains : 102/154 places, 244/396 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-06 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 (GEQ s4 1) (GEQ s78 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 41 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-06 finished in 552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&(p2||G(p3)))))'
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 396/396 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 370
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 146 transition count 364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 140 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 140 transition count 348
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 140 transition count 344
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 136 transition count 332
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 136 transition count 332
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 132 transition count 320
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 132 transition count 320
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 128 transition count 310
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 128 transition count 310
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 124 transition count 302
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 124 transition count 302
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 121 transition count 296
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 121 transition count 296
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 118 transition count 290
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 118 transition count 290
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 116 transition count 286
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 116 transition count 286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 115 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 115 transition count 284
Applied a total of 88 rules in 22 ms. Remains 115 /154 variables (removed 39) and now considering 284/396 (removed 112) transitions.
[2023-03-11 03:32:41] [INFO ] Flow matrix only has 192 transitions (discarded 92 similar events)
// Phase 1: matrix 192 rows 115 cols
[2023-03-11 03:32:41] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-11 03:32:41] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-11 03:32:41] [INFO ] Flow matrix only has 192 transitions (discarded 92 similar events)
[2023-03-11 03:32:41] [INFO ] Invariant cache hit.
[2023-03-11 03:32:41] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 03:32:41] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-11 03:32:41] [INFO ] Flow matrix only has 192 transitions (discarded 92 similar events)
[2023-03-11 03:32:41] [INFO ] Invariant cache hit.
[2023-03-11 03:32:41] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/154 places, 284/396 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 352 ms. Remains : 115/154 places, 284/396 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p3)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) p0 p2) (AND (NOT p1) p0 p3)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p2) p3) (AND p0 (NOT p2) p3)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s37 1)), p0:(OR (AND (GEQ s0 1) (GEQ s91 1)) (AND (GEQ s1 1) (GEQ s97 1))), p2:(AND (GEQ s0 1) (GEQ s103 1)), p3:(AND (GEQ s1 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-07 finished in 601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 396/396 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 368
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 368
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 146 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 139 transition count 346
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 139 transition count 346
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 139 transition count 342
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 45 place count 134 transition count 324
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 134 transition count 324
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 55 place count 129 transition count 308
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 129 transition count 308
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 124 transition count 298
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 124 transition count 298
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 119 transition count 288
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 119 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 84 place count 115 transition count 280
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 115 transition count 280
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 111 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 111 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 109 transition count 268
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 109 transition count 268
Applied a total of 100 rules in 19 ms. Remains 109 /154 variables (removed 45) and now considering 268/396 (removed 128) transitions.
[2023-03-11 03:32:42] [INFO ] Flow matrix only has 183 transitions (discarded 85 similar events)
// Phase 1: matrix 183 rows 109 cols
[2023-03-11 03:32:42] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:32:42] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-11 03:32:42] [INFO ] Flow matrix only has 183 transitions (discarded 85 similar events)
[2023-03-11 03:32:42] [INFO ] Invariant cache hit.
[2023-03-11 03:32:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-11 03:32:42] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-11 03:32:42] [INFO ] Flow matrix only has 183 transitions (discarded 85 similar events)
[2023-03-11 03:32:42] [INFO ] Invariant cache hit.
[2023-03-11 03:32:42] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/154 places, 268/396 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 330 ms. Remains : 109/154 places, 268/396 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s0 1) (LT s75 1)), p0:(AND (GEQ s1 1) (GEQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1627 steps with 17 reset in 7 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-08 finished in 493 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((F(p1)&&p0))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 396/396 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 145 transition count 368
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 145 transition count 368
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 145 transition count 360
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 139 transition count 344
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 139 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 133 transition count 324
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 133 transition count 324
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 127 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 127 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 121 transition count 290
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 121 transition count 290
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 115 transition count 278
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 115 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 110 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 110 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 105 transition count 258
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 105 transition count 258
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 101 transition count 250
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 101 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 100 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 100 transition count 248
Applied a total of 116 rules in 20 ms. Remains 100 /154 variables (removed 54) and now considering 248/396 (removed 148) transitions.
[2023-03-11 03:32:42] [INFO ] Flow matrix only has 165 transitions (discarded 83 similar events)
// Phase 1: matrix 165 rows 100 cols
[2023-03-11 03:32:42] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 03:32:42] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 03:32:42] [INFO ] Flow matrix only has 165 transitions (discarded 83 similar events)
[2023-03-11 03:32:42] [INFO ] Invariant cache hit.
[2023-03-11 03:32:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 03:32:42] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-11 03:32:42] [INFO ] Flow matrix only has 165 transitions (discarded 83 similar events)
[2023-03-11 03:32:42] [INFO ] Invariant cache hit.
[2023-03-11 03:32:42] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/154 places, 248/396 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 100/154 places, 248/396 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s50 1)), p0:(AND (GEQ s1 1) (GEQ s83 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 43 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-09 finished in 413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(X(F((X(p0) U p1))))&&F(p1))))))'
Support contains 2 out of 154 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 396/396 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 145 transition count 370
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 145 transition count 370
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 145 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 138 transition count 344
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 138 transition count 344
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 48 place count 138 transition count 336
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 133 transition count 320
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 133 transition count 320
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 128 transition count 304
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 128 transition count 304
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 123 transition count 292
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 123 transition count 292
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 118 transition count 282
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 118 transition count 282
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 114 transition count 274
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 114 transition count 274
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 100 place count 110 transition count 266
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 110 transition count 266
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 107 transition count 260
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 106 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 106 transition count 258
Applied a total of 112 rules in 25 ms. Remains 106 /154 variables (removed 48) and now considering 258/396 (removed 138) transitions.
[2023-03-11 03:32:43] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2023-03-11 03:32:43] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 03:32:43] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 03:32:43] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2023-03-11 03:32:43] [INFO ] Invariant cache hit.
[2023-03-11 03:32:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:32:43] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-11 03:32:43] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2023-03-11 03:32:43] [INFO ] Invariant cache hit.
[2023-03-11 03:32:43] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/154 places, 258/396 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 106/154 places, 258/396 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s0 1) (GEQ s86 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-12 finished in 585 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 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 396/396 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 144 transition count 364
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 144 transition count 364
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 144 transition count 356
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 136 transition count 336
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 136 transition count 336
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 48 place count 136 transition count 332
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 131 transition count 314
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 131 transition count 314
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 126 transition count 296
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 126 transition count 296
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 121 transition count 284
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 121 transition count 284
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 116 transition count 274
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 116 transition count 274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 93 place count 111 transition count 264
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 111 transition count 264
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 103 place count 106 transition count 254
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 112 place count 102 transition count 246
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 102 transition count 246
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 101 transition count 244
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 101 transition count 244
Applied a total of 118 rules in 17 ms. Remains 101 /154 variables (removed 53) and now considering 244/396 (removed 152) transitions.
[2023-03-11 03:32:43] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
// Phase 1: matrix 166 rows 101 cols
[2023-03-11 03:32:43] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:32:43] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-11 03:32:43] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
[2023-03-11 03:32:43] [INFO ] Invariant cache hit.
[2023-03-11 03:32:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:32:43] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-11 03:32:43] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
[2023-03-11 03:32:43] [INFO ] Invariant cache hit.
[2023-03-11 03:32:43] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/154 places, 244/396 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 101/154 places, 244/396 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-15 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 (GEQ s0 1) (GEQ s6 1)), p1:(OR (LT s4 1) (LT s77 1))], 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]]
Product exploration explored 100000 steps with 929 reset in 298 ms.
Entered a terminal (fully accepting) state of product in 10205 steps with 84 reset in 33 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-15 finished in 802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(!p0)||(!p0&&G(F(!p1)))))))'
Found a Shortening insensitive property : FunctionPointer-PT-b032-LTLFireability-00
Stuttering acceptance computed with spot in 204 ms :[p0, (AND p1 p0), (AND p1 p0), p0, p0]
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 154/154 places, 396/396 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 370
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 146 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 140 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 140 transition count 348
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 140 transition count 344
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 136 transition count 330
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 136 transition count 330
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 132 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 132 transition count 314
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 128 transition count 304
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 128 transition count 304
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 124 transition count 296
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 124 transition count 296
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 120 transition count 288
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 84 place count 116 transition count 280
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 116 transition count 280
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 112 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 112 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 111 transition count 270
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 111 transition count 270
Applied a total of 98 rules in 27 ms. Remains 111 /154 variables (removed 43) and now considering 270/396 (removed 126) transitions.
[2023-03-11 03:32:44] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
// Phase 1: matrix 184 rows 111 cols
[2023-03-11 03:32:44] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:32:44] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-11 03:32:44] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2023-03-11 03:32:44] [INFO ] Invariant cache hit.
[2023-03-11 03:32:44] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 03:32:44] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-11 03:32:44] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2023-03-11 03:32:44] [INFO ] Invariant cache hit.
[2023-03-11 03:32:45] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 111/154 places, 270/396 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 352 ms. Remains : 111/154 places, 270/396 transitions.
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p1:(AND (GEQ s1 1) (GEQ s98 1)), p0:(AND (GEQ s1 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 915 reset in 269 ms.
Product exploration explored 100000 steps with 953 reset in 266 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 255 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10002 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:32:46] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2023-03-11 03:32:46] [INFO ] Invariant cache hit.
[2023-03-11 03:32:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:32:46] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:32:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:32:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:32:46] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:32:46] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 03:32:46] [INFO ] After 13ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:32:46] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-11 03:32:46] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 270/270 transitions.
Graph (complete) has 451 edges and 111 vertex of which 87 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 87 transition count 222
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 87 transition count 216
Applied a total of 55 rules in 10 ms. Remains 87 /111 variables (removed 24) and now considering 216/270 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 87/111 places, 216/270 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished Best-First random walk after 1851 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=925 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 378 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 115 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 270/270 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 111 transition count 264
Applied a total of 6 rules in 13 ms. Remains 111 /111 variables (removed 0) and now considering 264/270 (removed 6) transitions.
[2023-03-11 03:32:46] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
// Phase 1: matrix 181 rows 111 cols
[2023-03-11 03:32:46] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 03:32:46] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-11 03:32:46] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2023-03-11 03:32:46] [INFO ] Invariant cache hit.
[2023-03-11 03:32:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 03:32:47] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-11 03:32:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:32:47] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2023-03-11 03:32:47] [INFO ] Invariant cache hit.
[2023-03-11 03:32:47] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/111 places, 264/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 384 ms. Remains : 111/111 places, 264/270 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 163 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10004 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:32:47] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2023-03-11 03:32:47] [INFO ] Invariant cache hit.
[2023-03-11 03:32:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:32:47] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:32:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 03:32:47] [INFO ] After 14ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:32:47] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:32:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:32:47] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:32:47] [INFO ] After 13ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:32:47] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-11 03:32:47] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 264/264 transitions.
Graph (complete) has 448 edges and 111 vertex of which 87 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 87 transition count 216
Applied a total of 49 rules in 6 ms. Remains 87 /111 variables (removed 24) and now considering 216/264 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 87/111 places, 216/264 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished Best-First random walk after 2670 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1335 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 108 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 112 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 975 reset in 248 ms.
Product exploration explored 100000 steps with 980 reset in 258 ms.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 264/264 transitions.
Applied a total of 0 rules in 14 ms. Remains 111 /111 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2023-03-11 03:32:48] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2023-03-11 03:32:48] [INFO ] Invariant cache hit.
[2023-03-11 03:32:49] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 03:32:49] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2023-03-11 03:32:49] [INFO ] Invariant cache hit.
[2023-03-11 03:32:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 03:32:49] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-11 03:32:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:32:49] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2023-03-11 03:32:49] [INFO ] Invariant cache hit.
[2023-03-11 03:32:49] [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 336 ms. Remains : 111/111 places, 264/264 transitions.
Treatment of property FunctionPointer-PT-b032-LTLFireability-00 finished in 4943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
[2023-03-11 03:32:49] [INFO ] Flatten gal took : 25 ms
[2023-03-11 03:32:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 03:32:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 396 transitions and 1598 arcs took 4 ms.
Total runtime 20831 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FunctionPointer-PT-b032
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1678505615656

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b032-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b032-LTLFireability-02: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 15/32 FunctionPointer-PT-b032-LTLFireability-00 1817567 m, 363513 m/sec, 2349530 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b032-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b032-LTLFireability-02: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 30/32 FunctionPointer-PT-b032-LTLFireability-00 3606167 m, 357720 m/sec, 4661622 t fired, .

Time elapsed: 10 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for FunctionPointer-PT-b032-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b032-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b032-LTLFireability-02: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 FunctionPointer-PT-b032-LTLFireability-02
lola: time limit : 3585 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b032-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b032-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3585 7/32 FunctionPointer-PT-b032-LTLFireability-02 769852 m, 153970 m/sec, 995167 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b032-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b032-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3585 13/32 FunctionPointer-PT-b032-LTLFireability-02 1531957 m, 152421 m/sec, 1980326 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b032-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b032-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3585 19/32 FunctionPointer-PT-b032-LTLFireability-02 2292084 m, 152025 m/sec, 2962929 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b032-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b032-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3585 26/32 FunctionPointer-PT-b032-LTLFireability-02 3036431 m, 148869 m/sec, 3925134 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b032-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b032-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3585 32/32 FunctionPointer-PT-b032-LTLFireability-02 3787480 m, 150209 m/sec, 4896002 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for FunctionPointer-PT-b032-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b032-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b032-LTLFireability-02: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b032-LTLFireability-00: LTL unknown AGGR
FunctionPointer-PT-b032-LTLFireability-02: LTL unknown AGGR


Time elapsed: 45 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b032"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is FunctionPointer-PT-b032, 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 r167-tall-167838853500692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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