fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r235-smll-162106564700300
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ShieldRVt-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16248.140 3600000.00 7591762.00 29536.90 TFFTTF?TFTFFFFFF 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.r235-smll-162106564700300.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 ShieldRVt-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564700300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 13:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 13:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 364K May 5 16:52 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 ShieldRVt-PT-030B-00
FORMULA_NAME ShieldRVt-PT-030B-01
FORMULA_NAME ShieldRVt-PT-030B-02
FORMULA_NAME ShieldRVt-PT-030B-03
FORMULA_NAME ShieldRVt-PT-030B-04
FORMULA_NAME ShieldRVt-PT-030B-05
FORMULA_NAME ShieldRVt-PT-030B-06
FORMULA_NAME ShieldRVt-PT-030B-07
FORMULA_NAME ShieldRVt-PT-030B-08
FORMULA_NAME ShieldRVt-PT-030B-09
FORMULA_NAME ShieldRVt-PT-030B-10
FORMULA_NAME ShieldRVt-PT-030B-11
FORMULA_NAME ShieldRVt-PT-030B-12
FORMULA_NAME ShieldRVt-PT-030B-13
FORMULA_NAME ShieldRVt-PT-030B-14
FORMULA_NAME ShieldRVt-PT-030B-15

=== Now, execution of the tool begins

BK_START 1621268621075

Running Version 0
[2021-05-17 16:23:44] [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-05-17 16:23:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 16:23:44] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2021-05-17 16:23:44] [INFO ] Transformed 1503 places.
[2021-05-17 16:23:44] [INFO ] Transformed 1503 transitions.
[2021-05-17 16:23:44] [INFO ] Found NUPN structural information;
[2021-05-17 16:23:44] [INFO ] Parsed PT model containing 1503 places and 1503 transitions in 403 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 16:23:44] [INFO ] Initial state test concluded for 4 properties.
FORMULA ShieldRVt-PT-030B-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 324 places :
Symmetric choice reduction at 0 with 324 rule applications. Total rules 324 place count 1179 transition count 1179
Iterating global reduction 0 with 324 rules applied. Total rules applied 648 place count 1179 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 649 place count 1178 transition count 1178
Iterating global reduction 0 with 1 rules applied. Total rules applied 650 place count 1178 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 651 place count 1177 transition count 1177
Iterating global reduction 0 with 1 rules applied. Total rules applied 652 place count 1177 transition count 1177
Applied a total of 652 rules in 791 ms. Remains 1177 /1503 variables (removed 326) and now considering 1177/1503 (removed 326) transitions.
// Phase 1: matrix 1177 rows 1177 cols
[2021-05-17 16:23:45] [INFO ] Computed 121 place invariants in 48 ms
[2021-05-17 16:23:46] [INFO ] Implicit Places using invariants in 915 ms returned []
// Phase 1: matrix 1177 rows 1177 cols
[2021-05-17 16:23:46] [INFO ] Computed 121 place invariants in 12 ms
[2021-05-17 16:23:48] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 2671 ms to find 0 implicit places.
// Phase 1: matrix 1177 rows 1177 cols
[2021-05-17 16:23:48] [INFO ] Computed 121 place invariants in 9 ms
[2021-05-17 16:23:49] [INFO ] Dead Transitions using invariants and state equation in 1477 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1177/1503 places, 1177/1503 transitions.
[2021-05-17 16:23:50] [INFO ] Flatten gal took : 187 ms
[2021-05-17 16:23:50] [INFO ] Flatten gal took : 92 ms
[2021-05-17 16:23:50] [INFO ] Input system was already deterministic with 1177 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 577 ms. (steps per millisecond=173 ) properties (out of 13) seen :12
Running SMT prover for 1 properties.
// Phase 1: matrix 1177 rows 1177 cols
[2021-05-17 16:23:51] [INFO ] Computed 121 place invariants in 8 ms
[2021-05-17 16:23:51] [INFO ] [Real]Absence check using 121 positive place invariants in 100 ms returned sat
[2021-05-17 16:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 16:23:52] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2021-05-17 16:23:53] [INFO ] Deduced a trap composed of 21 places in 493 ms of which 6 ms to minimize.
[2021-05-17 16:23:53] [INFO ] Deduced a trap composed of 22 places in 551 ms of which 3 ms to minimize.
[2021-05-17 16:23:54] [INFO ] Deduced a trap composed of 26 places in 420 ms of which 3 ms to minimize.
[2021-05-17 16:23:54] [INFO ] Deduced a trap composed of 26 places in 595 ms of which 6 ms to minimize.
[2021-05-17 16:23:55] [INFO ] Deduced a trap composed of 34 places in 493 ms of which 2 ms to minimize.
[2021-05-17 16:23:56] [INFO ] Deduced a trap composed of 31 places in 473 ms of which 2 ms to minimize.
[2021-05-17 16:23:56] [INFO ] Deduced a trap composed of 30 places in 353 ms of which 2 ms to minimize.
[2021-05-17 16:23:56] [INFO ] Deduced a trap composed of 21 places in 331 ms of which 1 ms to minimize.
[2021-05-17 16:23:57] [INFO ] Deduced a trap composed of 31 places in 398 ms of which 1 ms to minimize.
[2021-05-17 16:23:57] [INFO ] Deduced a trap composed of 35 places in 314 ms of which 1 ms to minimize.
[2021-05-17 16:23:58] [INFO ] Deduced a trap composed of 26 places in 342 ms of which 2 ms to minimize.
[2021-05-17 16:23:58] [INFO ] Deduced a trap composed of 34 places in 391 ms of which 2 ms to minimize.
[2021-05-17 16:23:59] [INFO ] Deduced a trap composed of 43 places in 385 ms of which 1 ms to minimize.
[2021-05-17 16:23:59] [INFO ] Deduced a trap composed of 33 places in 362 ms of which 1 ms to minimize.
[2021-05-17 16:24:00] [INFO ] Deduced a trap composed of 38 places in 337 ms of which 1 ms to minimize.
[2021-05-17 16:24:00] [INFO ] Deduced a trap composed of 38 places in 336 ms of which 3 ms to minimize.
[2021-05-17 16:24:00] [INFO ] Deduced a trap composed of 34 places in 307 ms of which 1 ms to minimize.
[2021-05-17 16:24:01] [INFO ] Deduced a trap composed of 25 places in 313 ms of which 1 ms to minimize.
[2021-05-17 16:24:01] [INFO ] Deduced a trap composed of 35 places in 313 ms of which 1 ms to minimize.
[2021-05-17 16:24:02] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 1 ms to minimize.
[2021-05-17 16:24:02] [INFO ] Deduced a trap composed of 38 places in 246 ms of which 1 ms to minimize.
[2021-05-17 16:24:02] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 12 ms to minimize.
[2021-05-17 16:24:03] [INFO ] Deduced a trap composed of 46 places in 262 ms of which 1 ms to minimize.
[2021-05-17 16:24:03] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 10813 ms
[2021-05-17 16:24:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 16:24:03] [INFO ] [Nat]Absence check using 121 positive place invariants in 132 ms returned sat
[2021-05-17 16:24:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 16:24:04] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2021-05-17 16:24:05] [INFO ] Deduced a trap composed of 21 places in 436 ms of which 1 ms to minimize.
[2021-05-17 16:24:05] [INFO ] Deduced a trap composed of 22 places in 382 ms of which 1 ms to minimize.
[2021-05-17 16:24:06] [INFO ] Deduced a trap composed of 26 places in 357 ms of which 1 ms to minimize.
[2021-05-17 16:24:06] [INFO ] Deduced a trap composed of 26 places in 290 ms of which 0 ms to minimize.
[2021-05-17 16:24:06] [INFO ] Deduced a trap composed of 34 places in 456 ms of which 1 ms to minimize.
[2021-05-17 16:24:07] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 1 ms to minimize.
[2021-05-17 16:24:07] [INFO ] Deduced a trap composed of 30 places in 419 ms of which 2 ms to minimize.
[2021-05-17 16:24:08] [INFO ] Deduced a trap composed of 21 places in 304 ms of which 2 ms to minimize.
[2021-05-17 16:24:08] [INFO ] Deduced a trap composed of 31 places in 397 ms of which 1 ms to minimize.
[2021-05-17 16:24:09] [INFO ] Deduced a trap composed of 35 places in 360 ms of which 1 ms to minimize.
[2021-05-17 16:24:09] [INFO ] Deduced a trap composed of 26 places in 251 ms of which 1 ms to minimize.
[2021-05-17 16:24:09] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 1 ms to minimize.
[2021-05-17 16:24:10] [INFO ] Deduced a trap composed of 43 places in 358 ms of which 1 ms to minimize.
[2021-05-17 16:24:10] [INFO ] Deduced a trap composed of 33 places in 337 ms of which 1 ms to minimize.
[2021-05-17 16:24:11] [INFO ] Deduced a trap composed of 38 places in 330 ms of which 1 ms to minimize.
[2021-05-17 16:24:11] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 1 ms to minimize.
[2021-05-17 16:24:11] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 1 ms to minimize.
[2021-05-17 16:24:12] [INFO ] Deduced a trap composed of 25 places in 317 ms of which 1 ms to minimize.
[2021-05-17 16:24:12] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 1 ms to minimize.
[2021-05-17 16:24:12] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 1 ms to minimize.
[2021-05-17 16:24:13] [INFO ] Deduced a trap composed of 38 places in 289 ms of which 1 ms to minimize.
[2021-05-17 16:24:13] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 1 ms to minimize.
[2021-05-17 16:24:13] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 2 ms to minimize.
[2021-05-17 16:24:13] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 9100 ms
[2021-05-17 16:24:13] [INFO ] Computed and/alt/rep : 1176/1720/1176 causal constraints (skipped 0 transitions) in 127 ms.
[2021-05-17 16:24:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1177/1177 places, 1177/1177 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1171 transition count 1171
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1171 transition count 1171
Applied a total of 12 rules in 157 ms. Remains 1171 /1177 variables (removed 6) and now considering 1171/1177 (removed 6) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2021-05-17 16:24:23] [INFO ] Computed 121 place invariants in 8 ms
[2021-05-17 16:24:24] [INFO ] Implicit Places using invariants in 693 ms returned []
// Phase 1: matrix 1171 rows 1171 cols
[2021-05-17 16:24:24] [INFO ] Computed 121 place invariants in 7 ms
[2021-05-17 16:24:26] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 2234 ms to find 0 implicit places.
// Phase 1: matrix 1171 rows 1171 cols
[2021-05-17 16:24:26] [INFO ] Computed 121 place invariants in 5 ms
[2021-05-17 16:24:27] [INFO ] Dead Transitions using invariants and state equation in 1221 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1171/1177 places, 1171/1177 transitions.
Stuttering acceptance computed with spot in 394 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldRVt-PT-030B-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(NEQ s633 1), p0:(EQ s937 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 245 steps with 0 reset in 19 ms.
FORMULA ShieldRVt-PT-030B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-02 finished in 4133 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 1177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1177/1177 places, 1177/1177 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1171 transition count 1171
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1171 transition count 1171
Applied a total of 12 rules in 119 ms. Remains 1171 /1177 variables (removed 6) and now considering 1171/1177 (removed 6) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2021-05-17 16:24:27] [INFO ] Computed 121 place invariants in 6 ms
[2021-05-17 16:24:28] [INFO ] Implicit Places using invariants in 446 ms returned []
// Phase 1: matrix 1171 rows 1171 cols
[2021-05-17 16:24:28] [INFO ] Computed 121 place invariants in 4 ms
[2021-05-17 16:24:29] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
// Phase 1: matrix 1171 rows 1171 cols
[2021-05-17 16:24:29] [INFO ] Computed 121 place invariants in 6 ms
[2021-05-17 16:24:31] [INFO ] Dead Transitions using invariants and state equation in 1400 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1171/1177 places, 1171/1177 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-06 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:(NEQ s203 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]]
Product exploration explored 100000 steps with 1 reset in 667 ms.
Product exploration explored 100000 steps with 0 reset in 737 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 499 ms.
Product exploration explored 100000 steps with 2 reset in 600 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 1171 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1171/1171 places, 1171/1171 transitions.
Performed 329 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 329 rules applied. Total rules applied 329 place count 1171 transition count 1171
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 149 Pre rules applied. Total rules applied 329 place count 1171 transition count 1380
Deduced a syphon composed of 478 places in 2 ms
Iterating global reduction 1 with 149 rules applied. Total rules applied 478 place count 1171 transition count 1380
Performed 331 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 809 places in 8 ms
Iterating global reduction 1 with 331 rules applied. Total rules applied 809 place count 1171 transition count 1381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 810 place count 1171 transition count 1380
Renaming transitions due to excessive name length > 1024 char.
Discarding 210 places :
Symmetric choice reduction at 2 with 210 rule applications. Total rules 1020 place count 961 transition count 1170
Deduced a syphon composed of 599 places in 3 ms
Iterating global reduction 2 with 210 rules applied. Total rules applied 1230 place count 961 transition count 1170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 600 places in 4 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1231 place count 961 transition count 1170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1233 place count 959 transition count 1168
Deduced a syphon composed of 598 places in 5 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1235 place count 959 transition count 1168
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -718
Deduced a syphon composed of 687 places in 2 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 1324 place count 959 transition count 1886
Discarding 89 places :
Symmetric choice reduction at 2 with 89 rule applications. Total rules 1413 place count 870 transition count 1708
Deduced a syphon composed of 598 places in 2 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 1502 place count 870 transition count 1708
Deduced a syphon composed of 598 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1511 place count 870 transition count 1699
Deduced a syphon composed of 598 places in 1 ms
Applied a total of 1511 rules in 1246 ms. Remains 870 /1171 variables (removed 301) and now considering 1699/1171 (removed -528) transitions.
[2021-05-17 16:24:35] [INFO ] Redundant transitions in 191 ms returned []
// Phase 1: matrix 1699 rows 870 cols
[2021-05-17 16:24:35] [INFO ] Computed 121 place invariants in 12 ms
[2021-05-17 16:24:36] [INFO ] Dead Transitions using invariants and state equation in 1023 ms returned []
Finished structural reductions, in 1 iterations. Remains : 870/1171 places, 1699/1171 transitions.
Product exploration explored 100000 steps with 11 reset in 700 ms.
Product exploration explored 100000 steps with 13 reset in 642 ms.
[2021-05-17 16:24:38] [INFO ] Flatten gal took : 57 ms
[2021-05-17 16:24:38] [INFO ] Flatten gal took : 56 ms
[2021-05-17 16:24:38] [INFO ] Time to serialize gal into /tmp/LTL13146986061622942005.gal : 25 ms
[2021-05-17 16:24:38] [INFO ] Time to serialize properties into /tmp/LTL1463235067437968659.ltl : 1 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/LTL13146986061622942005.gal, -t, CGAL, -LTL, /tmp/LTL1463235067437968659.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/LTL13146986061622942005.gal -t CGAL -LTL /tmp/LTL1463235067437968659.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G("(p251!=1)"))))
Formula 0 simplified : !XG"(p251!=1)"
Detected timeout of ITS tools.
[2021-05-17 16:24:53] [INFO ] Flatten gal took : 53 ms
[2021-05-17 16:24:53] [INFO ] Applying decomposition
[2021-05-17 16:24:53] [INFO ] Flatten gal took : 45 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/graph15279081815037750584.txt, -o, /tmp/graph15279081815037750584.bin, -w, /tmp/graph15279081815037750584.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/graph15279081815037750584.bin, -l, -1, -v, -w, /tmp/graph15279081815037750584.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:24:53] [INFO ] Decomposing Gal with order
[2021-05-17 16:24:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:24:54] [INFO ] Removed a total of 302 redundant transitions.
[2021-05-17 16:24:54] [INFO ] Flatten gal took : 239 ms
[2021-05-17 16:24:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2021-05-17 16:24:54] [INFO ] Time to serialize gal into /tmp/LTL14386800445563159072.gal : 40 ms
[2021-05-17 16:24:54] [INFO ] Time to serialize properties into /tmp/LTL8134893717393352565.ltl : 1 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/LTL14386800445563159072.gal, -t, CGAL, -LTL, /tmp/LTL8134893717393352565.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/LTL14386800445563159072.gal -t CGAL -LTL /tmp/LTL8134893717393352565.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G("(i8.i2.u82.p251!=1)"))))
Formula 0 simplified : !XG"(i8.i2.u82.p251!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3721548267861070879
[2021-05-17 16:25:09] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3721548267861070879
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3721548267861070879]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3721548267861070879] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3721548267861070879] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldRVt-PT-030B-06 finished in 42794 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1177/1177 places, 1177/1177 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1172 transition count 1172
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1172 transition count 1172
Applied a total of 10 rules in 171 ms. Remains 1172 /1177 variables (removed 5) and now considering 1172/1177 (removed 5) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2021-05-17 16:25:10] [INFO ] Computed 121 place invariants in 5 ms
[2021-05-17 16:25:11] [INFO ] Implicit Places using invariants in 556 ms returned []
// Phase 1: matrix 1172 rows 1172 cols
[2021-05-17 16:25:11] [INFO ] Computed 121 place invariants in 4 ms
[2021-05-17 16:25:12] [INFO ] Implicit Places using invariants and state equation in 1274 ms returned []
Implicit Place search using SMT with State Equation took 1834 ms to find 0 implicit places.
// Phase 1: matrix 1172 rows 1172 cols
[2021-05-17 16:25:12] [INFO ] Computed 121 place invariants in 3 ms
[2021-05-17 16:25:13] [INFO ] Dead Transitions using invariants and state equation in 1146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1172/1177 places, 1172/1177 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s1144 0) (NEQ s104 1) (OR (NEQ s466 0) (NEQ s933 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-08 finished in 3288 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 1177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1177/1177 places, 1177/1177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 329 transitions
Trivial Post-agglo rules discarded 329 transitions
Performed 329 trivial Post agglomeration. Transition count delta: 329
Iterating post reduction 0 with 329 rules applied. Total rules applied 329 place count 1176 transition count 847
Reduce places removed 329 places and 0 transitions.
Iterating post reduction 1 with 329 rules applied. Total rules applied 658 place count 847 transition count 847
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 658 place count 847 transition count 610
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1132 place count 610 transition count 610
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1135 place count 607 transition count 607
Iterating global reduction 2 with 3 rules applied. Total rules applied 1138 place count 607 transition count 607
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1138 place count 607 transition count 605
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1142 place count 605 transition count 605
Performed 269 Post agglomeration using F-continuation condition.Transition count delta: 269
Deduced a syphon composed of 269 places in 0 ms
Reduce places removed 269 places and 0 transitions.
Iterating global reduction 2 with 538 rules applied. Total rules applied 1680 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1681 place count 336 transition count 335
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1683 place count 335 transition count 334
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1859 place count 247 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1860 place count 246 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1861 place count 245 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1862 place count 244 transition count 418
Applied a total of 1862 rules in 216 ms. Remains 244 /1177 variables (removed 933) and now considering 418/1177 (removed 759) transitions.
// Phase 1: matrix 418 rows 244 cols
[2021-05-17 16:25:13] [INFO ] Computed 120 place invariants in 1 ms
[2021-05-17 16:25:14] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 418 rows 244 cols
[2021-05-17 16:25:14] [INFO ] Computed 120 place invariants in 1 ms
[2021-05-17 16:25:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 16:25:14] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2021-05-17 16:25:14] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 418 rows 244 cols
[2021-05-17 16:25:14] [INFO ] Computed 120 place invariants in 1 ms
[2021-05-17 16:25:14] [INFO ] Dead Transitions using invariants and state equation in 259 ms returned []
Finished structural reductions, in 1 iterations. Remains : 244/1177 places, 418/1177 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s169 0) (NEQ s119 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-10 finished in 1287 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 1177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1177/1177 places, 1177/1177 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1172 transition count 1172
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1172 transition count 1172
Applied a total of 10 rules in 99 ms. Remains 1172 /1177 variables (removed 5) and now considering 1172/1177 (removed 5) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2021-05-17 16:25:15] [INFO ] Computed 121 place invariants in 4 ms
[2021-05-17 16:25:15] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 1172 rows 1172 cols
[2021-05-17 16:25:15] [INFO ] Computed 121 place invariants in 4 ms
[2021-05-17 16:25:16] [INFO ] Implicit Places using invariants and state equation in 1340 ms returned []
Implicit Place search using SMT with State Equation took 1716 ms to find 0 implicit places.
// Phase 1: matrix 1172 rows 1172 cols
[2021-05-17 16:25:16] [INFO ] Computed 121 place invariants in 8 ms
[2021-05-17 16:25:18] [INFO ] Dead Transitions using invariants and state equation in 1398 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1172/1177 places, 1172/1177 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldRVt-PT-030B-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s164 0) (EQ s1099 1)), p0:(AND (EQ s577 0) (EQ s639 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-12 finished in 3378 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p0) U (G((G(p1)||X(p0)))||((G(p1)||X(p0))&&p2))) U (G((X(p0) U (G((G(p1)||X(p0)))||((G(p1)||X(p0))&&p3))))||(X(p4)&&(X(p0) U (G((G(p1)||X(p0)))||((G(p1)||X(p0))&&p5)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1177/1177 places, 1177/1177 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1173 transition count 1173
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1173 transition count 1173
Applied a total of 8 rules in 97 ms. Remains 1173 /1177 variables (removed 4) and now considering 1173/1177 (removed 4) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2021-05-17 16:25:18] [INFO ] Computed 121 place invariants in 5 ms
[2021-05-17 16:25:19] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 1173 rows 1173 cols
[2021-05-17 16:25:19] [INFO ] Computed 121 place invariants in 4 ms
[2021-05-17 16:25:20] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
// Phase 1: matrix 1173 rows 1173 cols
[2021-05-17 16:25:20] [INFO ] Computed 121 place invariants in 3 ms
[2021-05-17 16:25:21] [INFO ] Dead Transitions using invariants and state equation in 1206 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1173/1177 places, 1173/1177 transitions.
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)), true, (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030B-13 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p5), acceptance={} source=0 dest: 4}, { cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p4)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p4)), acceptance={} source=3 dest: 2}, { cond=(NOT p4), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p5) (NOT p4)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p4)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p5), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 1}, { cond=p1, acceptance={} source=8 dest: 2}, { cond=(NOT p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (NEQ s994 0) (NEQ s578 1)), p5:(AND (NEQ s664 0) (NEQ s717 1)), p2:(AND (NEQ s664 0) (NEQ s717 1)), p0:(AND (NEQ s578 0) (NEQ s994 1)), p4:(NEQ s340 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 394 steps with 0 reset in 3 ms.
FORMULA ShieldRVt-PT-030B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-13 finished in 3569 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 1177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1177/1177 places, 1177/1177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 329 transitions
Trivial Post-agglo rules discarded 329 transitions
Performed 329 trivial Post agglomeration. Transition count delta: 329
Iterating post reduction 0 with 329 rules applied. Total rules applied 329 place count 1176 transition count 847
Reduce places removed 329 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 331 rules applied. Total rules applied 660 place count 847 transition count 845
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 662 place count 845 transition count 845
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 662 place count 845 transition count 608
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1136 place count 608 transition count 608
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1140 place count 604 transition count 604
Iterating global reduction 3 with 4 rules applied. Total rules applied 1144 place count 604 transition count 604
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1144 place count 604 transition count 602
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1148 place count 602 transition count 602
Performed 266 Post agglomeration using F-continuation condition.Transition count delta: 266
Deduced a syphon composed of 266 places in 0 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 3 with 532 rules applied. Total rules applied 1680 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1681 place count 336 transition count 335
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1683 place count 335 transition count 334
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1859 place count 247 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1860 place count 246 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1861 place count 245 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1862 place count 244 transition count 418
Applied a total of 1862 rules in 148 ms. Remains 244 /1177 variables (removed 933) and now considering 418/1177 (removed 759) transitions.
// Phase 1: matrix 418 rows 244 cols
[2021-05-17 16:25:22] [INFO ] Computed 120 place invariants in 1 ms
[2021-05-17 16:25:22] [INFO ] Implicit Places using invariants in 343 ms returned []
// Phase 1: matrix 418 rows 244 cols
[2021-05-17 16:25:22] [INFO ] Computed 120 place invariants in 1 ms
[2021-05-17 16:25:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-17 16:25:23] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 974 ms to find 0 implicit places.
[2021-05-17 16:25:23] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 418 rows 244 cols
[2021-05-17 16:25:23] [INFO ] Computed 120 place invariants in 0 ms
[2021-05-17 16:25:23] [INFO ] Dead Transitions using invariants and state equation in 296 ms returned []
Finished structural reductions, in 1 iterations. Remains : 244/1177 places, 418/1177 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s105 0) (NEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-14 finished in 1475 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 1177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1177/1177 places, 1177/1177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 330 place count 1176 transition count 846
Reduce places removed 330 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 331 rules applied. Total rules applied 661 place count 846 transition count 845
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 662 place count 845 transition count 845
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 235 Pre rules applied. Total rules applied 662 place count 845 transition count 610
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 3 with 470 rules applied. Total rules applied 1132 place count 610 transition count 610
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1136 place count 606 transition count 606
Iterating global reduction 3 with 4 rules applied. Total rules applied 1140 place count 606 transition count 606
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1140 place count 606 transition count 604
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1144 place count 604 transition count 604
Performed 267 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 267 places in 0 ms
Reduce places removed 267 places and 0 transitions.
Iterating global reduction 3 with 534 rules applied. Total rules applied 1678 place count 337 transition count 336
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1856 place count 248 transition count 424
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1857 place count 247 transition count 423
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1858 place count 246 transition count 422
Applied a total of 1858 rules in 133 ms. Remains 246 /1177 variables (removed 931) and now considering 422/1177 (removed 755) transitions.
// Phase 1: matrix 422 rows 246 cols
[2021-05-17 16:25:23] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-17 16:25:23] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 422 rows 246 cols
[2021-05-17 16:25:23] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-17 16:25:23] [INFO ] State equation strengthened by 168 read => feed constraints.
[2021-05-17 16:25:24] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
[2021-05-17 16:25:24] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 422 rows 246 cols
[2021-05-17 16:25:24] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-17 16:25:25] [INFO ] Dead Transitions using invariants and state equation in 262 ms returned []
Finished structural reductions, in 1 iterations. Remains : 246/1177 places, 422/1177 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-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 s83 0) (OR (EQ s132 0) (EQ s239 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 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-15 finished in 1765 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15355401025074820566
[2021-05-17 16:25:25] [INFO ] Computing symmetric may disable matrix : 1177 transitions.
[2021-05-17 16:25:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 16:25:25] [INFO ] Computing symmetric may enable matrix : 1177 transitions.
[2021-05-17 16:25:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 16:25:25] [INFO ] Applying decomposition
[2021-05-17 16:25:25] [INFO ] Flatten gal took : 50 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/graph4046738270597790826.txt, -o, /tmp/graph4046738270597790826.bin, -w, /tmp/graph4046738270597790826.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/graph4046738270597790826.bin, -l, -1, -v, -w, /tmp/graph4046738270597790826.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:25:25] [INFO ] Decomposing Gal with order
[2021-05-17 16:25:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:25:25] [INFO ] Computing Do-Not-Accords matrix : 1177 transitions.
[2021-05-17 16:25:25] [INFO ] Computation of Completed DNA matrix. took 87 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 16:25:25] [INFO ] Built C files in 422ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15355401025074820566
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15355401025074820566]
[2021-05-17 16:25:25] [INFO ] Removed a total of 295 redundant transitions.
[2021-05-17 16:25:25] [INFO ] Flatten gal took : 162 ms
[2021-05-17 16:25:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-17 16:25:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality18301008545828675160.gal : 14 ms
[2021-05-17 16:25:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality1966080999393556834.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/LTLCardinality18301008545828675160.gal, -t, CGAL, -LTL, /tmp/LTLCardinality1966080999393556834.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/LTLCardinality18301008545828675160.gal -t CGAL -LTL /tmp/LTLCardinality1966080999393556834.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G("(i10.i2.u81.p251!=1)"))))
Formula 0 simplified : !XG"(i10.i2.u81.p251!=1)"
Compilation finished in 15814 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15355401025074820566]
Link finished in 91 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15355401025074820566]
WARNING : LTSmin timed out (>450 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15355401025074820566]
Retrying LTSmin with larger timeout 3600 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15355401025074820566]
Detected timeout of ITS tools.
[2021-05-17 16:45:59] [INFO ] Applying decomposition
[2021-05-17 16:45:59] [INFO ] Flatten gal took : 128 ms
[2021-05-17 16:45:59] [INFO ] Decomposing Gal with order
[2021-05-17 16:45:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:45:59] [INFO ] Removed a total of 89 redundant transitions.
[2021-05-17 16:45:59] [INFO ] Flatten gal took : 145 ms
[2021-05-17 16:46:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 16:46:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality3719753487174174520.gal : 157 ms
[2021-05-17 16:46:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality2198437244719192866.ltl : 1 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/LTLCardinality3719753487174174520.gal, -t, CGAL, -LTL, /tmp/LTLCardinality2198437244719192866.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/LTLCardinality3719753487174174520.gal -t CGAL -LTL /tmp/LTLCardinality2198437244719192866.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u63.p251!=1)"))))
Formula 0 simplified : !XG"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u63.p251!=1)"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.144: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.144: LTL layer: formula: X([]((LTLAPp0==true)))
pins2lts-mc-linux64( 4/ 8), 0.148: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.155: "X([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.156: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.156: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.158: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.157: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.157: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.159: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.168: buchi has 3 states
pins2lts-mc-linux64( 3/ 8), 0.176: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.199: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.396: DFS-FIFO for weak LTL, using special progress label 1179
pins2lts-mc-linux64( 0/ 8), 0.396: There are 1180 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.396: State length is 1178, there are 1181 groups
pins2lts-mc-linux64( 0/ 8), 0.396: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.396: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.396: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.396: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.618: ~1 levels ~960 states ~4832 transitions
pins2lts-mc-linux64( 6/ 8), 0.690: ~1 levels ~1920 states ~10536 transitions
pins2lts-mc-linux64( 6/ 8), 0.836: ~1 levels ~3840 states ~22272 transitions
pins2lts-mc-linux64( 6/ 8), 1.185: ~1 levels ~7680 states ~48904 transitions
pins2lts-mc-linux64( 6/ 8), 1.842: ~1 levels ~15360 states ~104320 transitions
pins2lts-mc-linux64( 3/ 8), 3.190: ~1 levels ~30720 states ~247320 transitions
pins2lts-mc-linux64( 3/ 8), 5.926: ~1 levels ~61440 states ~553424 transitions
pins2lts-mc-linux64( 3/ 8), 11.248: ~1 levels ~122880 states ~1099400 transitions
pins2lts-mc-linux64( 3/ 8), 23.630: ~1 levels ~245760 states ~2496344 transitions
pins2lts-mc-linux64( 3/ 8), 47.205: ~1 levels ~491520 states ~4935592 transitions
pins2lts-mc-linux64( 3/ 8), 98.559: ~1 levels ~983040 states ~10758488 transitions
pins2lts-mc-linux64( 6/ 8), 200.979: ~1 levels ~1966080 states ~21647152 transitions
pins2lts-mc-linux64( 1/ 8), 406.702: ~1 levels ~3932160 states ~45011680 transitions
pins2lts-mc-linux64( 1/ 8), 840.440: ~1 levels ~7864320 states ~96545840 transitions
pins2lts-mc-linux64( 7/ 8), 879.251: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 879.441:
pins2lts-mc-linux64( 0/ 8), 879.441: mean standard work distribution: 18.1% (states) 19.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 879.442:
pins2lts-mc-linux64( 0/ 8), 879.442: Explored 7532155 states 95047854 transitions, fanout: 12.619
pins2lts-mc-linux64( 0/ 8), 879.442: Total exploration time 879.020 sec (878.860 sec minimum, 878.922 sec on average)
pins2lts-mc-linux64( 0/ 8), 879.442: States per second: 8569, Transitions per second: 108129
pins2lts-mc-linux64( 0/ 8), 879.442:
pins2lts-mc-linux64( 0/ 8), 879.442: Progress states detected: 18761327
pins2lts-mc-linux64( 0/ 8), 879.442: Redundant explorations: -59.8529
pins2lts-mc-linux64( 0/ 8), 879.442:
pins2lts-mc-linux64( 0/ 8), 879.442: Queue width: 8B, total height: 17228754, memory: 131.44MB
pins2lts-mc-linux64( 0/ 8), 879.442: Tree memory: 399.1MB, 22.3 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 879.442: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 879.442: Stored 1204 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 879.442: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 879.442: Est. total memory use: 530.6MB (~1155.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15355401025074820566]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15355401025074820566]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is NOT exact ! Due to transitions t1441, i0.t1384, i0.i0.t1439, i0.i0.i0.t1386, i0.i0.i0.i0.t1437, i0.i0.i0.i0.i0.t1388, i0.i0.i0.i0.i0.i0.t1435, i0.i0.i0.i0.i0.i0.i0.t1390, i0.i0.i0.i0.i0.i0.i0.i0.t1433, i0.i0.i0.i0.i0.i0.i0.i0.i0.t1392, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1431, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1394, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1396, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1398, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1425, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1400, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1423, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1402, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1421, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1404, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1419, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1406, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1417, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1408, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1415, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1410, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1413, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u30.t1380, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u37.t1337, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u37.t1344, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u36.t1349, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u36.t1356, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u34.t1370, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u34.t1377, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u35.t1361, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u35.t1367, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u44.t1291, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u44.t1298, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u43.t1303, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u43.t1310, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u41.t1324, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u41.t1331, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u42.t1315, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u42.t1321, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u51.t1245, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u51.t1252, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u50.t1257, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u50.t1264, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u48.t1278, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u48.t1285, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u49.t1269, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u49.t1275, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u58.t1199, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u58.t1206, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u57.t1211, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u57.t1218, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u55.t1232, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u55.t1239, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u56.t1223, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u56.t1229, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u65.t1153, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u65.t1160, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u64.t1165, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u64.t1172, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u62.t1186, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u62.t1193, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u63.t1177, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u63.t1183, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u72.t1107, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u72.t1114, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u71.t1119, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u71.t1126, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u69.t1140, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u69.t1147, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u70.t1131, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u70.t1137, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u79.t1061, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u79.t1068, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u78.t1073, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u78.t1080, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u76.t1094, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u76.t1101, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u77.t1085, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u77.t1091, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u86.t1015, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u86.t1022, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u85.t1027, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u85.t1034, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u83.t1048, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u83.t1055, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u84.t1039, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u84.t1045, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u93.t969, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u93.t976, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u92.t981, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u92.t988, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u90.t1002, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u90.t1009, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u91.t993, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u91.t999, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u100.t923, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u100.t930, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u99.t935, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u99.t942, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u97.t956, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u97.t963, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u98.t947, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u98.t953, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u107.t877, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u107.t884, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u106.t889, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u106.t896, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u104.t910, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u104.t917, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u105.t901, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u105.t907, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u114.t831, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u114.t838, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u113.t843, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u113.t850, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u111.t864, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u111.t871, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u112.t855, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u112.t860, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u112.t861, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u112.t862, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u121.t785, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u121.t792, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u120.t797, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u120.t804, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u118.t818, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u118.t825, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u119.t809, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u119.t815, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u128.t739, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u128.t746, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u127.t751, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u127.t758, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u125.t772, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u125.t779, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u126.t763, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u126.t769, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u135.t693, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u135.t700, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u134.t705, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u134.t711, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u134.t713, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u132.t727, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u132.t733, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u132.t734, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u133.t717, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u133.t723, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u142.t647, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u142.t654, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u141.t659, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u141.t666, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u139.t680, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u139.t687, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u140.t671, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u140.t677, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u149.t601, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u149.t608, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u148.t613, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u148.t619, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u148.t621, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u146.t634, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u146.t641, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u147.t625, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u147.t631, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u156.t555, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u156.t562, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u156.t564, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u155.t567, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u155.t574, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u153.t588, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u153.t595, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u154.t579, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u154.t585, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u163.t509, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u163.t516, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u162.t521, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u162.t528, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u160.t542, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u160.t549, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u161.t533, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u161.t539, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u170.t463, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u170.t470, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u169.t475, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u169.t482, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u167.t496, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u167.t503, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u168.t487, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u168.t493, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u177.t417, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u177.t424, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u176.t429, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u176.t436, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u174.t450, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u174.t457, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u175.t442, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u175.t448, i0.i0.i0.i0.i0.i0.i0.i0.i1.u184.t371, i0.i0.i0.i0.i0.i0.i0.i0.i1.u184.t378, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u183.t383, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u183.t390, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u181.t404, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u181.t411, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u182.t395, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u182.t401, i0.i0.i0.i0.i0.i0.i0.i1.u191.t325, i0.i0.i0.i0.i0.i0.i0.i1.u191.t332, i0.i0.i0.i0.i0.i0.i0.i1.i0.u190.t337, i0.i0.i0.i0.i0.i0.i0.i1.i0.u190.t344, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u188.t358, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u188.t365, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u189.t349, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u189.t355, i0.i0.i0.i0.i0.i0.i1.u198.t279, i0.i0.i0.i0.i0.i0.i1.u198.t286, i0.i0.i0.i0.i0.i0.i1.i0.u197.t291, i0.i0.i0.i0.i0.i0.i1.i0.u197.t298, i0.i0.i0.i0.i0.i0.i1.i0.i0.u195.t312, i0.i0.i0.i0.i0.i0.i1.i0.i0.u195.t319, i0.i0.i0.i0.i0.i0.i1.i0.i0.u196.t303, i0.i0.i0.i0.i0.i0.i1.i0.i0.u196.t309, i0.i0.i0.i0.i0.i1.u205.t233, i0.i0.i0.i0.i0.i1.u205.t240, i0.i0.i0.i0.i0.i1.i0.u204.t245, i0.i0.i0.i0.i0.i1.i0.u204.t252, i0.i0.i0.i0.i0.i1.i0.i0.u202.t266, i0.i0.i0.i0.i0.i1.i0.i0.u202.t273, i0.i0.i0.i0.i0.i1.i0.i0.u203.t257, i0.i0.i0.i0.i0.i1.i0.i0.u203.t263, i0.i0.i0.i0.i1.u212.t187, i0.i0.i0.i0.i1.u212.t194, i0.i0.i0.i0.i1.i0.u211.t199, i0.i0.i0.i0.i1.i0.u211.t206, i0.i0.i0.i0.i1.i0.i0.u209.t220, i0.i0.i0.i0.i1.i0.i0.u209.t227, i0.i0.i0.i0.i1.i0.i0.u210.t211, i0.i0.i0.i0.i1.i0.i0.u210.t217, i0.i0.i0.i1.u219.t141, i0.i0.i0.i1.u219.t148, i0.i0.i0.i1.i0.u218.t153, i0.i0.i0.i1.i0.u218.t160, i0.i0.i0.i1.i0.i0.u216.t174, i0.i0.i0.i1.i0.i0.u216.t181, i0.i0.i0.i1.i0.i0.u217.t165, i0.i0.i0.i1.i0.i0.u217.t171, i0.i0.i1.u226.t95, i0.i0.i1.u226.t102, i0.i0.i1.i0.u225.t107, i0.i0.i1.i0.u225.t114, i0.i0.i1.i0.i0.u223.t128, i0.i0.i1.i0.i0.u223.t135, i0.i0.i1.i0.i0.u224.t119, i0.i0.i1.i0.i0.u224.t125, i0.i1.u233.t49, i0.i1.u233.t56, i0.i1.i0.u232.t61, i0.i1.i0.u232.t68, i0.i1.i0.i0.u230.t82, i0.i1.i0.i0.u230.t89, i0.i1.i0.i0.u231.t73, i0.i1.i0.i0.u231.t79, i1.u240.t3, i1.u240.t10, i1.i0.u239.t15, i1.i0.u239.t22, i1.i0.i0.u237.t40, i1.i0.i0.u237.t43, i1.i0.i0.u238.t27, i1.i0.i0.u238.t33, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/903/274/1177
Computing Next relation with stutter on 7.36211e+22 deadlock states
Detected timeout of ITS tools.
[2021-05-17 17:06:33] [INFO ] Flatten gal took : 49 ms
[2021-05-17 17:06:33] [INFO ] Input system was already deterministic with 1177 transitions.
[2021-05-17 17:06:33] [INFO ] Transformed 1177 places.
[2021-05-17 17:06:33] [INFO ] Transformed 1177 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 17:06:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality9058584070581647160.gal : 23 ms
[2021-05-17 17:06:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality17626562353308129226.ltl : 1 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/LTLCardinality9058584070581647160.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17626562353308129226.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLCardinality9058584070581647160.gal -t CGAL -LTL /tmp/LTLCardinality17626562353308129226.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G("(p251!=1)"))))
Formula 0 simplified : !XG"(p251!=1)"

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ShieldRVt-PT-030B"
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 ShieldRVt-PT-030B, 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 r235-smll-162106564700300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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