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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
570.424 18242.00 34039.00 429.80 FTTFTTFFFTFFFFTF 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-162037990300609.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-010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990300609
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-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.5K 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 2.8K Jun 8 09:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 8 09:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 8 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Jun 8 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K 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 2.4M 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-010-00
FORMULA_NAME BART-PT-010-01
FORMULA_NAME BART-PT-010-02
FORMULA_NAME BART-PT-010-03
FORMULA_NAME BART-PT-010-04
FORMULA_NAME BART-PT-010-05
FORMULA_NAME BART-PT-010-06
FORMULA_NAME BART-PT-010-07
FORMULA_NAME BART-PT-010-08
FORMULA_NAME BART-PT-010-09
FORMULA_NAME BART-PT-010-10
FORMULA_NAME BART-PT-010-11
FORMULA_NAME BART-PT-010-12
FORMULA_NAME BART-PT-010-13
FORMULA_NAME BART-PT-010-14
FORMULA_NAME BART-PT-010-15

=== Now, execution of the tool begins

BK_START 1623177314020

Running Version 0
[2021-06-08 18:35:15] [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:35:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-08 18:35:15] [INFO ] Load time of PNML (sax parser for PT used): 321 ms
[2021-06-08 18:35:15] [INFO ] Transformed 1530 places.
[2021-06-08 18:35:15] [INFO ] Transformed 2020 transitions.
[2021-06-08 18:35:15] [INFO ] Found NUPN structural information;
[2021-06-08 18:35:15] [INFO ] Parsed PT model containing 1530 places and 2020 transitions in 410 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-06-08 18:35:15] [INFO ] Initial state test concluded for 3 properties.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-010-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 1320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 308 places :
Symmetric choice reduction at 0 with 308 rule applications. Total rules 308 place count 1012 transition count 1712
Iterating global reduction 0 with 308 rules applied. Total rules applied 616 place count 1012 transition count 1712
Discarding 254 places :
Symmetric choice reduction at 0 with 254 rule applications. Total rules 870 place count 758 transition count 1458
Iterating global reduction 0 with 254 rules applied. Total rules applied 1124 place count 758 transition count 1458
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 1163 place count 719 transition count 1419
Iterating global reduction 0 with 39 rules applied. Total rules applied 1202 place count 719 transition count 1419
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1232 place count 689 transition count 1389
Iterating global reduction 0 with 30 rules applied. Total rules applied 1262 place count 689 transition count 1389
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 1289 place count 662 transition count 1362
Iterating global reduction 0 with 27 rules applied. Total rules applied 1316 place count 662 transition count 1362
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 1343 place count 635 transition count 1335
Iterating global reduction 0 with 27 rules applied. Total rules applied 1370 place count 635 transition count 1335
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 1396 place count 609 transition count 1309
Iterating global reduction 0 with 26 rules applied. Total rules applied 1422 place count 609 transition count 1309
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 1447 place count 584 transition count 1284
Iterating global reduction 0 with 25 rules applied. Total rules applied 1472 place count 584 transition count 1284
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 1489 place count 567 transition count 1267
Iterating global reduction 0 with 17 rules applied. Total rules applied 1506 place count 567 transition count 1267
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 1521 place count 552 transition count 1252
Iterating global reduction 0 with 15 rules applied. Total rules applied 1536 place count 552 transition count 1252
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 1543 place count 545 transition count 1245
Iterating global reduction 0 with 7 rules applied. Total rules applied 1550 place count 545 transition count 1245
Applied a total of 1550 rules in 449 ms. Remains 545 /1320 variables (removed 775) and now considering 1245/2020 (removed 775) transitions.
// Phase 1: matrix 1245 rows 545 cols
[2021-06-08 18:35:16] [INFO ] Computed 10 place invariants in 30 ms
[2021-06-08 18:35:16] [INFO ] Implicit Places using invariants in 203 ms returned []
// Phase 1: matrix 1245 rows 545 cols
[2021-06-08 18:35:16] [INFO ] Computed 10 place invariants in 8 ms
[2021-06-08 18:35:17] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
// Phase 1: matrix 1245 rows 545 cols
[2021-06-08 18:35:17] [INFO ] Computed 10 place invariants in 8 ms
[2021-06-08 18:35:17] [INFO ] Dead Transitions using invariants and state equation in 474 ms returned []
Finished structural reductions, in 1 iterations. Remains : 545/1320 places, 1245/2020 transitions.
[2021-06-08 18:35:17] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-06-08 18:35:17] [INFO ] Flatten gal took : 99 ms
FORMULA BART-PT-010-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-08 18:35:17] [INFO ] Flatten gal took : 50 ms
[2021-06-08 18:35:17] [INFO ] Input system was already deterministic with 1245 transitions.
Finished random walk after 13474 steps, including 0 resets, run visited all 12 properties in 64 ms. (steps per millisecond=210 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0))||(F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 1245/1245 transitions.
Graph (trivial) has 1237 edges and 545 vertex of which 542 / 545 are part of one of the 10 SCC in 5 ms
Free SCC test removed 532 places
Ensure Unique test removed 1229 transitions
Reduce isomorphic transitions removed 1229 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 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 10 place count 6 transition count 7
Applied a total of 10 rules in 14 ms. Remains 6 /545 variables (removed 539) and now considering 7/1245 (removed 1238) transitions.
// Phase 1: matrix 7 rows 6 cols
[2021-06-08 18:35:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-06-08 18:35:18] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-06-08 18:35:18] [INFO ] Computed 3 place invariants in 1 ms
[2021-06-08 18:35:18] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-06-08 18:35:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-06-08 18:35:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-06-08 18:35:18] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/545 places, 7/1245 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-010-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s2 1), p1:(AND (NEQ s0 0) (NEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-010-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-03 finished in 398 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(X(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 1245/1245 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 529 transition count 1229
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 529 transition count 1229
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 520 transition count 1220
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 520 transition count 1220
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 515 transition count 1215
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 515 transition count 1215
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 511 transition count 1211
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 511 transition count 1211
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 507 transition count 1207
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 507 transition count 1207
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 503 transition count 1203
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 503 transition count 1203
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 499 transition count 1199
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 499 transition count 1199
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 95 place count 496 transition count 1196
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 496 transition count 1196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 495 transition count 1195
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 495 transition count 1195
Applied a total of 100 rules in 79 ms. Remains 495 /545 variables (removed 50) and now considering 1195/1245 (removed 50) transitions.
// Phase 1: matrix 1195 rows 495 cols
[2021-06-08 18:35:18] [INFO ] Computed 10 place invariants in 7 ms
[2021-06-08 18:35:18] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 1195 rows 495 cols
[2021-06-08 18:35:18] [INFO ] Computed 10 place invariants in 3 ms
[2021-06-08 18:35:18] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
// Phase 1: matrix 1195 rows 495 cols
[2021-06-08 18:35:18] [INFO ] Computed 10 place invariants in 21 ms
[2021-06-08 18:35:19] [INFO ] Dead Transitions using invariants and state equation in 387 ms returned []
Finished structural reductions, in 1 iterations. Remains : 495/545 places, 1195/1245 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : BART-PT-010-06 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (EQ s240 0) (EQ s443 1)), p1:(OR (EQ s218 0) (EQ s402 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2576 steps with 0 reset in 21 ms.
FORMULA BART-PT-010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-06 finished in 987 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 1245/1245 transitions.
Graph (trivial) has 1239 edges and 545 vertex of which 543 / 545 are part of one of the 10 SCC in 2 ms
Free SCC test removed 533 places
Ensure Unique test removed 1231 transitions
Reduce isomorphic transitions removed 1231 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 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 10 place count 4 transition count 5
Applied a total of 10 rules in 8 ms. Remains 4 /545 variables (removed 541) and now considering 5/1245 (removed 1240) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:19] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:19] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:19] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:19] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-06-08 18:35:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:19] [INFO ] Computed 2 place invariants in 8 ms
[2021-06-08 18:35:19] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/545 places, 5/1245 transitions.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Running random walk in product with property : BART-PT-010-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s0 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-08 finished in 93 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 1245/1245 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 527 transition count 1227
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 527 transition count 1227
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 516 transition count 1216
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 516 transition count 1216
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 511 transition count 1211
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 511 transition count 1211
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 507 transition count 1207
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 507 transition count 1207
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 503 transition count 1203
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 503 transition count 1203
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 499 transition count 1199
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 499 transition count 1199
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 96 place count 495 transition count 1195
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 495 transition count 1195
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 492 transition count 1192
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 492 transition count 1192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 491 transition count 1191
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 491 transition count 1191
Applied a total of 108 rules in 84 ms. Remains 491 /545 variables (removed 54) and now considering 1191/1245 (removed 54) transitions.
// Phase 1: matrix 1191 rows 491 cols
[2021-06-08 18:35:19] [INFO ] Computed 10 place invariants in 9 ms
[2021-06-08 18:35:19] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 1191 rows 491 cols
[2021-06-08 18:35:19] [INFO ] Computed 10 place invariants in 3 ms
[2021-06-08 18:35:19] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
// Phase 1: matrix 1191 rows 491 cols
[2021-06-08 18:35:19] [INFO ] Computed 10 place invariants in 7 ms
[2021-06-08 18:35:20] [INFO ] Dead Transitions using invariants and state equation in 380 ms returned []
Finished structural reductions, in 1 iterations. Remains : 491/545 places, 1191/1245 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BART-PT-010-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s28 0) (EQ s130 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 978 ms.
Product exploration explored 100000 steps with 50000 reset in 905 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 50000 reset in 899 ms.
Product exploration explored 100000 steps with 50000 reset in 956 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Support contains 2 out of 491 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 491/491 places, 1191/1191 transitions.
Graph (trivial) has 1187 edges and 491 vertex of which 441 / 491 are part of one of the 9 SCC in 2 ms
Free SCC test removed 432 places
Ensure Unique test removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 50 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 50 transition count 121
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 50 transition count 121
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 50 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 50 transition count 119
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 42 transition count 111
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 42 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 42 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 42 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 41 transition count 108
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 41 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 41 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 48 place count 41 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 49 place count 40 transition count 105
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 40 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 40 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 53 place count 40 transition count 103
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 54 place count 39 transition count 102
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 55 place count 39 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 56 place count 39 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 58 place count 39 transition count 100
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 59 place count 38 transition count 99
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 60 place count 38 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 61 place count 38 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 63 place count 38 transition count 97
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 64 place count 37 transition count 96
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 65 place count 37 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 66 place count 37 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 67 place count 37 transition count 95
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 68 place count 36 transition count 94
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 69 place count 36 transition count 94
Performed 27 Post agglomeration using F-continuation condition with reduction of 52 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 8 with 27 rules applied. Total rules applied 96 place count 36 transition count 148
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 8 with 81 rules applied. Total rules applied 177 place count 36 transition count 67
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 204 place count 9 transition count 13
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 9 with 27 rules applied. Total rules applied 231 place count 9 transition count 13
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 233 place count 9 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 234 place count 9 transition count 11
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 236 place count 7 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 238 place count 7 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 238 rules in 52 ms. Remains 7 /491 variables (removed 484) and now considering 9/1191 (removed 1182) transitions.
[2021-06-08 18:35:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 7 cols
[2021-06-08 18:35:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:35:24] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/491 places, 9/1191 transitions.
Product exploration explored 100000 steps with 50000 reset in 452 ms.
Product exploration explored 100000 steps with 50000 reset in 415 ms.
[2021-06-08 18:35:25] [INFO ] Flatten gal took : 35 ms
[2021-06-08 18:35:25] [INFO ] Flatten gal took : 34 ms
[2021-06-08 18:35:25] [INFO ] Time to serialize gal into /tmp/LTL2121412646072907869.gal : 19 ms
[2021-06-08 18:35:25] [INFO ] Time to serialize properties into /tmp/LTL2387700618269217697.ltl : 82 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/LTL2121412646072907869.gal, -t, CGAL, -LTL, /tmp/LTL2387700618269217697.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/LTL2121412646072907869.gal -t CGAL -LTL /tmp/LTL2387700618269217697.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X("((TrainState_9_1_2==0)||(TrainState_9_2_11==1))")))
Formula 0 simplified : !X"((TrainState_9_1_2==0)||(TrainState_9_2_11==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
146 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.53949,55292,1,0,6,244555,14,0,12145,7626,7
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-010-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-010-09 finished in 7757 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 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 1245/1245 transitions.
Graph (trivial) has 1241 edges and 545 vertex of which 541 / 545 are part of one of the 10 SCC in 2 ms
Free SCC test removed 531 places
Ensure Unique test removed 1229 transitions
Reduce isomorphic transitions removed 1229 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 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 10 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 10 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 14 place count 4 transition count 5
Applied a total of 14 rules in 5 ms. Remains 4 /545 variables (removed 541) and now considering 5/1245 (removed 1240) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:27] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:27] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:27] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:27] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-06-08 18:35:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:27] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:35:27] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/545 places, 5/1245 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-010-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (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 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-10 finished in 94 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 1245/1245 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 528 transition count 1228
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 528 transition count 1228
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 518 transition count 1218
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 518 transition count 1218
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 513 transition count 1213
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 513 transition count 1213
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 509 transition count 1209
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 509 transition count 1209
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 505 transition count 1205
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 505 transition count 1205
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 501 transition count 1201
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 501 transition count 1201
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 92 place count 497 transition count 1197
Iterating global reduction 0 with 4 rules applied. Total rules applied 96 place count 497 transition count 1197
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 494 transition count 1194
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 494 transition count 1194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 493 transition count 1193
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 493 transition count 1193
Applied a total of 104 rules in 161 ms. Remains 493 /545 variables (removed 52) and now considering 1193/1245 (removed 52) transitions.
// Phase 1: matrix 1193 rows 493 cols
[2021-06-08 18:35:27] [INFO ] Computed 10 place invariants in 12 ms
[2021-06-08 18:35:27] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 1193 rows 493 cols
[2021-06-08 18:35:27] [INFO ] Computed 10 place invariants in 9 ms
[2021-06-08 18:35:27] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
// Phase 1: matrix 1193 rows 493 cols
[2021-06-08 18:35:27] [INFO ] Computed 10 place invariants in 4 ms
[2021-06-08 18:35:28] [INFO ] Dead Transitions using invariants and state equation in 427 ms returned []
Finished structural reductions, in 1 iterations. Remains : 493/545 places, 1193/1245 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-010-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s290 0) (NEQ s331 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][false, false, false, false]]
Product exploration explored 100000 steps with 25 reset in 204 ms.
Product exploration explored 100000 steps with 23 reset in 245 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14 reset in 226 ms.
Product exploration explored 100000 steps with 25 reset in 223 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 493 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 493/493 places, 1193/1193 transitions.
Graph (trivial) has 1189 edges and 493 vertex of which 490 / 493 are part of one of the 10 SCC in 37 ms
Free SCC test removed 480 places
Ensure Unique test removed 1178 transitions
Reduce isomorphic transitions removed 1178 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 5 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 11 rules in 43 ms. Remains 5 /493 variables (removed 488) and now considering 6/1193 (removed 1187) transitions.
[2021-06-08 18:35:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2021-06-08 18:35:29] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:29] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/493 places, 6/1193 transitions.
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA BART-PT-010-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-11 finished in 2448 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 1245/1245 transitions.
Graph (trivial) has 1241 edges and 545 vertex of which 541 / 545 are part of one of the 10 SCC in 3 ms
Free SCC test removed 531 places
Ensure Unique test removed 1229 transitions
Reduce isomorphic transitions removed 1229 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 9 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 5 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 4 transition count 5
Applied a total of 14 rules in 7 ms. Remains 4 /545 variables (removed 541) and now considering 5/1245 (removed 1240) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:29] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:29] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:29] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:29] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-06-08 18:35:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:29] [INFO ] Computed 2 place invariants in 6 ms
[2021-06-08 18:35:29] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/545 places, 5/1245 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-010-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s0 1), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-12 finished in 138 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 1245/1245 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 527 transition count 1227
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 527 transition count 1227
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 517 transition count 1217
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 517 transition count 1217
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 513 transition count 1213
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 513 transition count 1213
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 510 transition count 1210
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 510 transition count 1210
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 507 transition count 1207
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 507 transition count 1207
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 504 transition count 1204
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 504 transition count 1204
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 501 transition count 1201
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 501 transition count 1201
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 499 transition count 1199
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 499 transition count 1199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 498 transition count 1198
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 498 transition count 1198
Applied a total of 94 rules in 87 ms. Remains 498 /545 variables (removed 47) and now considering 1198/1245 (removed 47) transitions.
// Phase 1: matrix 1198 rows 498 cols
[2021-06-08 18:35:30] [INFO ] Computed 10 place invariants in 7 ms
[2021-06-08 18:35:30] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 1198 rows 498 cols
[2021-06-08 18:35:30] [INFO ] Computed 10 place invariants in 4 ms
[2021-06-08 18:35:30] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
// Phase 1: matrix 1198 rows 498 cols
[2021-06-08 18:35:30] [INFO ] Computed 10 place invariants in 4 ms
[2021-06-08 18:35:30] [INFO ] Dead Transitions using invariants and state equation in 386 ms returned []
Finished structural reductions, in 1 iterations. Remains : 498/545 places, 1198/1245 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-010-13 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:(EQ s140 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 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-13 finished in 978 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 545 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 545/545 places, 1245/1245 transitions.
Graph (trivial) has 1241 edges and 545 vertex of which 544 / 545 are part of one of the 10 SCC in 4 ms
Free SCC test removed 534 places
Ensure Unique test removed 1233 transitions
Reduce isomorphic transitions removed 1233 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 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 10 place count 2 transition count 3
Applied a total of 10 rules in 9 ms. Remains 2 /545 variables (removed 543) and now considering 3/1245 (removed 1242) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:35:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:35:30] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:35:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:35:30] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-06-08 18:35:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:35:31] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:35:31] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/545 places, 3/1245 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-010-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:(NEQ 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 2 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-15 finished in 117 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623177332262

--------------------
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-010"
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-010, 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-162037990300609"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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