fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r007-tall-162037990300625
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for BART-PT-030

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
953.804 47356.00 68912.00 491.70 FFTFFFFFFTFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037990300625.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 BART-PT-030, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990300625
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.3M
-rw-r--r-- 1 mcc users 4.2K Mar 20 13:27 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 20 13:27 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Jun 8 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 8 09:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Jun 8 09:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 8 09:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Jun 8 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 8 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Jun 8 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 8 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 8 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 8 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 20 13:27 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 20 13:27 instance
-rw-r--r-- 1 mcc users 6 Mar 20 13:27 iscolored
-rw-r--r-- 1 mcc users 7.1M Mar 20 13:27 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 BART-PT-030-00
FORMULA_NAME BART-PT-030-01
FORMULA_NAME BART-PT-030-02
FORMULA_NAME BART-PT-030-03
FORMULA_NAME BART-PT-030-04
FORMULA_NAME BART-PT-030-05
FORMULA_NAME BART-PT-030-06
FORMULA_NAME BART-PT-030-07
FORMULA_NAME BART-PT-030-08
FORMULA_NAME BART-PT-030-09
FORMULA_NAME BART-PT-030-10
FORMULA_NAME BART-PT-030-11
FORMULA_NAME BART-PT-030-12
FORMULA_NAME BART-PT-030-13
FORMULA_NAME BART-PT-030-14
FORMULA_NAME BART-PT-030-15

=== Now, execution of the tool begins

BK_START 1623177360841

Running Version 0
[2021-06-08 18:36:02] [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]
[2021-06-08 18:36:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-08 18:36:02] [INFO ] Load time of PNML (sax parser for PT used): 377 ms
[2021-06-08 18:36:02] [INFO ] Transformed 4170 places.
[2021-06-08 18:36:02] [INFO ] Transformed 6060 transitions.
[2021-06-08 18:36:02] [INFO ] Found NUPN structural information;
[2021-06-08 18:36:02] [INFO ] Parsed PT model containing 4170 places and 6060 transitions in 455 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-06-08 18:36:02] [INFO ] Initial state test concluded for 3 properties.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-030-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 3960 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 950 places :
Symmetric choice reduction at 0 with 950 rule applications. Total rules 950 place count 3010 transition count 5110
Iterating global reduction 0 with 950 rules applied. Total rules applied 1900 place count 3010 transition count 5110
Discarding 792 places :
Symmetric choice reduction at 0 with 792 rule applications. Total rules 2692 place count 2218 transition count 4318
Iterating global reduction 0 with 792 rules applied. Total rules applied 3484 place count 2218 transition count 4318
Discarding 117 places :
Symmetric choice reduction at 0 with 117 rule applications. Total rules 3601 place count 2101 transition count 4201
Iterating global reduction 0 with 117 rules applied. Total rules applied 3718 place count 2101 transition count 4201
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 3805 place count 2014 transition count 4114
Iterating global reduction 0 with 87 rules applied. Total rules applied 3892 place count 2014 transition count 4114
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 3979 place count 1927 transition count 4027
Iterating global reduction 0 with 87 rules applied. Total rules applied 4066 place count 1927 transition count 4027
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 4153 place count 1840 transition count 3940
Iterating global reduction 0 with 87 rules applied. Total rules applied 4240 place count 1840 transition count 3940
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 4326 place count 1754 transition count 3854
Iterating global reduction 0 with 86 rules applied. Total rules applied 4412 place count 1754 transition count 3854
Discarding 85 places :
Symmetric choice reduction at 0 with 85 rule applications. Total rules 4497 place count 1669 transition count 3769
Iterating global reduction 0 with 85 rules applied. Total rules applied 4582 place count 1669 transition count 3769
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 4638 place count 1613 transition count 3713
Iterating global reduction 0 with 56 rules applied. Total rules applied 4694 place count 1613 transition count 3713
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 4748 place count 1559 transition count 3659
Iterating global reduction 0 with 54 rules applied. Total rules applied 4802 place count 1559 transition count 3659
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 4829 place count 1532 transition count 3632
Iterating global reduction 0 with 27 rules applied. Total rules applied 4856 place count 1532 transition count 3632
Applied a total of 4856 rules in 1813 ms. Remains 1532 /3960 variables (removed 2428) and now considering 3632/6060 (removed 2428) transitions.
// Phase 1: matrix 3632 rows 1532 cols
[2021-06-08 18:36:04] [INFO ] Computed 30 place invariants in 43 ms
[2021-06-08 18:36:05] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 3632 rows 1532 cols
[2021-06-08 18:36:05] [INFO ] Computed 30 place invariants in 14 ms
[2021-06-08 18:36:05] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1294 ms to find 0 implicit places.
// Phase 1: matrix 3632 rows 1532 cols
[2021-06-08 18:36:06] [INFO ] Computed 30 place invariants in 17 ms
[2021-06-08 18:36:07] [INFO ] Dead Transitions using invariants and state equation in 1303 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1532/3960 places, 3632/6060 transitions.
[2021-06-08 18:36:07] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-06-08 18:36:07] [INFO ] Flatten gal took : 190 ms
FORMULA BART-PT-030-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-08 18:36:07] [INFO ] Flatten gal took : 110 ms
[2021-06-08 18:36:07] [INFO ] Input system was already deterministic with 3632 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 599 ms. (steps per millisecond=166 ) properties (out of 19) seen :17
Running SMT prover for 2 properties.
// Phase 1: matrix 3632 rows 1532 cols
[2021-06-08 18:36:08] [INFO ] Computed 30 place invariants in 15 ms
[2021-06-08 18:36:08] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2021-06-08 18:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 18:36:09] [INFO ] [Real]Absence check using state equation in 709 ms returned sat
[2021-06-08 18:36:09] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 18:36:09] [INFO ] [Nat]Absence check using 30 positive place invariants in 19 ms returned unsat
[2021-06-08 18:36:09] [INFO ] [Real]Absence check using 30 positive place invariants in 22 ms returned sat
[2021-06-08 18:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 18:36:10] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2021-06-08 18:36:10] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 18:36:11] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
[2021-06-08 18:36:11] [INFO ] Initial state test concluded for 2 properties.
FORMULA BART-PT-030-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((X(G(p1)) U (p0&&X(G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1532 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1532/1532 places, 3632/3632 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1514 transition count 3614
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1514 transition count 3614
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 1504 transition count 3604
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 1504 transition count 3604
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 1497 transition count 3597
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 1497 transition count 3597
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 1492 transition count 3592
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 1492 transition count 3592
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 1487 transition count 3587
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 1487 transition count 3587
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 1483 transition count 3583
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 1483 transition count 3583
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 1480 transition count 3580
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 1480 transition count 3580
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 107 place count 1477 transition count 3577
Iterating global reduction 0 with 3 rules applied. Total rules applied 110 place count 1477 transition count 3577
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 113 place count 1474 transition count 3574
Iterating global reduction 0 with 3 rules applied. Total rules applied 116 place count 1474 transition count 3574
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 118 place count 1472 transition count 3572
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 1472 transition count 3572
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 1471 transition count 3571
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 1471 transition count 3571
Applied a total of 122 rules in 599 ms. Remains 1471 /1532 variables (removed 61) and now considering 3571/3632 (removed 61) transitions.
// Phase 1: matrix 3571 rows 1471 cols
[2021-06-08 18:36:11] [INFO ] Computed 30 place invariants in 19 ms
[2021-06-08 18:36:11] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 3571 rows 1471 cols
[2021-06-08 18:36:11] [INFO ] Computed 30 place invariants in 9 ms
[2021-06-08 18:36:12] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
// Phase 1: matrix 3571 rows 1471 cols
[2021-06-08 18:36:12] [INFO ] Computed 30 place invariants in 9 ms
[2021-06-08 18:36:14] [INFO ] Dead Transitions using invariants and state equation in 1238 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1471/1532 places, 3571/3632 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : BART-PT-030-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s929 1), p1:(OR (EQ s376 0) (EQ s1023 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 9208 steps with 0 reset in 113 ms.
FORMULA BART-PT-030-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-00 finished in 3451 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0||X(F(p1))))||G(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 1532 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1532/1532 places, 3632/3632 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1516 transition count 3616
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1516 transition count 3616
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 1507 transition count 3607
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 1507 transition count 3607
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 1501 transition count 3601
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 1501 transition count 3601
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1497 transition count 3597
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1497 transition count 3597
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 1493 transition count 3593
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 1493 transition count 3593
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 1490 transition count 3590
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 1490 transition count 3590
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 1488 transition count 3588
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 1488 transition count 3588
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 1486 transition count 3586
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 1486 transition count 3586
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 1484 transition count 3584
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 1484 transition count 3584
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 1482 transition count 3582
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 1482 transition count 3582
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 1481 transition count 3581
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 1481 transition count 3581
Applied a total of 102 rules in 520 ms. Remains 1481 /1532 variables (removed 51) and now considering 3581/3632 (removed 51) transitions.
// Phase 1: matrix 3581 rows 1481 cols
[2021-06-08 18:36:15] [INFO ] Computed 30 place invariants in 18 ms
[2021-06-08 18:36:15] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 3581 rows 1481 cols
[2021-06-08 18:36:15] [INFO ] Computed 30 place invariants in 18 ms
[2021-06-08 18:36:16] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
// Phase 1: matrix 3581 rows 1481 cols
[2021-06-08 18:36:16] [INFO ] Computed 30 place invariants in 13 ms
[2021-06-08 18:36:17] [INFO ] Dead Transitions using invariants and state equation in 1206 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1481/1532 places, 3581/3632 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-030-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s362 1), p1:(AND (EQ s174 0) (EQ s150 1)), p2:(EQ s609 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 17 reset in 514 ms.
Product exploration explored 100000 steps with 19 reset in 622 ms.
Knowledge obtained : [(NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 20 reset in 625 ms.
Product exploration explored 100000 steps with 15 reset in 611 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 1481 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1481/1481 places, 3581/3581 transitions.
Graph (trivial) has 3569 edges and 1481 vertex of which 1469 / 1481 are part of one of the 30 SCC in 9 ms
Free SCC test removed 1439 places
Ensure Unique test removed 3528 transitions
Reduce isomorphic transitions removed 3528 transitions.
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 16 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 16 transition count 27
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 16 transition count 27
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 16 transition count 21
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 46 place count 10 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 10 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 56 place count 10 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 10 transition count 11
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 9 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 9 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 59 rules in 30 ms. Remains 9 /1481 variables (removed 1472) and now considering 10/3581 (removed 3571) transitions.
[2021-06-08 18:36:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 9 cols
[2021-06-08 18:36:20] [INFO ] Computed 4 place invariants in 1 ms
[2021-06-08 18:36:20] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/1481 places, 10/3581 transitions.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA BART-PT-030-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-04 finished in 6272 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 1532 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1532/1532 places, 3632/3632 transitions.
Graph (trivial) has 3620 edges and 1532 vertex of which 1524 / 1532 are part of one of the 30 SCC in 7 ms
Free SCC test removed 1494 places
Ensure Unique test removed 3588 transitions
Reduce isomorphic transitions removed 3588 transitions.
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 11 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 10 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 8 transition count 13
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 8 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 38 place count 8 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 7 transition count 9
Applied a total of 40 rules in 19 ms. Remains 7 /1532 variables (removed 1525) and now considering 9/3632 (removed 3623) transitions.
// Phase 1: matrix 9 rows 7 cols
[2021-06-08 18:36:20] [INFO ] Computed 3 place invariants in 0 ms
[2021-06-08 18:36:20] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 9 rows 7 cols
[2021-06-08 18:36:20] [INFO ] Computed 3 place invariants in 1 ms
[2021-06-08 18:36:20] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-06-08 18:36:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 7 cols
[2021-06-08 18:36:20] [INFO ] Computed 3 place invariants in 1 ms
[2021-06-08 18:36:20] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/1532 places, 9/3632 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : BART-PT-030-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s1 0) (EQ s2 1)), p0:(OR (EQ s3 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BART-PT-030-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-07 finished in 198 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1532 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1532/1532 places, 3632/3632 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1515 transition count 3615
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1515 transition count 3615
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 1506 transition count 3606
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 1506 transition count 3606
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 1500 transition count 3600
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 1500 transition count 3600
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 1496 transition count 3596
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 1496 transition count 3596
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 1492 transition count 3592
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 1492 transition count 3592
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 1489 transition count 3589
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 1489 transition count 3589
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 1487 transition count 3587
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 1487 transition count 3587
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 1485 transition count 3585
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 1485 transition count 3585
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 1483 transition count 3583
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 1483 transition count 3583
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 1482 transition count 3582
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 1482 transition count 3582
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 1481 transition count 3581
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 1481 transition count 3581
Applied a total of 102 rules in 620 ms. Remains 1481 /1532 variables (removed 51) and now considering 3581/3632 (removed 51) transitions.
// Phase 1: matrix 3581 rows 1481 cols
[2021-06-08 18:36:21] [INFO ] Computed 30 place invariants in 14 ms
[2021-06-08 18:36:21] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 3581 rows 1481 cols
[2021-06-08 18:36:21] [INFO ] Computed 30 place invariants in 8 ms
[2021-06-08 18:36:22] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
// Phase 1: matrix 3581 rows 1481 cols
[2021-06-08 18:36:22] [INFO ] Computed 30 place invariants in 20 ms
[2021-06-08 18:36:23] [INFO ] Dead Transitions using invariants and state equation in 1229 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1481/1532 places, 3581/3632 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-030-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s725 0) (EQ s210 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 809 steps with 0 reset in 11 ms.
FORMULA BART-PT-030-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-08 finished in 3018 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1532 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1532/1532 places, 3632/3632 transitions.
Graph (trivial) has 3628 edges and 1532 vertex of which 1528 / 1532 are part of one of the 30 SCC in 6 ms
Free SCC test removed 1498 places
Ensure Unique test removed 3596 transitions
Reduce isomorphic transitions removed 3596 transitions.
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 6 transition count 9
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 6 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 30 place count 6 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 4 transition count 5
Applied a total of 34 rules in 14 ms. Remains 4 /1532 variables (removed 1528) and now considering 5/3632 (removed 3627) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:36:24] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:36:24] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:36:24] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:36:24] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-06-08 18:36:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:36:24] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:36:24] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/1532 places, 5/3632 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-030-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-030-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-10 finished in 118 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U p1)&&X(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1532 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1532/1532 places, 3632/3632 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1514 transition count 3614
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1514 transition count 3614
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 1504 transition count 3604
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 1504 transition count 3604
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 1497 transition count 3597
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 1497 transition count 3597
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 1492 transition count 3592
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 1492 transition count 3592
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 1487 transition count 3587
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 1487 transition count 3587
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 1483 transition count 3583
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 1483 transition count 3583
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 1480 transition count 3580
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 1480 transition count 3580
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 107 place count 1477 transition count 3577
Iterating global reduction 0 with 3 rules applied. Total rules applied 110 place count 1477 transition count 3577
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 113 place count 1474 transition count 3574
Iterating global reduction 0 with 3 rules applied. Total rules applied 116 place count 1474 transition count 3574
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 118 place count 1472 transition count 3572
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 1472 transition count 3572
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 1471 transition count 3571
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 1471 transition count 3571
Applied a total of 122 rules in 515 ms. Remains 1471 /1532 variables (removed 61) and now considering 3571/3632 (removed 61) transitions.
// Phase 1: matrix 3571 rows 1471 cols
[2021-06-08 18:36:24] [INFO ] Computed 30 place invariants in 16 ms
[2021-06-08 18:36:24] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 3571 rows 1471 cols
[2021-06-08 18:36:24] [INFO ] Computed 30 place invariants in 11 ms
[2021-06-08 18:36:25] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
// Phase 1: matrix 3571 rows 1471 cols
[2021-06-08 18:36:25] [INFO ] Computed 30 place invariants in 11 ms
[2021-06-08 18:36:27] [INFO ] Dead Transitions using invariants and state equation in 1310 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1471/1532 places, 3571/3632 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : BART-PT-030-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(OR (EQ s1146 0) (EQ s1182 1)), p0:(AND (EQ s1182 0) (EQ s1146 1)), p2:(NEQ s510 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33061 reset in 3167 ms.
Product exploration explored 100000 steps with 33091 reset in 3150 ms.
Knowledge obtained : [p1, (NOT p0), p2]
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 33137 reset in 3171 ms.
Product exploration explored 100000 steps with 33082 reset in 3209 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Support contains 3 out of 1471 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1471/1471 places, 3571/3571 transitions.
Graph (trivial) has 3561 edges and 1471 vertex of which 1468 / 1471 are part of one of the 30 SCC in 6 ms
Free SCC test removed 1438 places
Ensure Unique test removed 3535 transitions
Reduce isomorphic transitions removed 3535 transitions.
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 6 transition count 10
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 6 transition count 7
Applied a total of 30 rules in 13 ms. Remains 6 /1471 variables (removed 1465) and now considering 7/3571 (removed 3564) transitions.
[2021-06-08 18:36:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-06-08 18:36:40] [INFO ] Computed 3 place invariants in 0 ms
[2021-06-08 18:36:40] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/1471 places, 7/3571 transitions.
Stuttering criterion allowed to conclude after 3680 steps with 1226 reset in 80 ms.
FORMULA BART-PT-030-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-11 finished in 16853 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U X((p1||(p2 U p3))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1532 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1532/1532 places, 3632/3632 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1515 transition count 3615
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1515 transition count 3615
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 1506 transition count 3606
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 1506 transition count 3606
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 1499 transition count 3599
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 1499 transition count 3599
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 1494 transition count 3594
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 1494 transition count 3594
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 1489 transition count 3589
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 1489 transition count 3589
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 90 place count 1485 transition count 3585
Iterating global reduction 0 with 4 rules applied. Total rules applied 94 place count 1485 transition count 3585
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 1482 transition count 3582
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 1482 transition count 3582
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 1479 transition count 3579
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 1479 transition count 3579
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 109 place count 1476 transition count 3576
Iterating global reduction 0 with 3 rules applied. Total rules applied 112 place count 1476 transition count 3576
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 1474 transition count 3574
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 1474 transition count 3574
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 1473 transition count 3573
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 1473 transition count 3573
Applied a total of 118 rules in 510 ms. Remains 1473 /1532 variables (removed 59) and now considering 3573/3632 (removed 59) transitions.
// Phase 1: matrix 3573 rows 1473 cols
[2021-06-08 18:36:41] [INFO ] Computed 30 place invariants in 8 ms
[2021-06-08 18:36:41] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 3573 rows 1473 cols
[2021-06-08 18:36:41] [INFO ] Computed 30 place invariants in 9 ms
[2021-06-08 18:36:42] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
// Phase 1: matrix 3573 rows 1473 cols
[2021-06-08 18:36:42] [INFO ] Computed 30 place invariants in 9 ms
[2021-06-08 18:36:43] [INFO ] Dead Transitions using invariants and state equation in 1199 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1473/1532 places, 3573/3632 transitions.
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : BART-PT-030-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s840 0), p1:(EQ s814 1), p3:(EQ s840 1), p2:(OR (EQ s1259 0) (EQ s871 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14 reset in 491 ms.
Product exploration explored 100000 steps with 6 reset in 521 ms.
Knowledge obtained : [(NOT p0), (NOT p1), (NOT p3), p2]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 8 reset in 499 ms.
Product exploration explored 100000 steps with 7 reset in 527 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 1473 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1473/1473 places, 3573/3573 transitions.
Graph (trivial) has 3561 edges and 1473 vertex of which 1468 / 1473 are part of one of the 30 SCC in 3 ms
Free SCC test removed 1438 places
Ensure Unique test removed 3534 transitions
Reduce isomorphic transitions removed 3534 transitions.
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 9 transition count 14
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 9 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 30 place count 9 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 9 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 31 rules in 19 ms. Remains 9 /1473 variables (removed 1464) and now considering 10/3573 (removed 3563) transitions.
[2021-06-08 18:36:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 9 cols
[2021-06-08 18:36:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:36:47] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/1473 places, 10/3573 transitions.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA BART-PT-030-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-12 finished in 6035 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623177408197

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="BART-PT-030"
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 BART-PT-030, 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 r007-tall-162037990300625"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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