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.r231-tall-167856415600091.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 IBM703-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856415600091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 11K Feb 26 04:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 04:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 04:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 04:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 04:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 04:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 04:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 04:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:17 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 203K 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 IBM703-PT-none-LTLCardinality-00
FORMULA_NAME IBM703-PT-none-LTLCardinality-01
FORMULA_NAME IBM703-PT-none-LTLCardinality-02
FORMULA_NAME IBM703-PT-none-LTLCardinality-03
FORMULA_NAME IBM703-PT-none-LTLCardinality-04
FORMULA_NAME IBM703-PT-none-LTLCardinality-05
FORMULA_NAME IBM703-PT-none-LTLCardinality-06
FORMULA_NAME IBM703-PT-none-LTLCardinality-07
FORMULA_NAME IBM703-PT-none-LTLCardinality-08
FORMULA_NAME IBM703-PT-none-LTLCardinality-09
FORMULA_NAME IBM703-PT-none-LTLCardinality-10
FORMULA_NAME IBM703-PT-none-LTLCardinality-11
FORMULA_NAME IBM703-PT-none-LTLCardinality-12
FORMULA_NAME IBM703-PT-none-LTLCardinality-13
FORMULA_NAME IBM703-PT-none-LTLCardinality-14
FORMULA_NAME IBM703-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679434411969

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM703-PT-none
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 21:33:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 21:33:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:33:33] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-21 21:33:33] [INFO ] Transformed 262 places.
[2023-03-21 21:33:33] [INFO ] Transformed 284 transitions.
[2023-03-21 21:33:33] [INFO ] Found NUPN structural information;
[2023-03-21 21:33:33] [INFO ] Completing missing partition info from NUPN : creating a component with [merge_s00000450_activated, merge_s00000462_activated, merge_s00000319_activated, merge_s00000446_activated, merge_s00000449_activated, task_s00000720_input_s00000263, task_s00000721_input_s00000263, task_s00000704_input_s00000263, task_s00000714_input_s00000263, task_s00000724_input_s00000263, fork_s00000464_input_s00000263, task_s00000716_input_s00000263, task_s00000762_input_s00000263, task_s00000726_input_s00000263, task_s00000754_input_s00000263, task_s00000727_input_s00000263, task_s00000746_input_s00000263, task_s00000756_input_s00000263, task_s00000757_input_s00000263, merge_s00000320_input_s00000263, merge_s00000453_input_s00000290, merge_s00000319_input_s00000290, merge_s00000455_input_s00000290, merge_s00000446_input_s00000290, merge_s00000456_input_s00000263, merge_s00000458_input_s00000263, merge_s00000457_input_s00000285, task_s00000710_output_s00000264, task_s00000730_output_s00000264, task_s00000740_output_s00000264, task_s00000704_output_s00000264, task_s00000732_output_s00000264, task_s00000714_output_s00000264, task_s00000733_output_s00000264, task_s00000724_output_s00000264, task_s00000752_output_s00000264, task_s00000716_output_s00000264, task_s00000707_output_s00000264, task_s00000744_output_s00000264, task_s00000708_output_s00000264, task_s00000736_output_s00000264, task_s00000727_output_s00000264, task_s00000755_output_s00000264, task_s00000728_output_s00000264, task_s00000738_output_s00000264, task_s00000739_output_s00000264, task_s00000749_output_s00000264, decision_s00000801_activated, decision_s00000804_activated, decision_s00000772_activated, decision_s00000792_activated, decision_s00000793_activated, decision_s00000776_activated, decision_s00000796_activated, decision_s00000788_activated, fork_s00000463_activated_s00000272, fork_s00000464_activated_s00000272, fork_s00000466_activated_s00000272, fork_s00000466_activated_s00000274, decision_s00000773_input_s00000263, decision_s00000793_input_s00000263, decision_s00000775_input_s00000263, decision_s00000787_input_s00000263, process_s00000030__s00000703_input_s00000263, callToProcess_s00000807_output_s00000264, callToProcess_s00000808_output_s00000264, task_s00000710_inputCriterion_s00000257_used, task_s00000711_inputCriterion_s00000257_used, task_s00000721_inputCriterion_s00000257_used, task_s00000740_inputCriterion_s00000257_used, task_s00000722_inputCriterion_s00000257_used, task_s00000741_inputCriterion_s00000257_used, task_s00000732_inputCriterion_s00000257_used, task_s00000714_inputCriterion_s00000257_used, task_s00000760_inputCriterion_s00000257_used, task_s00000733_inputCriterion_s00000257_used, task_s00000724_inputCriterion_s00000257_used, task_s00000706_inputCriterion_s00000257_used, task_s00000752_inputCriterion_s00000257_used, task_s00000725_inputCriterion_s00000257_used, task_s00000707_inputCriterion_s00000257_used, task_s00000753_inputCriterion_s00000257_used, task_s00000735_inputCriterion_s00000257_used, task_s00000726_inputCriterion_s00000257_used, task_s00000708_inputCriterion_s00000257_used, task_s00000745_inputCriterion_s00000257_used, task_s00000736_inputCriterion_s00000257_used, task_s00000718_inputCriterion_s00000257_used, task_s00000755_inputCriterion_s00000257_used, task_s00000737_inputCriterion_s00000257_used, task_s00000719_inputCriterion_s00000257_used, task_s00000738_inputCriterion_s00000257_used, task_s00000757_inputCriterion_s00000257_used, task_s00000748_inputCriterion_s00000257_used, task_s00000758_inputCriterion_s00000257_used, callToProcess_s00000807_inputCriterion_s00000257_used, callToProcess_s00000808_inputCriterion_s00000257_used]
[2023-03-21 21:33:33] [INFO ] Parsed PT model containing 262 places and 284 transitions and 572 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA IBM703-PT-none-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 284/284 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 258 transition count 284
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 26 place count 236 transition count 262
Iterating global reduction 1 with 22 rules applied. Total rules applied 48 place count 236 transition count 262
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 58 place count 226 transition count 252
Iterating global reduction 1 with 10 rules applied. Total rules applied 68 place count 226 transition count 252
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 75 place count 219 transition count 245
Iterating global reduction 1 with 7 rules applied. Total rules applied 82 place count 219 transition count 245
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 85 place count 219 transition count 242
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 217 transition count 240
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 217 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 215 transition count 238
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 215 transition count 238
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 213 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 213 transition count 236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 212 transition count 235
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 212 transition count 235
Applied a total of 99 rules in 77 ms. Remains 212 /262 variables (removed 50) and now considering 235/284 (removed 49) transitions.
// Phase 1: matrix 235 rows 212 cols
[2023-03-21 21:33:33] [INFO ] Computed 0 place invariants in 20 ms
[2023-03-21 21:33:34] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-21 21:33:34] [INFO ] Invariant cache hit.
[2023-03-21 21:33:34] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2023-03-21 21:33:34] [INFO ] Invariant cache hit.
[2023-03-21 21:33:34] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 212/262 places, 235/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 651 ms. Remains : 212/262 places, 235/284 transitions.
Support contains 35 out of 212 places after structural reductions.
[2023-03-21 21:33:34] [INFO ] Flatten gal took : 35 ms
[2023-03-21 21:33:34] [INFO ] Flatten gal took : 17 ms
[2023-03-21 21:33:34] [INFO ] Input system was already deterministic with 235 transitions.
Finished random walk after 7271 steps, including 149 resets, run visited all 22 properties in 225 ms. (steps per millisecond=32 )
Computed a total of 212 stabilizing places and 235 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 212 transition count 235
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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((X(p1)||p0))))'
Support contains 3 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 235/235 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 235
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 197 transition count 222
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 197 transition count 222
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 190 transition count 215
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 190 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 186 transition count 211
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 186 transition count 211
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 183 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 183 transition count 208
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 180 transition count 205
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 180 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 177 transition count 202
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 177 transition count 202
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 174 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 174 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 172 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 172 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 171 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 171 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 170 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 169 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 168 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 168 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 168 transition count 192
Applied a total of 87 rules in 53 ms. Remains 168 /212 variables (removed 44) and now considering 192/235 (removed 43) transitions.
// Phase 1: matrix 192 rows 168 cols
[2023-03-21 21:33:35] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-21 21:33:35] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-21 21:33:35] [INFO ] Invariant cache hit.
[2023-03-21 21:33:35] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-21 21:33:35] [INFO ] Invariant cache hit.
[2023-03-21 21:33:35] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/212 places, 192/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 168/212 places, 192/235 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s23 0) (EQ s87 1)), p1:(EQ s95 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1854 reset in 194 ms.
Product exploration explored 100000 steps with 1817 reset in 111 ms.
Computed a total of 168 stabilizing places and 192 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 192
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 13 factoid took 314 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBM703-PT-none-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLCardinality-00 finished in 1223 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 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 235/235 transitions.
Graph (complete) has 236 edges and 212 vertex of which 173 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.3 ms
Discarding 39 places :
Also discarding 37 output transitions
Drop transitions removed 37 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 129 rules applied. Total rules applied 130 place count 172 transition count 68
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 146 rules applied. Total rules applied 276 place count 44 transition count 50
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 291 place count 32 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 293 place count 30 transition count 47
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 293 place count 30 transition count 42
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 303 place count 25 transition count 42
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 306 place count 22 transition count 38
Iterating global reduction 4 with 3 rules applied. Total rules applied 309 place count 22 transition count 38
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 339 place count 7 transition count 17
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 344 place count 7 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 348 place count 5 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 349 place count 5 transition count 9
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 351 place count 5 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 351 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 353 place count 4 transition count 6
Applied a total of 353 rules in 29 ms. Remains 4 /212 variables (removed 208) and now considering 6/235 (removed 229) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-21 21:33:36] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:33:36] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-21 21:33:36] [INFO ] Invariant cache hit.
[2023-03-21 21:33:36] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2023-03-21 21:33:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 21:33:36] [INFO ] Invariant cache hit.
[2023-03-21 21:33:36] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/212 places, 6/235 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 4/212 places, 6/235 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-01 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 (NEQ s1 0) (NEQ s2 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 4 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-01 finished in 133 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((p0||X(X(F(p1)))))))'
Support contains 3 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 235/235 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 235
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 198 transition count 223
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 198 transition count 223
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 192 transition count 217
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 192 transition count 217
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 188 transition count 213
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 188 transition count 213
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 185 transition count 210
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 185 transition count 210
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 182 transition count 207
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 182 transition count 207
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 179 transition count 204
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 179 transition count 204
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 176 transition count 201
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 176 transition count 201
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 173 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 173 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 172 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 172 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 171 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 171 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 170 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 169 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 169 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 169 transition count 193
Applied a total of 85 rules in 40 ms. Remains 169 /212 variables (removed 43) and now considering 193/235 (removed 42) transitions.
// Phase 1: matrix 193 rows 169 cols
[2023-03-21 21:33:36] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-21 21:33:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-21 21:33:36] [INFO ] Invariant cache hit.
[2023-03-21 21:33:36] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-21 21:33:36] [INFO ] Invariant cache hit.
[2023-03-21 21:33:36] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/212 places, 193/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 236 ms. Remains : 169/212 places, 193/235 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=3, aps=[p0:(EQ s116 1), p1:(OR (EQ s8 0) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 195 ms.
Product exploration explored 100000 steps with 20000 reset in 134 ms.
Computed a total of 169 stabilizing places and 193 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 169 transition count 193
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBM703-PT-none-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLCardinality-03 finished in 918 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)||F(G(p1))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 235/235 transitions.
Graph (complete) has 236 edges and 212 vertex of which 187 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 25 output transitions
Drop transitions removed 25 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 137 place count 186 transition count 73
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 151 rules applied. Total rules applied 288 place count 50 transition count 58
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 299 place count 40 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 300 place count 39 transition count 57
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 300 place count 39 transition count 51
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 312 place count 33 transition count 51
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 315 place count 30 transition count 47
Iterating global reduction 4 with 3 rules applied. Total rules applied 318 place count 30 transition count 47
Performed 19 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 356 place count 11 transition count 22
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 363 place count 11 transition count 15
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 367 place count 9 transition count 12
Applied a total of 367 rules in 14 ms. Remains 9 /212 variables (removed 203) and now considering 12/235 (removed 223) transitions.
// Phase 1: matrix 12 rows 9 cols
[2023-03-21 21:33:37] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:33:37] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-21 21:33:37] [INFO ] Invariant cache hit.
[2023-03-21 21:33:37] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-21 21:33:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 21:33:37] [INFO ] Invariant cache hit.
[2023-03-21 21:33:37] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/212 places, 12/235 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 9/212 places, 12/235 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s8 1)), p1:(OR (EQ s3 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 62 steps with 14 reset in 0 ms.
FORMULA IBM703-PT-none-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-06 finished in 174 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&&G(p1))))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 235/235 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 235
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 197 transition count 222
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 197 transition count 222
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 191 transition count 216
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 191 transition count 216
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 188 transition count 213
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 188 transition count 213
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 186 transition count 211
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 186 transition count 211
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 184 transition count 209
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 184 transition count 209
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 182 transition count 207
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 182 transition count 207
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 180 transition count 205
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 180 transition count 205
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 178 transition count 203
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 178 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 177 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 177 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 176 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 176 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 175 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 175 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 174 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 174 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 174 transition count 198
Applied a total of 75 rules in 33 ms. Remains 174 /212 variables (removed 38) and now considering 198/235 (removed 37) transitions.
// Phase 1: matrix 198 rows 174 cols
[2023-03-21 21:33:37] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-21 21:33:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-21 21:33:37] [INFO ] Invariant cache hit.
[2023-03-21 21:33:37] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-21 21:33:37] [INFO ] Invariant cache hit.
[2023-03-21 21:33:37] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 174/212 places, 198/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 174/212 places, 198/235 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s164 1), p0:(EQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA IBM703-PT-none-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-07 finished in 365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 235/235 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 235
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 198 transition count 222
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 198 transition count 222
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 192 transition count 216
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 192 transition count 216
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 189 transition count 213
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 189 transition count 213
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 187 transition count 211
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 187 transition count 211
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 185 transition count 209
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 185 transition count 209
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 183 transition count 207
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 183 transition count 207
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 181 transition count 205
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 181 transition count 205
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 179 transition count 203
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 179 transition count 203
Applied a total of 65 rules in 33 ms. Remains 179 /212 variables (removed 33) and now considering 203/235 (removed 32) transitions.
// Phase 1: matrix 203 rows 179 cols
[2023-03-21 21:33:37] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-21 21:33:37] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-21 21:33:37] [INFO ] Invariant cache hit.
[2023-03-21 21:33:37] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-21 21:33:37] [INFO ] Invariant cache hit.
[2023-03-21 21:33:37] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/212 places, 203/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 179/212 places, 203/235 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s92 0) (NEQ s158 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-08 finished in 341 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)))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 235/235 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 235
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 198 transition count 223
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 198 transition count 223
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 192 transition count 217
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 192 transition count 217
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 189 transition count 214
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 189 transition count 214
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 186 transition count 211
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 186 transition count 211
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 183 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 183 transition count 208
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 180 transition count 205
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 180 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 177 transition count 202
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 177 transition count 202
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 174 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 174 transition count 199
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 173 transition count 198
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 173 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 172 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 172 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 171 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 171 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 170 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 170 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 170 transition count 194
Applied a total of 83 rules in 21 ms. Remains 170 /212 variables (removed 42) and now considering 194/235 (removed 41) transitions.
// Phase 1: matrix 194 rows 170 cols
[2023-03-21 21:33:38] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-21 21:33:38] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-21 21:33:38] [INFO ] Invariant cache hit.
[2023-03-21 21:33:38] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-21 21:33:38] [INFO ] Invariant cache hit.
[2023-03-21 21:33:38] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/212 places, 194/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 170/212 places, 194/235 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s160 0) (EQ s57 1)), p0:(OR (EQ s3 0) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 170 stabilizing places and 194 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 170 transition count 194
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 8 factoid took 136 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBM703-PT-none-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLCardinality-09 finished in 830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 235/235 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 235
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 196 transition count 221
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 196 transition count 221
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 189 transition count 214
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 189 transition count 214
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 185 transition count 210
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 185 transition count 210
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 182 transition count 207
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 182 transition count 207
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 179 transition count 204
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 179 transition count 204
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 176 transition count 201
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 176 transition count 201
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 173 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 173 transition count 198
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 170 transition count 195
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 169 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 168 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 168 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 167 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 167 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 166 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 166 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 91 place count 166 transition count 190
Applied a total of 91 rules in 21 ms. Remains 166 /212 variables (removed 46) and now considering 190/235 (removed 45) transitions.
// Phase 1: matrix 190 rows 166 cols
[2023-03-21 21:33:38] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-21 21:33:39] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:39] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:39] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/212 places, 190/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 166/212 places, 190/235 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-11 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 235/235 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 235
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 197 transition count 222
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 197 transition count 222
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 190 transition count 215
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 190 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 186 transition count 211
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 186 transition count 211
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 183 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 183 transition count 208
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 180 transition count 205
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 180 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 177 transition count 202
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 177 transition count 202
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 174 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 174 transition count 199
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 171 transition count 196
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 171 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 170 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 169 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 168 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 168 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 167 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 167 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 89 place count 167 transition count 191
Applied a total of 89 rules in 25 ms. Remains 167 /212 variables (removed 45) and now considering 191/235 (removed 44) transitions.
// Phase 1: matrix 191 rows 167 cols
[2023-03-21 21:33:39] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-21 21:33:39] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:39] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:39] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 167/212 places, 191/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 167/212 places, 191/235 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s158 0) (EQ s97 1)) (OR (EQ s38 0) (EQ s144 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4548 steps with 85 reset in 9 ms.
FORMULA IBM703-PT-none-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-12 finished in 310 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' '!(((p0 U p1)&&F(p2)&&G(F(p3))))'
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 235/235 transitions.
Graph (complete) has 236 edges and 212 vertex of which 115 are kept as prefixes of interest. Removing 97 places using SCC suffix rule.1 ms
Discarding 97 places :
Also discarding 101 output transitions
Drop transitions removed 101 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 114 transition count 55
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 87 rules applied. Total rules applied 166 place count 36 transition count 46
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 172 place count 30 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 172 place count 30 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 182 place count 25 transition count 41
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 184 place count 23 transition count 38
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 23 transition count 38
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 202 place count 15 transition count 29
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 206 place count 15 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 14 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 14 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 211 place count 13 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 212 place count 13 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 213 place count 13 transition count 21
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 216 place count 13 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 217 place count 13 transition count 20
Applied a total of 217 rules in 9 ms. Remains 13 /212 variables (removed 199) and now considering 20/235 (removed 215) transitions.
// Phase 1: matrix 20 rows 13 cols
[2023-03-21 21:33:39] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:33:39] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:39] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-21 21:33:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:39] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/212 places, 20/235 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 13/212 places, 20/235 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3), (NOT p3)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=0 dest: 4}, { cond=(OR p1 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s9 1), p0:(OR (EQ s11 0) (EQ s3 1)), p2:(EQ s5 1), p3:(OR (EQ s4 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-13 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 235/235 transitions.
Graph (complete) has 236 edges and 212 vertex of which 10 are kept as prefixes of interest. Removing 202 places using SCC suffix rule.2 ms
Discarding 202 places :
Also discarding 222 output transitions
Drop transitions removed 222 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 9 transition count 5
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 3 transition count 4
Applied a total of 15 rules in 6 ms. Remains 3 /212 variables (removed 209) and now considering 4/235 (removed 231) transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-03-21 21:33:39] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:33:39] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:39] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2023-03-21 21:33:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 21:33:39] [INFO ] Invariant cache hit.
[2023-03-21 21:33:39] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/212 places, 4/235 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 3/212 places, 4/235 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 2 reset in 0 ms.
FORMULA IBM703-PT-none-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-14 finished in 114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&(X(X(G(p1)))||F(!p0))) U p2))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 235/235 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 235
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 197 transition count 222
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 197 transition count 222
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 190 transition count 215
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 190 transition count 215
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 187 transition count 212
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 187 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 184 transition count 209
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 184 transition count 209
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 181 transition count 206
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 181 transition count 206
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 178 transition count 203
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 178 transition count 203
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 175 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 175 transition count 200
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 172 transition count 197
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 172 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 171 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 171 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 170 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 169 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 168 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 168 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 168 transition count 192
Applied a total of 87 rules in 26 ms. Remains 168 /212 variables (removed 44) and now considering 192/235 (removed 43) transitions.
// Phase 1: matrix 192 rows 168 cols
[2023-03-21 21:33:40] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-21 21:33:40] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-21 21:33:40] [INFO ] Invariant cache hit.
[2023-03-21 21:33:40] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-21 21:33:40] [INFO ] Invariant cache hit.
[2023-03-21 21:33:40] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/212 places, 192/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 168/212 places, 192/235 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s64 0) (EQ s119 1)), p1:(EQ s145 1), p2:(EQ s164 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-15 finished in 444 ms.
All properties solved by simple procedures.
Total runtime 7060 ms.
ITS solved all properties within timeout

BK_STOP 1679434421515

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is IBM703-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r231-tall-167856415600091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBM703-PT-none.tgz
mv IBM703-PT-none execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;