Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820900475.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is LeafsetExtension-PT-S16C2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820900475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 10K Apr 29 12:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 12:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 29 12:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 12:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 9 08:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 9 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 9 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 905K May 10 09:34 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 LeafsetExtension-PT-S16C2-LTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652793124038

Running Version 202205111006
[2022-05-17 13:12:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 13:12:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 13:12:05] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2022-05-17 13:12:05] [INFO ] Transformed 1542 places.
[2022-05-17 13:12:05] [INFO ] Transformed 1449 transitions.
[2022-05-17 13:12:05] [INFO ] Parsed PT model containing 1542 places and 1449 transitions in 262 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 1542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Reduce places removed 282 places and 0 transitions.
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 1260 transition count 1449
Discarding 255 places :
Symmetric choice reduction at 1 with 255 rule applications. Total rules 537 place count 1005 transition count 1194
Iterating global reduction 1 with 255 rules applied. Total rules applied 792 place count 1005 transition count 1194
Discarding 214 places :
Symmetric choice reduction at 1 with 214 rule applications. Total rules 1006 place count 791 transition count 980
Iterating global reduction 1 with 214 rules applied. Total rules applied 1220 place count 791 transition count 980
Discarding 206 places :
Symmetric choice reduction at 1 with 206 rule applications. Total rules 1426 place count 585 transition count 774
Iterating global reduction 1 with 206 rules applied. Total rules applied 1632 place count 585 transition count 774
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 1 with 14 rules applied. Total rules applied 1646 place count 571 transition count 774
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1658 place count 559 transition count 762
Iterating global reduction 2 with 12 rules applied. Total rules applied 1670 place count 559 transition count 762
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1681 place count 548 transition count 751
Iterating global reduction 2 with 11 rules applied. Total rules applied 1692 place count 548 transition count 751
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1703 place count 537 transition count 740
Iterating global reduction 2 with 11 rules applied. Total rules applied 1714 place count 537 transition count 740
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1725 place count 526 transition count 729
Iterating global reduction 2 with 11 rules applied. Total rules applied 1736 place count 526 transition count 729
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 1808 place count 454 transition count 657
Iterating global reduction 2 with 72 rules applied. Total rules applied 1880 place count 454 transition count 657
Applied a total of 1880 rules in 838 ms. Remains 454 /1542 variables (removed 1088) and now considering 657/1449 (removed 792) transitions.
[2022-05-17 13:12:06] [INFO ] Flow matrix only has 586 transitions (discarded 71 similar events)
// Phase 1: matrix 586 rows 454 cols
[2022-05-17 13:12:06] [INFO ] Computed 40 place invariants in 30 ms
[2022-05-17 13:12:06] [INFO ] Implicit Places using invariants in 437 ms returned [32, 64, 78, 95, 114, 120, 133, 153, 191, 193, 200, 212, 238, 258, 292, 324, 360, 384, 406, 425]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 462 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 434/1542 places, 657/1449 transitions.
Discarding 143 places :
Symmetric choice reduction at 0 with 143 rule applications. Total rules 143 place count 291 transition count 514
Iterating global reduction 0 with 143 rules applied. Total rules applied 286 place count 291 transition count 514
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 288 place count 289 transition count 512
Iterating global reduction 0 with 2 rules applied. Total rules applied 290 place count 289 transition count 512
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 292 place count 287 transition count 510
Iterating global reduction 0 with 2 rules applied. Total rules applied 294 place count 287 transition count 510
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 296 place count 285 transition count 508
Iterating global reduction 0 with 2 rules applied. Total rules applied 298 place count 285 transition count 508
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 300 place count 283 transition count 506
Iterating global reduction 0 with 2 rules applied. Total rules applied 302 place count 283 transition count 506
Applied a total of 302 rules in 99 ms. Remains 283 /434 variables (removed 151) and now considering 506/657 (removed 151) transitions.
[2022-05-17 13:12:06] [INFO ] Flow matrix only has 410 transitions (discarded 96 similar events)
// Phase 1: matrix 410 rows 283 cols
[2022-05-17 13:12:06] [INFO ] Computed 20 place invariants in 12 ms
[2022-05-17 13:12:07] [INFO ] Implicit Places using invariants in 120 ms returned []
[2022-05-17 13:12:07] [INFO ] Flow matrix only has 410 transitions (discarded 96 similar events)
// Phase 1: matrix 410 rows 283 cols
[2022-05-17 13:12:07] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 13:12:07] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 283/1542 places, 506/1449 transitions.
Finished structural reductions, in 2 iterations. Remains : 283/1542 places, 506/1449 transitions.
Support contains 39 out of 283 places after structural reductions.
[2022-05-17 13:12:07] [INFO ] Flatten gal took : 59 ms
[2022-05-17 13:12:07] [INFO ] Flatten gal took : 29 ms
[2022-05-17 13:12:07] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 532 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 27) seen :21
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-05-17 13:12:08] [INFO ] Flow matrix only has 410 transitions (discarded 96 similar events)
// Phase 1: matrix 410 rows 283 cols
[2022-05-17 13:12:08] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-17 13:12:08] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 7 ms returned sat
[2022-05-17 13:12:08] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 283 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 283 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(F(p0))&&G(X(!(G(p1) U p1)))))))'
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 506/506 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 273 transition count 506
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 43 place count 240 transition count 473
Iterating global reduction 1 with 33 rules applied. Total rules applied 76 place count 240 transition count 473
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 105 place count 211 transition count 444
Iterating global reduction 1 with 29 rules applied. Total rules applied 134 place count 211 transition count 444
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 137 place count 208 transition count 444
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 161 place count 184 transition count 420
Iterating global reduction 2 with 24 rules applied. Total rules applied 185 place count 184 transition count 420
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 196 place count 173 transition count 420
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 226 place count 143 transition count 390
Iterating global reduction 3 with 30 rules applied. Total rules applied 256 place count 143 transition count 390
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 270 place count 129 transition count 376
Iterating global reduction 3 with 14 rules applied. Total rules applied 284 place count 129 transition count 376
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 298 place count 115 transition count 362
Iterating global reduction 3 with 14 rules applied. Total rules applied 312 place count 115 transition count 362
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 326 place count 101 transition count 348
Iterating global reduction 3 with 14 rules applied. Total rules applied 340 place count 101 transition count 348
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 351 place count 90 transition count 337
Iterating global reduction 3 with 11 rules applied. Total rules applied 362 place count 90 transition count 337
Applied a total of 362 rules in 20 ms. Remains 90 /283 variables (removed 193) and now considering 337/506 (removed 169) transitions.
[2022-05-17 13:12:09] [INFO ] Flow matrix only has 116 transitions (discarded 221 similar events)
// Phase 1: matrix 116 rows 90 cols
[2022-05-17 13:12:09] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 13:12:09] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-05-17 13:12:09] [INFO ] Flow matrix only has 116 transitions (discarded 221 similar events)
// Phase 1: matrix 116 rows 90 cols
[2022-05-17 13:12:09] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 13:12:09] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2022-05-17 13:12:09] [INFO ] Flow matrix only has 116 transitions (discarded 221 similar events)
// Phase 1: matrix 116 rows 90 cols
[2022-05-17 13:12:09] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-17 13:12:09] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/283 places, 337/506 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/283 places, 337/506 transitions.
Stuttering acceptance computed with spot in 331 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(LEQ s47 s38), p0:(LEQ s29 s61)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-00 finished in 687 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||G(p1))))'
Support contains 3 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 506/506 transitions.
Graph (complete) has 933 edges and 283 vertex of which 271 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.7 ms
Discarding 12 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 271 transition count 441
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 207 transition count 441
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 129 place count 207 transition count 415
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 181 place count 181 transition count 415
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 203 place count 159 transition count 393
Iterating global reduction 2 with 22 rules applied. Total rules applied 225 place count 159 transition count 393
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 236 place count 148 transition count 382
Iterating global reduction 2 with 11 rules applied. Total rules applied 247 place count 148 transition count 382
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 252 place count 143 transition count 382
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 252 place count 143 transition count 377
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 262 place count 138 transition count 377
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 267 place count 133 transition count 372
Iterating global reduction 3 with 5 rules applied. Total rules applied 272 place count 133 transition count 372
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 277 place count 128 transition count 367
Iterating global reduction 3 with 5 rules applied. Total rules applied 282 place count 128 transition count 367
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 342 place count 98 transition count 337
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 354 place count 86 transition count 325
Iterating global reduction 3 with 12 rules applied. Total rules applied 366 place count 86 transition count 325
Applied a total of 366 rules in 64 ms. Remains 86 /283 variables (removed 197) and now considering 325/506 (removed 181) transitions.
[2022-05-17 13:12:09] [INFO ] Flow matrix only has 175 transitions (discarded 150 similar events)
// Phase 1: matrix 175 rows 86 cols
[2022-05-17 13:12:09] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 13:12:09] [INFO ] Implicit Places using invariants in 60 ms returned [2, 7, 22, 28, 32, 36, 37, 42, 46, 47, 52]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 62 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/283 places, 325/506 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 66 transition count 316
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 66 transition count 316
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 57 transition count 307
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 57 transition count 307
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 0 with 4 rules applied. Total rules applied 40 place count 55 transition count 305
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 53 transition count 303
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 53 transition count 303
Applied a total of 44 rules in 16 ms. Remains 53 /75 variables (removed 22) and now considering 303/325 (removed 22) transitions.
[2022-05-17 13:12:09] [INFO ] Flow matrix only has 66 transitions (discarded 237 similar events)
// Phase 1: matrix 66 rows 53 cols
[2022-05-17 13:12:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:12:09] [INFO ] Implicit Places using invariants in 53 ms returned []
[2022-05-17 13:12:09] [INFO ] Flow matrix only has 66 transitions (discarded 237 similar events)
// Phase 1: matrix 66 rows 53 cols
[2022-05-17 13:12:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:12:09] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/283 places, 303/506 transitions.
Finished structural reductions, in 2 iterations. Remains : 53/283 places, 303/506 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(GT s33 s38), p0:(GT 1 s44)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 60 steps with 6 reset in 3 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-01 finished in 387 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 506/506 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 273 transition count 506
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 44 place count 239 transition count 472
Iterating global reduction 1 with 34 rules applied. Total rules applied 78 place count 239 transition count 472
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 107 place count 210 transition count 443
Iterating global reduction 1 with 29 rules applied. Total rules applied 136 place count 210 transition count 443
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 139 place count 207 transition count 443
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 163 place count 183 transition count 419
Iterating global reduction 2 with 24 rules applied. Total rules applied 187 place count 183 transition count 419
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 199 place count 171 transition count 419
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 229 place count 141 transition count 389
Iterating global reduction 3 with 30 rules applied. Total rules applied 259 place count 141 transition count 389
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 274 place count 126 transition count 374
Iterating global reduction 3 with 15 rules applied. Total rules applied 289 place count 126 transition count 374
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 304 place count 111 transition count 359
Iterating global reduction 3 with 15 rules applied. Total rules applied 319 place count 111 transition count 359
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 334 place count 96 transition count 344
Iterating global reduction 3 with 15 rules applied. Total rules applied 349 place count 96 transition count 344
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 361 place count 84 transition count 332
Iterating global reduction 3 with 12 rules applied. Total rules applied 373 place count 84 transition count 332
Applied a total of 373 rules in 14 ms. Remains 84 /283 variables (removed 199) and now considering 332/506 (removed 174) transitions.
[2022-05-17 13:12:10] [INFO ] Flow matrix only has 112 transitions (discarded 220 similar events)
// Phase 1: matrix 112 rows 84 cols
[2022-05-17 13:12:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 13:12:10] [INFO ] Implicit Places using invariants in 47 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/283 places, 332/506 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 82 transition count 331
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 82 transition count 331
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 81 transition count 330
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 81 transition count 330
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 80 transition count 329
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 80 transition count 329
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 79 transition count 328
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 79 transition count 328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 78 transition count 327
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 78 transition count 327
Applied a total of 10 rules in 8 ms. Remains 78 /83 variables (removed 5) and now considering 327/332 (removed 5) transitions.
[2022-05-17 13:12:10] [INFO ] Flow matrix only has 100 transitions (discarded 227 similar events)
// Phase 1: matrix 100 rows 78 cols
[2022-05-17 13:12:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:12:10] [INFO ] Implicit Places using invariants in 45 ms returned []
[2022-05-17 13:12:10] [INFO ] Flow matrix only has 100 transitions (discarded 227 similar events)
// Phase 1: matrix 100 rows 78 cols
[2022-05-17 13:12:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:12:10] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 78/283 places, 327/506 transitions.
Finished structural reductions, in 2 iterations. Remains : 78/283 places, 327/506 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s22 s59), p0:(LEQ s34 s75)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 45038 steps with 2466 reset in 116 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-04 finished in 404 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(G(X(G(F(p0)))))) U X(p1)))))'
Support contains 2 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 506/506 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 273 transition count 506
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 45 place count 238 transition count 471
Iterating global reduction 1 with 35 rules applied. Total rules applied 80 place count 238 transition count 471
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 112 place count 206 transition count 439
Iterating global reduction 1 with 32 rules applied. Total rules applied 144 place count 206 transition count 439
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 149 place count 201 transition count 439
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 178 place count 172 transition count 410
Iterating global reduction 2 with 29 rules applied. Total rules applied 207 place count 172 transition count 410
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 219 place count 160 transition count 410
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 252 place count 127 transition count 377
Iterating global reduction 3 with 33 rules applied. Total rules applied 285 place count 127 transition count 377
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 302 place count 110 transition count 360
Iterating global reduction 3 with 17 rules applied. Total rules applied 319 place count 110 transition count 360
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 336 place count 93 transition count 343
Iterating global reduction 3 with 17 rules applied. Total rules applied 353 place count 93 transition count 343
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 370 place count 76 transition count 326
Iterating global reduction 3 with 17 rules applied. Total rules applied 387 place count 76 transition count 326
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 399 place count 64 transition count 314
Iterating global reduction 3 with 12 rules applied. Total rules applied 411 place count 64 transition count 314
Applied a total of 411 rules in 18 ms. Remains 64 /283 variables (removed 219) and now considering 314/506 (removed 192) transitions.
[2022-05-17 13:12:10] [INFO ] Flow matrix only has 71 transitions (discarded 243 similar events)
// Phase 1: matrix 71 rows 64 cols
[2022-05-17 13:12:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:12:10] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-05-17 13:12:10] [INFO ] Flow matrix only has 71 transitions (discarded 243 similar events)
// Phase 1: matrix 71 rows 64 cols
[2022-05-17 13:12:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:12:10] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2022-05-17 13:12:10] [INFO ] Flow matrix only has 71 transitions (discarded 243 similar events)
// Phase 1: matrix 71 rows 64 cols
[2022-05-17 13:12:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:12:10] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/283 places, 314/506 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/283 places, 314/506 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GT 1 s21), p0:(LEQ 1 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 232 ms.
Product exploration explored 100000 steps with 25000 reset in 225 ms.
Computed a total of 64 stabilizing places and 314 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 314
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 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Finished random walk after 807 steps, including 41 resets, run visited all 3 properties in 16 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2022-05-17 13:12:12] [INFO ] Flow matrix only has 71 transitions (discarded 243 similar events)
// Phase 1: matrix 71 rows 64 cols
[2022-05-17 13:12:12] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:12:12] [INFO ] Implicit Places using invariants in 57 ms returned []
[2022-05-17 13:12:12] [INFO ] Flow matrix only has 71 transitions (discarded 243 similar events)
// Phase 1: matrix 71 rows 64 cols
[2022-05-17 13:12:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:12:12] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2022-05-17 13:12:12] [INFO ] Flow matrix only has 71 transitions (discarded 243 similar events)
// Phase 1: matrix 71 rows 64 cols
[2022-05-17 13:12:12] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:12:12] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 314/314 transitions.
Computed a total of 64 stabilizing places and 314 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 314
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 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 1385 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Finished random walk after 604 steps, including 31 resets, run visited all 3 properties in 11 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 425 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 190 ms.
Product exploration explored 100000 steps with 25000 reset in 202 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 314/314 transitions.
Graph (complete) has 436 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 63 transition count 313
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 7 place count 63 transition count 314
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 63 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 61 transition count 312
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 61 transition count 312
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 61 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 57 transition count 308
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 57 transition count 308
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 28 rules in 26 ms. Remains 57 /64 variables (removed 7) and now considering 308/314 (removed 6) transitions.
[2022-05-17 13:12:16] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-17 13:12:16] [INFO ] Flow matrix only has 63 transitions (discarded 245 similar events)
// Phase 1: matrix 63 rows 57 cols
[2022-05-17 13:12:16] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 13:12:16] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/64 places, 308/314 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/64 places, 308/314 transitions.
Product exploration explored 100000 steps with 25000 reset in 550 ms.
Product exploration explored 100000 steps with 25000 reset in 527 ms.
Built C files in :
/tmp/ltsmin6224916679421326201
[2022-05-17 13:12:17] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6224916679421326201
Running compilation step : cd /tmp/ltsmin6224916679421326201;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 566 ms.
Running link step : cd /tmp/ltsmin6224916679421326201;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6224916679421326201;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6975463554749591769.hoa' '--buchi-type=spotba'
LTSmin run took 209 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-06 finished in 7911 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(X(p0))))))'
Support contains 1 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 506/506 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 272 transition count 506
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 47 place count 236 transition count 470
Iterating global reduction 1 with 36 rules applied. Total rules applied 83 place count 236 transition count 470
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 115 place count 204 transition count 438
Iterating global reduction 1 with 32 rules applied. Total rules applied 147 place count 204 transition count 438
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 152 place count 199 transition count 438
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 181 place count 170 transition count 409
Iterating global reduction 2 with 29 rules applied. Total rules applied 210 place count 170 transition count 409
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 223 place count 157 transition count 409
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 257 place count 123 transition count 375
Iterating global reduction 3 with 34 rules applied. Total rules applied 291 place count 123 transition count 375
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 309 place count 105 transition count 357
Iterating global reduction 3 with 18 rules applied. Total rules applied 327 place count 105 transition count 357
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 345 place count 87 transition count 339
Iterating global reduction 3 with 18 rules applied. Total rules applied 363 place count 87 transition count 339
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 381 place count 69 transition count 321
Iterating global reduction 3 with 18 rules applied. Total rules applied 399 place count 69 transition count 321
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 412 place count 56 transition count 308
Iterating global reduction 3 with 13 rules applied. Total rules applied 425 place count 56 transition count 308
Applied a total of 425 rules in 22 ms. Remains 56 /283 variables (removed 227) and now considering 308/506 (removed 198) transitions.
[2022-05-17 13:12:18] [INFO ] Flow matrix only has 64 transitions (discarded 244 similar events)
// Phase 1: matrix 64 rows 56 cols
[2022-05-17 13:12:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 13:12:18] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-05-17 13:12:18] [INFO ] Flow matrix only has 64 transitions (discarded 244 similar events)
// Phase 1: matrix 64 rows 56 cols
[2022-05-17 13:12:18] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 13:12:18] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2022-05-17 13:12:18] [INFO ] Flow matrix only has 64 transitions (discarded 244 similar events)
// Phase 1: matrix 64 rows 56 cols
[2022-05-17 13:12:18] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 13:12:18] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/283 places, 308/506 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/283 places, 308/506 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ 2 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-07 finished in 362 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(X(X(F(p0)))))&&p1)))'
Support contains 2 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 506/506 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 273 transition count 506
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 45 place count 238 transition count 471
Iterating global reduction 1 with 35 rules applied. Total rules applied 80 place count 238 transition count 471
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 111 place count 207 transition count 440
Iterating global reduction 1 with 31 rules applied. Total rules applied 142 place count 207 transition count 440
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 147 place count 202 transition count 440
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 176 place count 173 transition count 411
Iterating global reduction 2 with 29 rules applied. Total rules applied 205 place count 173 transition count 411
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 216 place count 162 transition count 411
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 248 place count 130 transition count 379
Iterating global reduction 3 with 32 rules applied. Total rules applied 280 place count 130 transition count 379
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 296 place count 114 transition count 363
Iterating global reduction 3 with 16 rules applied. Total rules applied 312 place count 114 transition count 363
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 328 place count 98 transition count 347
Iterating global reduction 3 with 16 rules applied. Total rules applied 344 place count 98 transition count 347
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 360 place count 82 transition count 331
Iterating global reduction 3 with 16 rules applied. Total rules applied 376 place count 82 transition count 331
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 387 place count 71 transition count 320
Iterating global reduction 3 with 11 rules applied. Total rules applied 398 place count 71 transition count 320
Applied a total of 398 rules in 25 ms. Remains 71 /283 variables (removed 212) and now considering 320/506 (removed 186) transitions.
[2022-05-17 13:12:18] [INFO ] Flow matrix only has 84 transitions (discarded 236 similar events)
// Phase 1: matrix 84 rows 71 cols
[2022-05-17 13:12:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:12:18] [INFO ] Implicit Places using invariants in 42 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/283 places, 320/506 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 69 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 69 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 68 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 68 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 67 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 67 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 66 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 66 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 65 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 65 transition count 315
Applied a total of 10 rules in 6 ms. Remains 65 /70 variables (removed 5) and now considering 315/320 (removed 5) transitions.
[2022-05-17 13:12:18] [INFO ] Flow matrix only has 72 transitions (discarded 243 similar events)
// Phase 1: matrix 72 rows 65 cols
[2022-05-17 13:12:18] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 13:12:18] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-05-17 13:12:18] [INFO ] Flow matrix only has 72 transitions (discarded 243 similar events)
// Phase 1: matrix 72 rows 65 cols
[2022-05-17 13:12:18] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:12:18] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 65/283 places, 315/506 transitions.
Finished structural reductions, in 2 iterations. Remains : 65/283 places, 315/506 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT 1 s47), p0:(GT 1 s39)], 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]]
Product exploration explored 100000 steps with 5591 reset in 167 ms.
Product exploration explored 100000 steps with 5589 reset in 156 ms.
Computed a total of 65 stabilizing places and 315 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 65 transition count 315
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 p1), (X (NOT (AND p1 (NOT p0)))), true, (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 171 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-09 finished in 907 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(G(p0))))))'
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 506/506 transitions.
Graph (complete) has 933 edges and 283 vertex of which 271 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 271 transition count 442
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 208 transition count 442
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 127 place count 208 transition count 417
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 177 place count 183 transition count 417
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 198 place count 162 transition count 396
Iterating global reduction 2 with 21 rules applied. Total rules applied 219 place count 162 transition count 396
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 230 place count 151 transition count 385
Iterating global reduction 2 with 11 rules applied. Total rules applied 241 place count 151 transition count 385
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 244 place count 148 transition count 385
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 244 place count 148 transition count 382
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 250 place count 145 transition count 382
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 253 place count 142 transition count 379
Iterating global reduction 3 with 3 rules applied. Total rules applied 256 place count 142 transition count 379
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 259 place count 139 transition count 376
Iterating global reduction 3 with 3 rules applied. Total rules applied 262 place count 139 transition count 376
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 328 place count 106 transition count 343
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 340 place count 94 transition count 331
Iterating global reduction 3 with 12 rules applied. Total rules applied 352 place count 94 transition count 331
Applied a total of 352 rules in 46 ms. Remains 94 /283 variables (removed 189) and now considering 331/506 (removed 175) transitions.
[2022-05-17 13:12:19] [INFO ] Flow matrix only has 198 transitions (discarded 133 similar events)
// Phase 1: matrix 198 rows 94 cols
[2022-05-17 13:12:19] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 13:12:19] [INFO ] Implicit Places using invariants in 85 ms returned [2, 7, 22, 23, 34, 38, 42, 43, 58, 59, 64, 68, 72]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 86 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/283 places, 331/506 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 320
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 320
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 59 transition count 309
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 59 transition count 309
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 57 transition count 307
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 55 transition count 305
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 55 transition count 305
Applied a total of 52 rules in 13 ms. Remains 55 /81 variables (removed 26) and now considering 305/331 (removed 26) transitions.
[2022-05-17 13:12:19] [INFO ] Flow matrix only has 69 transitions (discarded 236 similar events)
// Phase 1: matrix 69 rows 55 cols
[2022-05-17 13:12:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:12:19] [INFO ] Implicit Places using invariants in 44 ms returned []
[2022-05-17 13:12:19] [INFO ] Flow matrix only has 69 transitions (discarded 236 similar events)
// Phase 1: matrix 69 rows 55 cols
[2022-05-17 13:12:19] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:12:19] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/283 places, 305/506 transitions.
Finished structural reductions, in 2 iterations. Remains : 55/283 places, 305/506 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-12 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 (LEQ s37 s34) (LEQ s23 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10747 reset in 166 ms.
Product exploration explored 100000 steps with 10762 reset in 299 ms.
Computed a total of 55 stabilizing places and 305 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 55 transition count 305
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-12 finished in 905 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(p0)))))'
Support contains 1 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 506/506 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 272 transition count 506
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 47 place count 236 transition count 470
Iterating global reduction 1 with 36 rules applied. Total rules applied 83 place count 236 transition count 470
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 116 place count 203 transition count 437
Iterating global reduction 1 with 33 rules applied. Total rules applied 149 place count 203 transition count 437
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 154 place count 198 transition count 437
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 184 place count 168 transition count 407
Iterating global reduction 2 with 30 rules applied. Total rules applied 214 place count 168 transition count 407
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 227 place count 155 transition count 407
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 262 place count 120 transition count 372
Iterating global reduction 3 with 35 rules applied. Total rules applied 297 place count 120 transition count 372
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 315 place count 102 transition count 354
Iterating global reduction 3 with 18 rules applied. Total rules applied 333 place count 102 transition count 354
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 351 place count 84 transition count 336
Iterating global reduction 3 with 18 rules applied. Total rules applied 369 place count 84 transition count 336
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 387 place count 66 transition count 318
Iterating global reduction 3 with 18 rules applied. Total rules applied 405 place count 66 transition count 318
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 418 place count 53 transition count 305
Iterating global reduction 3 with 13 rules applied. Total rules applied 431 place count 53 transition count 305
Applied a total of 431 rules in 21 ms. Remains 53 /283 variables (removed 230) and now considering 305/506 (removed 201) transitions.
[2022-05-17 13:12:20] [INFO ] Flow matrix only has 54 transitions (discarded 251 similar events)
// Phase 1: matrix 54 rows 53 cols
[2022-05-17 13:12:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 13:12:20] [INFO ] Implicit Places using invariants in 45 ms returned []
[2022-05-17 13:12:20] [INFO ] Flow matrix only has 54 transitions (discarded 251 similar events)
// Phase 1: matrix 54 rows 53 cols
[2022-05-17 13:12:20] [INFO ] Computed 2 place invariants in 10 ms
[2022-05-17 13:12:20] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2022-05-17 13:12:20] [INFO ] Flow matrix only has 54 transitions (discarded 251 similar events)
// Phase 1: matrix 54 rows 53 cols
[2022-05-17 13:12:20] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 13:12:20] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/283 places, 305/506 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/283 places, 305/506 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 1 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-13 finished in 387 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((F(p0) U X(F(G((G(p1)||F(p0)))))) U p2)))'
Support contains 5 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 506/506 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 273 transition count 506
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 43 place count 240 transition count 473
Iterating global reduction 1 with 33 rules applied. Total rules applied 76 place count 240 transition count 473
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 106 place count 210 transition count 443
Iterating global reduction 1 with 30 rules applied. Total rules applied 136 place count 210 transition count 443
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 140 place count 206 transition count 443
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 166 place count 180 transition count 417
Iterating global reduction 2 with 26 rules applied. Total rules applied 192 place count 180 transition count 417
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 203 place count 169 transition count 417
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 232 place count 140 transition count 388
Iterating global reduction 3 with 29 rules applied. Total rules applied 261 place count 140 transition count 388
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 276 place count 125 transition count 373
Iterating global reduction 3 with 15 rules applied. Total rules applied 291 place count 125 transition count 373
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 306 place count 110 transition count 358
Iterating global reduction 3 with 15 rules applied. Total rules applied 321 place count 110 transition count 358
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 336 place count 95 transition count 343
Iterating global reduction 3 with 15 rules applied. Total rules applied 351 place count 95 transition count 343
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 362 place count 84 transition count 332
Iterating global reduction 3 with 11 rules applied. Total rules applied 373 place count 84 transition count 332
Applied a total of 373 rules in 21 ms. Remains 84 /283 variables (removed 199) and now considering 332/506 (removed 174) transitions.
[2022-05-17 13:12:20] [INFO ] Flow matrix only has 105 transitions (discarded 227 similar events)
// Phase 1: matrix 105 rows 84 cols
[2022-05-17 13:12:20] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 13:12:21] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-05-17 13:12:21] [INFO ] Flow matrix only has 105 transitions (discarded 227 similar events)
// Phase 1: matrix 105 rows 84 cols
[2022-05-17 13:12:21] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 13:12:21] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2022-05-17 13:12:21] [INFO ] Flow matrix only has 105 transitions (discarded 227 similar events)
// Phase 1: matrix 105 rows 84 cols
[2022-05-17 13:12:21] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 13:12:21] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/283 places, 332/506 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/283 places, 332/506 transitions.
Stuttering acceptance computed with spot in 224 ms :[p2, p2, true, (OR (AND p0 p2) (AND p1 p2)), p0, p1, (OR p0 p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2), acceptance={} source=3 dest: 5}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ s66 s10), p0:(LEQ s30 s34), p1:(LEQ 1 s59)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-14 finished in 524 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p1))&&p0))))'
Support contains 3 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 506/506 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 272 transition count 506
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 45 place count 238 transition count 472
Iterating global reduction 1 with 34 rules applied. Total rules applied 79 place count 238 transition count 472
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 109 place count 208 transition count 442
Iterating global reduction 1 with 30 rules applied. Total rules applied 139 place count 208 transition count 442
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 204 transition count 442
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 170 place count 177 transition count 415
Iterating global reduction 2 with 27 rules applied. Total rules applied 197 place count 177 transition count 415
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 209 place count 165 transition count 415
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 241 place count 133 transition count 383
Iterating global reduction 3 with 32 rules applied. Total rules applied 273 place count 133 transition count 383
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 289 place count 117 transition count 367
Iterating global reduction 3 with 16 rules applied. Total rules applied 305 place count 117 transition count 367
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 321 place count 101 transition count 351
Iterating global reduction 3 with 16 rules applied. Total rules applied 337 place count 101 transition count 351
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 353 place count 85 transition count 335
Iterating global reduction 3 with 16 rules applied. Total rules applied 369 place count 85 transition count 335
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 381 place count 73 transition count 323
Iterating global reduction 3 with 12 rules applied. Total rules applied 393 place count 73 transition count 323
Applied a total of 393 rules in 19 ms. Remains 73 /283 variables (removed 210) and now considering 323/506 (removed 183) transitions.
[2022-05-17 13:12:21] [INFO ] Flow matrix only has 88 transitions (discarded 235 similar events)
// Phase 1: matrix 88 rows 73 cols
[2022-05-17 13:12:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:12:21] [INFO ] Implicit Places using invariants in 44 ms returned []
[2022-05-17 13:12:21] [INFO ] Flow matrix only has 88 transitions (discarded 235 similar events)
// Phase 1: matrix 88 rows 73 cols
[2022-05-17 13:12:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 13:12:21] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2022-05-17 13:12:21] [INFO ] Flow matrix only has 88 transitions (discarded 235 similar events)
// Phase 1: matrix 88 rows 73 cols
[2022-05-17 13:12:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 13:12:21] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/283 places, 323/506 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/283 places, 323/506 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GT s50 s25) (GT 2 s31)), p1:(GT s50 s25)], 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 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-15 finished in 348 ms.
All properties solved by simple procedures.
Total runtime 16671 ms.

BK_STOP 1652793142196

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S16C2, 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 r132-tall-165271820900475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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