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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2055.239 131234.00 169802.00 689.30 FFFFTFFFTFFFTTTF 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-162037990300649.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-060, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990300649
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-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.6K Jun 8 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 8 09:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jun 8 09:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 8 09:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 8 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Jun 8 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Jun 8 09:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 8 09:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 15M 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-060-00
FORMULA_NAME BART-PT-060-01
FORMULA_NAME BART-PT-060-02
FORMULA_NAME BART-PT-060-03
FORMULA_NAME BART-PT-060-04
FORMULA_NAME BART-PT-060-05
FORMULA_NAME BART-PT-060-06
FORMULA_NAME BART-PT-060-07
FORMULA_NAME BART-PT-060-08
FORMULA_NAME BART-PT-060-09
FORMULA_NAME BART-PT-060-10
FORMULA_NAME BART-PT-060-11
FORMULA_NAME BART-PT-060-12
FORMULA_NAME BART-PT-060-13
FORMULA_NAME BART-PT-060-14
FORMULA_NAME BART-PT-060-15

=== Now, execution of the tool begins

BK_START 1623177540969

Running Version 0
[2021-06-08 18:39: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:39:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-08 18:39:03] [INFO ] Load time of PNML (sax parser for PT used): 660 ms
[2021-06-08 18:39:03] [INFO ] Transformed 8130 places.
[2021-06-08 18:39:03] [INFO ] Transformed 12120 transitions.
[2021-06-08 18:39:03] [INFO ] Found NUPN structural information;
[2021-06-08 18:39:03] [INFO ] Parsed PT model containing 8130 places and 12120 transitions in 786 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-06-08 18:39:03] [INFO ] Initial state test concluded for 5 properties.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-060-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 7920 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Discarding 1906 places :
Symmetric choice reduction at 0 with 1906 rule applications. Total rules 1906 place count 6014 transition count 10214
Iterating global reduction 0 with 1906 rules applied. Total rules applied 3812 place count 6014 transition count 10214
Discarding 1603 places :
Symmetric choice reduction at 0 with 1603 rule applications. Total rules 5415 place count 4411 transition count 8611
Iterating global reduction 0 with 1603 rules applied. Total rules applied 7018 place count 4411 transition count 8611
Discarding 237 places :
Symmetric choice reduction at 0 with 237 rule applications. Total rules 7255 place count 4174 transition count 8374
Iterating global reduction 0 with 237 rules applied. Total rules applied 7492 place count 4174 transition count 8374
Discarding 177 places :
Symmetric choice reduction at 0 with 177 rule applications. Total rules 7669 place count 3997 transition count 8197
Iterating global reduction 0 with 177 rules applied. Total rules applied 7846 place count 3997 transition count 8197
Discarding 174 places :
Symmetric choice reduction at 0 with 174 rule applications. Total rules 8020 place count 3823 transition count 8023
Iterating global reduction 0 with 174 rules applied. Total rules applied 8194 place count 3823 transition count 8023
Discarding 174 places :
Symmetric choice reduction at 0 with 174 rule applications. Total rules 8368 place count 3649 transition count 7849
Iterating global reduction 0 with 174 rules applied. Total rules applied 8542 place count 3649 transition count 7849
Discarding 174 places :
Symmetric choice reduction at 0 with 174 rule applications. Total rules 8716 place count 3475 transition count 7675
Iterating global reduction 0 with 174 rules applied. Total rules applied 8890 place count 3475 transition count 7675
Discarding 173 places :
Symmetric choice reduction at 0 with 173 rule applications. Total rules 9063 place count 3302 transition count 7502
Iterating global reduction 0 with 173 rules applied. Total rules applied 9236 place count 3302 transition count 7502
Discarding 117 places :
Symmetric choice reduction at 0 with 117 rule applications. Total rules 9353 place count 3185 transition count 7385
Iterating global reduction 0 with 117 rules applied. Total rules applied 9470 place count 3185 transition count 7385
Discarding 113 places :
Symmetric choice reduction at 0 with 113 rule applications. Total rules 9583 place count 3072 transition count 7272
Iterating global reduction 0 with 113 rules applied. Total rules applied 9696 place count 3072 transition count 7272
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 9753 place count 3015 transition count 7215
Iterating global reduction 0 with 57 rules applied. Total rules applied 9810 place count 3015 transition count 7215
Applied a total of 9810 rules in 4952 ms. Remains 3015 /7920 variables (removed 4905) and now considering 7215/12120 (removed 4905) transitions.
// Phase 1: matrix 7215 rows 3015 cols
[2021-06-08 18:39:08] [INFO ] Computed 60 place invariants in 53 ms
[2021-06-08 18:39:08] [INFO ] Implicit Places using invariants in 574 ms returned []
// Phase 1: matrix 7215 rows 3015 cols
[2021-06-08 18:39:09] [INFO ] Computed 60 place invariants in 30 ms
[2021-06-08 18:39:10] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1705 ms to find 0 implicit places.
// Phase 1: matrix 7215 rows 3015 cols
[2021-06-08 18:39:10] [INFO ] Computed 60 place invariants in 31 ms
[2021-06-08 18:39:13] [INFO ] Dead Transitions using invariants and state equation in 3243 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3015/7920 places, 7215/12120 transitions.
[2021-06-08 18:39:13] [INFO ] Flatten gal took : 290 ms
[2021-06-08 18:39:13] [INFO ] Flatten gal took : 174 ms
[2021-06-08 18:39:14] [INFO ] Input system was already deterministic with 7215 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1217 ms. (steps per millisecond=82 ) properties (out of 12) seen :10
Running SMT prover for 2 properties.
// Phase 1: matrix 7215 rows 3015 cols
[2021-06-08 18:39:15] [INFO ] Computed 60 place invariants in 19 ms
[2021-06-08 18:39:16] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:2
[2021-06-08 18:39:16] [INFO ] [Nat]Absence check using 60 positive place invariants in 70 ms returned sat
[2021-06-08 18:39:16] [INFO ] SMT Verify possible in nat domain returned unsat :2 sat :0
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
[2021-06-08 18:39:16] [INFO ] Initial state test concluded for 2 properties.
FORMULA BART-PT-060-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 3015 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3015/3015 places, 7215/7215 transitions.
Graph (trivial) has 7205 edges and 3015 vertex of which 2997 / 3015 are part of one of the 60 SCC in 16 ms
Free SCC test removed 2937 places
Ensure Unique test removed 7124 transitions
Reduce isomorphic transitions removed 7124 transitions.
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 22 transition count 34
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 20 transition count 30
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 70 place count 18 transition count 26
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 76 place count 16 transition count 22
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 82 place count 14 transition count 18
Reduce places removed 2 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 5 with 4 rules applied. Total rules applied 86 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 87 place count 11 transition count 16
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 91 place count 11 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 91 place count 11 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 97 place count 8 transition count 9
Applied a total of 97 rules in 68 ms. Remains 8 /3015 variables (removed 3007) and now considering 9/7215 (removed 7206) transitions.
// Phase 1: matrix 9 rows 8 cols
[2021-06-08 18:39:16] [INFO ] Computed 4 place invariants in 1 ms
[2021-06-08 18:39:16] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-06-08 18:39:16] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:39:16] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2021-06-08 18:39:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-06-08 18:39:16] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:39:16] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/3015 places, 9/7215 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-060-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s0 0) (EQ s3 1) (OR (EQ s2 0) (EQ s1 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BART-PT-060-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-03 finished in 405 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(G((!p0||(p1 U G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 3015 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3015/3015 places, 7215/7215 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 2998 transition count 7198
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 2998 transition count 7198
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 48 place count 2984 transition count 7184
Iterating global reduction 0 with 14 rules applied. Total rules applied 62 place count 2984 transition count 7184
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 2977 transition count 7177
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 2977 transition count 7177
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 82 place count 2971 transition count 7171
Iterating global reduction 0 with 6 rules applied. Total rules applied 88 place count 2971 transition count 7171
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 2966 transition count 7166
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 2966 transition count 7166
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 103 place count 2961 transition count 7161
Iterating global reduction 0 with 5 rules applied. Total rules applied 108 place count 2961 transition count 7161
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 2956 transition count 7156
Iterating global reduction 0 with 5 rules applied. Total rules applied 118 place count 2956 transition count 7156
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 121 place count 2953 transition count 7153
Iterating global reduction 0 with 3 rules applied. Total rules applied 124 place count 2953 transition count 7153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 2952 transition count 7152
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 2952 transition count 7152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 2951 transition count 7151
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 2951 transition count 7151
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 2950 transition count 7150
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 2950 transition count 7150
Applied a total of 130 rules in 2613 ms. Remains 2950 /3015 variables (removed 65) and now considering 7150/7215 (removed 65) transitions.
// Phase 1: matrix 7150 rows 2950 cols
[2021-06-08 18:39:19] [INFO ] Computed 60 place invariants in 19 ms
[2021-06-08 18:39:19] [INFO ] Implicit Places using invariants in 330 ms returned []
// Phase 1: matrix 7150 rows 2950 cols
[2021-06-08 18:39:19] [INFO ] Computed 60 place invariants in 21 ms
[2021-06-08 18:39:20] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
// Phase 1: matrix 7150 rows 2950 cols
[2021-06-08 18:39:20] [INFO ] Computed 60 place invariants in 21 ms
[2021-06-08 18:39:24] [INFO ] Dead Transitions using invariants and state equation in 3278 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2950/3015 places, 7150/7215 transitions.
Stuttering acceptance computed with spot in 190 ms :[false, false, (AND p0 (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : BART-PT-060-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s720 0), p2:(OR (EQ s2575 0) (EQ s928 1)), p1:(AND (EQ s928 0) (EQ s2575 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5475 ms.
Product exploration explored 100000 steps with 50000 reset in 5086 ms.
Knowledge obtained : [p0, p2, (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[false, false, (AND p0 (NOT p2)), true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 5199 ms.
Product exploration explored 100000 steps with 50000 reset in 5055 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 162 ms :[false, false, (AND p0 (NOT p2)), true, (NOT p2), (NOT p2)]
Support contains 3 out of 2950 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2950/2950 places, 7150/7150 transitions.
Graph (trivial) has 7142 edges and 2950 vertex of which 2939 / 2950 are part of one of the 60 SCC in 12 ms
Free SCC test removed 2879 places
Ensure Unique test removed 7069 transitions
Reduce isomorphic transitions removed 7069 transitions.
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 14 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 14 transition count 24
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 65 place count 14 transition count 24
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 71 place count 14 transition count 18
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 77 place count 8 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 83 place count 8 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 86 place count 8 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 8 transition count 9
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 89 rules in 26 ms. Remains 7 /2950 variables (removed 2943) and now considering 8/7150 (removed 7142) transitions.
[2021-06-08 18:39:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 7 cols
[2021-06-08 18:39:45] [INFO ] Computed 3 place invariants in 1 ms
[2021-06-08 18:39:45] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/2950 places, 8/7150 transitions.
Product exploration explored 100000 steps with 50000 reset in 1726 ms.
Product exploration explored 100000 steps with 50000 reset in 1683 ms.
[2021-06-08 18:39:49] [INFO ] Flatten gal took : 120 ms
[2021-06-08 18:39:49] [INFO ] Flatten gal took : 123 ms
[2021-06-08 18:39:50] [INFO ] Time to serialize gal into /tmp/LTL14424316935667958418.gal : 64 ms
[2021-06-08 18:39:50] [INFO ] Time to serialize properties into /tmp/LTL2993234479470883838.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14424316935667958418.gal, -t, CGAL, -LTL, /tmp/LTL2993234479470883838.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14424316935667958418.gal -t CGAL -LTL /tmp/LTL2993234479470883838.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(TrainState_39_3_10==0)")||(X(G(("(TrainState_39_3_10!=0)")||(("((TrainState_27_2_13==0)&&(TrainState_48_1_35==1))")U(G("((TrainState_48_1_35==0)||(TrainState_27_2_13==1))")))))))))
Formula 0 simplified : !X("(TrainState_39_3_10==0)" | XG("(TrainState_39_3_10!=0)" | ("((TrainState_27_2_13==0)&&(TrainState_48_1_35==1))" U G"((TrainState_48_1_35==0)||(TrainState_27_2_13==1))")))
Detected timeout of ITS tools.
[2021-06-08 18:40:05] [INFO ] Flatten gal took : 107 ms
[2021-06-08 18:40:05] [INFO ] Applying decomposition
[2021-06-08 18:40:05] [INFO ] Flatten gal took : 108 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13604682354106904109.txt, -o, /tmp/graph13604682354106904109.bin, -w, /tmp/graph13604682354106904109.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13604682354106904109.bin, -l, -1, -v, -w, /tmp/graph13604682354106904109.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-08 18:40:05] [INFO ] Decomposing Gal with order
[2021-06-08 18:40:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-08 18:40:06] [INFO ] Removed a total of 2288 redundant transitions.
[2021-06-08 18:40:06] [INFO ] Flatten gal took : 297 ms
[2021-06-08 18:40:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1299 labels/synchronizations in 39 ms.
[2021-06-08 18:40:06] [INFO ] Time to serialize gal into /tmp/LTL1496296718619396055.gal : 31 ms
[2021-06-08 18:40:06] [INFO ] Time to serialize properties into /tmp/LTL3479703406135628332.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1496296718619396055.gal, -t, CGAL, -LTL, /tmp/LTL3479703406135628332.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1496296718619396055.gal -t CGAL -LTL /tmp/LTL3479703406135628332.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i32.u165.TrainState_39_3_10==0)")||(X(G(("(i32.u165.TrainState_39_3_10!=0)")||(("((i7.u221.TrainState_27_2_13==0)&&(i13.u525.TrainState_48_1_35==1))")U(G("((i13.u525.TrainState_48_1_35==0)||(i7.u221.TrainState_27_2_13==1))")))))))))
Formula 0 simplified : !X("(i32.u165.TrainState_39_3_10==0)" | XG("(i32.u165.TrainState_39_3_10!=0)" | ("((i7.u221.TrainState_27_2_13==0)&&(i13.u525.TrainState_48_1_35==1))" U G"((i13.u525.TrainState_48_1_35==0)||(i7.u221.TrainState_27_2_13==1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
95 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.31842,50256,1,0,2130,992,2961,970,602,1616,7609
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-060-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-060-04 finished in 50938 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(G(p0))) U G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 3015 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3015/3015 places, 7215/7215 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 2998 transition count 7198
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 2998 transition count 7198
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 47 place count 2985 transition count 7185
Iterating global reduction 0 with 13 rules applied. Total rules applied 60 place count 2985 transition count 7185
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 2978 transition count 7178
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 2978 transition count 7178
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 2972 transition count 7172
Iterating global reduction 0 with 6 rules applied. Total rules applied 86 place count 2972 transition count 7172
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 2967 transition count 7167
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 2967 transition count 7167
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 101 place count 2962 transition count 7162
Iterating global reduction 0 with 5 rules applied. Total rules applied 106 place count 2962 transition count 7162
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 2957 transition count 7157
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 2957 transition count 7157
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 119 place count 2954 transition count 7154
Iterating global reduction 0 with 3 rules applied. Total rules applied 122 place count 2954 transition count 7154
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 2952 transition count 7152
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 2952 transition count 7152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 2951 transition count 7151
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 2951 transition count 7151
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 2950 transition count 7150
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 2950 transition count 7150
Applied a total of 130 rules in 1801 ms. Remains 2950 /3015 variables (removed 65) and now considering 7150/7215 (removed 65) transitions.
// Phase 1: matrix 7150 rows 2950 cols
[2021-06-08 18:40:09] [INFO ] Computed 60 place invariants in 23 ms
[2021-06-08 18:40:10] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 7150 rows 2950 cols
[2021-06-08 18:40:10] [INFO ] Computed 60 place invariants in 16 ms
[2021-06-08 18:40:11] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
// Phase 1: matrix 7150 rows 2950 cols
[2021-06-08 18:40:11] [INFO ] Computed 60 place invariants in 17 ms
[2021-06-08 18:40:14] [INFO ] Dead Transitions using invariants and state equation in 3005 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2950/3015 places, 7150/7215 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-060-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s960 0) (EQ s1262 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 573 steps with 0 reset in 8 ms.
FORMULA BART-PT-060-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-06 finished in 6204 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(F(p0))&&(p1||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 3015 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3015/3015 places, 7215/7215 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3001 transition count 7201
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3001 transition count 7201
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 2990 transition count 7190
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 2990 transition count 7190
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 2983 transition count 7183
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 2983 transition count 7183
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 2977 transition count 7177
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 2977 transition count 7177
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 82 place count 2971 transition count 7171
Iterating global reduction 0 with 6 rules applied. Total rules applied 88 place count 2971 transition count 7171
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 94 place count 2965 transition count 7165
Iterating global reduction 0 with 6 rules applied. Total rules applied 100 place count 2965 transition count 7165
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 106 place count 2959 transition count 7159
Iterating global reduction 0 with 6 rules applied. Total rules applied 112 place count 2959 transition count 7159
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 116 place count 2955 transition count 7155
Iterating global reduction 0 with 4 rules applied. Total rules applied 120 place count 2955 transition count 7155
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 122 place count 2953 transition count 7153
Iterating global reduction 0 with 2 rules applied. Total rules applied 124 place count 2953 transition count 7153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 2952 transition count 7152
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 2952 transition count 7152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 2951 transition count 7151
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 2951 transition count 7151
Applied a total of 128 rules in 1639 ms. Remains 2951 /3015 variables (removed 64) and now considering 7151/7215 (removed 64) transitions.
// Phase 1: matrix 7151 rows 2951 cols
[2021-06-08 18:40:15] [INFO ] Computed 60 place invariants in 19 ms
[2021-06-08 18:40:16] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 7151 rows 2951 cols
[2021-06-08 18:40:16] [INFO ] Computed 60 place invariants in 20 ms
[2021-06-08 18:40:17] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
// Phase 1: matrix 7151 rows 2951 cols
[2021-06-08 18:40:17] [INFO ] Computed 60 place invariants in 17 ms
[2021-06-08 18:40:20] [INFO ] Dead Transitions using invariants and state equation in 2998 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2951/3015 places, 7151/7215 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BART-PT-060-09 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p2)) (AND (NOT p0) p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1082 0) (EQ s1083 1)), p0:(AND (EQ s2034 0) (EQ s2226 1)), p2:(AND (NEQ s840 0) (NEQ s2756 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][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 1001 ms.
Product exploration explored 100000 steps with 5 reset in 1203 ms.
Knowledge obtained : [(NOT p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 2 reset in 760 ms.
Product exploration explored 100000 steps with 2 reset in 837 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 2951 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2951/2951 places, 7151/7151 transitions.
Graph (trivial) has 7137 edges and 2951 vertex of which 2939 / 2951 are part of one of the 60 SCC in 9 ms
Free SCC test removed 2879 places
Ensure Unique test removed 7072 transitions
Reduce isomorphic transitions removed 7072 transitions.
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 17 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 17 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 57 place count 17 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 17 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 17 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 63 place count 17 transition count 19
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 17 transition count 19
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 15 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 15 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 70 rules in 21 ms. Remains 15 /2951 variables (removed 2936) and now considering 17/7151 (removed 7134) transitions.
[2021-06-08 18:40:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 15 cols
[2021-06-08 18:40:24] [INFO ] Computed 5 place invariants in 1 ms
[2021-06-08 18:40:24] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/2951 places, 17/7151 transitions.
Stuttering criterion allowed to conclude after 5624 steps with 0 reset in 67 ms.
FORMULA BART-PT-060-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-09 finished in 10382 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 3015 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3015/3015 places, 7215/7215 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 2997 transition count 7197
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 2997 transition count 7197
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 51 place count 2982 transition count 7182
Iterating global reduction 0 with 15 rules applied. Total rules applied 66 place count 2982 transition count 7182
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 2974 transition count 7174
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 2974 transition count 7174
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 89 place count 2967 transition count 7167
Iterating global reduction 0 with 7 rules applied. Total rules applied 96 place count 2967 transition count 7167
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 2961 transition count 7161
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 2961 transition count 7161
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 114 place count 2955 transition count 7155
Iterating global reduction 0 with 6 rules applied. Total rules applied 120 place count 2955 transition count 7155
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 126 place count 2949 transition count 7149
Iterating global reduction 0 with 6 rules applied. Total rules applied 132 place count 2949 transition count 7149
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 136 place count 2945 transition count 7145
Iterating global reduction 0 with 4 rules applied. Total rules applied 140 place count 2945 transition count 7145
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 142 place count 2943 transition count 7143
Iterating global reduction 0 with 2 rules applied. Total rules applied 144 place count 2943 transition count 7143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 145 place count 2942 transition count 7142
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 2942 transition count 7142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 147 place count 2941 transition count 7141
Iterating global reduction 0 with 1 rules applied. Total rules applied 148 place count 2941 transition count 7141
Applied a total of 148 rules in 1599 ms. Remains 2941 /3015 variables (removed 74) and now considering 7141/7215 (removed 74) transitions.
// Phase 1: matrix 7141 rows 2941 cols
[2021-06-08 18:40:26] [INFO ] Computed 60 place invariants in 20 ms
[2021-06-08 18:40:26] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 7141 rows 2941 cols
[2021-06-08 18:40:26] [INFO ] Computed 60 place invariants in 16 ms
[2021-06-08 18:40:27] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
// Phase 1: matrix 7141 rows 2941 cols
[2021-06-08 18:40:27] [INFO ] Computed 60 place invariants in 19 ms
[2021-06-08 18:40:30] [INFO ] Dead Transitions using invariants and state equation in 2824 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2941/3015 places, 7141/7215 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-060-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s2520 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4914 ms.
Product exploration explored 100000 steps with 50000 reset in 4953 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 4727 ms.
Product exploration explored 100000 steps with 50000 reset in 4765 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2941 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2941/2941 places, 7141/7141 transitions.
Graph (trivial) has 7139 edges and 2941 vertex of which 2940 / 2941 are part of one of the 60 SCC in 12 ms
Free SCC test removed 2880 places
Ensure Unique test removed 7079 transitions
Reduce isomorphic transitions removed 7079 transitions.
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 2 transition count 3
Applied a total of 60 rules in 27 ms. Remains 2 /2941 variables (removed 2939) and now considering 3/7141 (removed 7138) transitions.
[2021-06-08 18:40:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:40:49] [INFO ] Computed 1 place invariants in 1 ms
[2021-06-08 18:40:49] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/2941 places, 3/7141 transitions.
Product exploration explored 100000 steps with 50000 reset in 1556 ms.
Product exploration explored 100000 steps with 50000 reset in 1520 ms.
[2021-06-08 18:40:53] [INFO ] Flatten gal took : 144 ms
[2021-06-08 18:40:53] [INFO ] Flatten gal took : 116 ms
[2021-06-08 18:40:53] [INFO ] Time to serialize gal into /tmp/LTL14769055351910187712.gal : 20 ms
[2021-06-08 18:40:53] [INFO ] Time to serialize properties into /tmp/LTL16191013706506694496.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14769055351910187712.gal, -t, CGAL, -LTL, /tmp/LTL16191013706506694496.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14769055351910187712.gal -t CGAL -LTL /tmp/LTL16191013706506694496.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(TrainState_31_2_34!=1)"))))
Formula 0 simplified : !XF"(TrainState_31_2_34!=1)"
Detected timeout of ITS tools.
[2021-06-08 18:41:08] [INFO ] Flatten gal took : 98 ms
[2021-06-08 18:41:08] [INFO ] Applying decomposition
[2021-06-08 18:41:08] [INFO ] Flatten gal took : 98 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7547480968208976216.txt, -o, /tmp/graph7547480968208976216.bin, -w, /tmp/graph7547480968208976216.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7547480968208976216.bin, -l, -1, -v, -w, /tmp/graph7547480968208976216.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-08 18:41:08] [INFO ] Decomposing Gal with order
[2021-06-08 18:41:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-08 18:41:09] [INFO ] Removed a total of 2278 redundant transitions.
[2021-06-08 18:41:09] [INFO ] Flatten gal took : 197 ms
[2021-06-08 18:41:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 1289 labels/synchronizations in 23 ms.
[2021-06-08 18:41:09] [INFO ] Time to serialize gal into /tmp/LTL15867179713143740447.gal : 23 ms
[2021-06-08 18:41:09] [INFO ] Time to serialize properties into /tmp/LTL12634268454574546870.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15867179713143740447.gal, -t, CGAL, -LTL, /tmp/LTL12634268454574546870.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15867179713143740447.gal -t CGAL -LTL /tmp/LTL12634268454574546870.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i6.u535.TrainState_31_2_34!=1)"))))
Formula 0 simplified : !XF"(i6.u535.TrainState_31_2_34!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
96 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.33729,49168,1,0,1730,804,2546,776,553,1312,6404
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-060-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-060-12 finished in 46404 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 3015 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3015/3015 places, 7215/7215 transitions.
Graph (trivial) has 7209 edges and 3015 vertex of which 3013 / 3015 are part of one of the 60 SCC in 4 ms
Free SCC test removed 2953 places
Ensure Unique test removed 7151 transitions
Reduce isomorphic transitions removed 7151 transitions.
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 4 transition count 7
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 4 transition count 5
Applied a total of 60 rules in 12 ms. Remains 4 /3015 variables (removed 3011) and now considering 5/7215 (removed 7210) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:41:10] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:41:10] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:41:10] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:41:10] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-06-08 18:41:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:41:10] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:41:10] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/3015 places, 5/7215 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-060-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-060-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-15 finished in 144 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623177672203

--------------------
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
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ 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-060"
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-060, 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-162037990300649"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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