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

About the Execution of ITS-Tools for ShieldIIPt-PT-040B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15595.968 3600000.00 12670182.00 28200.60 FTF?TFFFFTFTTFFF 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.r216-tall-162098205100476.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-040B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205100476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K 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.1K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 12:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 12:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 686K 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 ShieldIIPt-PT-040B-00
FORMULA_NAME ShieldIIPt-PT-040B-01
FORMULA_NAME ShieldIIPt-PT-040B-02
FORMULA_NAME ShieldIIPt-PT-040B-03
FORMULA_NAME ShieldIIPt-PT-040B-04
FORMULA_NAME ShieldIIPt-PT-040B-05
FORMULA_NAME ShieldIIPt-PT-040B-06
FORMULA_NAME ShieldIIPt-PT-040B-07
FORMULA_NAME ShieldIIPt-PT-040B-08
FORMULA_NAME ShieldIIPt-PT-040B-09
FORMULA_NAME ShieldIIPt-PT-040B-10
FORMULA_NAME ShieldIIPt-PT-040B-11
FORMULA_NAME ShieldIIPt-PT-040B-12
FORMULA_NAME ShieldIIPt-PT-040B-13
FORMULA_NAME ShieldIIPt-PT-040B-14
FORMULA_NAME ShieldIIPt-PT-040B-15

=== Now, execution of the tool begins

BK_START 1621109874245

Running Version 0
[2021-05-15 20:17:55] [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-15 20:17:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 20:17:55] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2021-05-15 20:17:56] [INFO ] Transformed 2803 places.
[2021-05-15 20:17:56] [INFO ] Transformed 2603 transitions.
[2021-05-15 20:17:56] [INFO ] Found NUPN structural information;
[2021-05-15 20:17:56] [INFO ] Parsed PT model containing 2803 places and 2603 transitions in 320 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 20:17:56] [INFO ] Initial state test concluded for 2 properties.
FORMULA ShieldIIPt-PT-040B-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 2803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Discarding 435 places :
Symmetric choice reduction at 0 with 435 rule applications. Total rules 435 place count 2368 transition count 2168
Iterating global reduction 0 with 435 rules applied. Total rules applied 870 place count 2368 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 871 place count 2367 transition count 2167
Iterating global reduction 0 with 1 rules applied. Total rules applied 872 place count 2367 transition count 2167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 873 place count 2366 transition count 2166
Iterating global reduction 0 with 1 rules applied. Total rules applied 874 place count 2366 transition count 2166
Applied a total of 874 rules in 1210 ms. Remains 2366 /2803 variables (removed 437) and now considering 2166/2603 (removed 437) transitions.
// Phase 1: matrix 2166 rows 2366 cols
[2021-05-15 20:17:57] [INFO ] Computed 361 place invariants in 39 ms
[2021-05-15 20:17:58] [INFO ] Implicit Places using invariants in 982 ms returned []
// Phase 1: matrix 2166 rows 2366 cols
[2021-05-15 20:17:58] [INFO ] Computed 361 place invariants in 10 ms
[2021-05-15 20:18:00] [INFO ] Implicit Places using invariants and state equation in 1900 ms returned []
Implicit Place search using SMT with State Equation took 2908 ms to find 0 implicit places.
// Phase 1: matrix 2166 rows 2366 cols
[2021-05-15 20:18:00] [INFO ] Computed 361 place invariants in 9 ms
[2021-05-15 20:18:01] [INFO ] Dead Transitions using invariants and state equation in 1359 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2366/2803 places, 2166/2603 transitions.
[2021-05-15 20:18:02] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-15 20:18:02] [INFO ] Flatten gal took : 202 ms
FORMULA ShieldIIPt-PT-040B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 20:18:02] [INFO ] Flatten gal took : 107 ms
[2021-05-15 20:18:02] [INFO ] Input system was already deterministic with 2166 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 983 ms. (steps per millisecond=101 ) properties (out of 8) seen :6
Running SMT prover for 2 properties.
// Phase 1: matrix 2166 rows 2366 cols
[2021-05-15 20:18:03] [INFO ] Computed 361 place invariants in 7 ms
[2021-05-15 20:18:04] [INFO ] [Real]Absence check using 361 positive place invariants in 138 ms returned sat
[2021-05-15 20:18:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:18:05] [INFO ] [Real]Absence check using state equation in 897 ms returned sat
[2021-05-15 20:18:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:18:05] [INFO ] [Nat]Absence check using 361 positive place invariants in 117 ms returned sat
[2021-05-15 20:18:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:18:06] [INFO ] [Nat]Absence check using state equation in 950 ms returned sat
[2021-05-15 20:18:07] [INFO ] Deduced a trap composed of 21 places in 838 ms of which 5 ms to minimize.
[2021-05-15 20:18:08] [INFO ] Deduced a trap composed of 22 places in 518 ms of which 2 ms to minimize.
[2021-05-15 20:18:08] [INFO ] Deduced a trap composed of 21 places in 524 ms of which 2 ms to minimize.
[2021-05-15 20:18:09] [INFO ] Deduced a trap composed of 23 places in 509 ms of which 1 ms to minimize.
[2021-05-15 20:18:09] [INFO ] Deduced a trap composed of 12 places in 536 ms of which 2 ms to minimize.
[2021-05-15 20:18:10] [INFO ] Deduced a trap composed of 47 places in 532 ms of which 12 ms to minimize.
[2021-05-15 20:18:11] [INFO ] Deduced a trap composed of 30 places in 486 ms of which 1 ms to minimize.
[2021-05-15 20:18:11] [INFO ] Deduced a trap composed of 26 places in 470 ms of which 2 ms to minimize.
[2021-05-15 20:18:12] [INFO ] Deduced a trap composed of 28 places in 488 ms of which 1 ms to minimize.
[2021-05-15 20:18:12] [INFO ] Deduced a trap composed of 17 places in 485 ms of which 1 ms to minimize.
[2021-05-15 20:18:13] [INFO ] Deduced a trap composed of 21 places in 432 ms of which 1 ms to minimize.
[2021-05-15 20:18:13] [INFO ] Deduced a trap composed of 15 places in 445 ms of which 1 ms to minimize.
[2021-05-15 20:18:14] [INFO ] Deduced a trap composed of 21 places in 444 ms of which 1 ms to minimize.
[2021-05-15 20:18:14] [INFO ] Deduced a trap composed of 22 places in 442 ms of which 1 ms to minimize.
[2021-05-15 20:18:15] [INFO ] Deduced a trap composed of 28 places in 427 ms of which 1 ms to minimize.
[2021-05-15 20:18:15] [INFO ] Deduced a trap composed of 18 places in 436 ms of which 1 ms to minimize.
[2021-05-15 20:18:16] [INFO ] Deduced a trap composed of 23 places in 423 ms of which 1 ms to minimize.
[2021-05-15 20:18:16] [INFO ] Deduced a trap composed of 27 places in 418 ms of which 1 ms to minimize.
[2021-05-15 20:18:17] [INFO ] Deduced a trap composed of 20 places in 413 ms of which 1 ms to minimize.
[2021-05-15 20:18:17] [INFO ] Deduced a trap composed of 26 places in 384 ms of which 1 ms to minimize.
[2021-05-15 20:18:18] [INFO ] Deduced a trap composed of 28 places in 430 ms of which 1 ms to minimize.
[2021-05-15 20:18:18] [INFO ] Deduced a trap composed of 25 places in 400 ms of which 1 ms to minimize.
[2021-05-15 20:18:19] [INFO ] Deduced a trap composed of 25 places in 386 ms of which 1 ms to minimize.
[2021-05-15 20:18:19] [INFO ] Deduced a trap composed of 24 places in 390 ms of which 2 ms to minimize.
[2021-05-15 20:18:20] [INFO ] Deduced a trap composed of 31 places in 374 ms of which 1 ms to minimize.
[2021-05-15 20:18:20] [INFO ] Deduced a trap composed of 26 places in 366 ms of which 1 ms to minimize.
[2021-05-15 20:18:20] [INFO ] Deduced a trap composed of 26 places in 383 ms of which 1 ms to minimize.
[2021-05-15 20:18:21] [INFO ] Deduced a trap composed of 29 places in 348 ms of which 2 ms to minimize.
[2021-05-15 20:18:21] [INFO ] Deduced a trap composed of 32 places in 362 ms of which 1 ms to minimize.
[2021-05-15 20:18:22] [INFO ] Deduced a trap composed of 30 places in 336 ms of which 1 ms to minimize.
[2021-05-15 20:18:22] [INFO ] Deduced a trap composed of 34 places in 334 ms of which 1 ms to minimize.
[2021-05-15 20:18:22] [INFO ] Deduced a trap composed of 36 places in 308 ms of which 1 ms to minimize.
[2021-05-15 20:18:23] [INFO ] Deduced a trap composed of 36 places in 338 ms of which 1 ms to minimize.
[2021-05-15 20:18:23] [INFO ] Deduced a trap composed of 37 places in 302 ms of which 1 ms to minimize.
[2021-05-15 20:18:24] [INFO ] Deduced a trap composed of 39 places in 326 ms of which 1 ms to minimize.
[2021-05-15 20:18:24] [INFO ] Deduced a trap composed of 39 places in 322 ms of which 0 ms to minimize.
[2021-05-15 20:18:24] [INFO ] Deduced a trap composed of 36 places in 316 ms of which 1 ms to minimize.
[2021-05-15 20:18:25] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 1 ms to minimize.
[2021-05-15 20:18:25] [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
[2021-05-15 20:18:25] [INFO ] [Real]Absence check using 361 positive place invariants in 121 ms returned sat
[2021-05-15 20:18:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:18:26] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2021-05-15 20:18:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:18:27] [INFO ] [Nat]Absence check using 361 positive place invariants in 123 ms returned sat
[2021-05-15 20:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:18:27] [INFO ] [Nat]Absence check using state equation in 904 ms returned sat
[2021-05-15 20:18:28] [INFO ] Deduced a trap composed of 41 places in 464 ms of which 1 ms to minimize.
[2021-05-15 20:18:29] [INFO ] Deduced a trap composed of 12 places in 462 ms of which 13 ms to minimize.
[2021-05-15 20:18:29] [INFO ] Deduced a trap composed of 12 places in 463 ms of which 1 ms to minimize.
[2021-05-15 20:18:30] [INFO ] Deduced a trap composed of 25 places in 434 ms of which 1 ms to minimize.
[2021-05-15 20:18:30] [INFO ] Deduced a trap composed of 18 places in 439 ms of which 2 ms to minimize.
[2021-05-15 20:18:31] [INFO ] Deduced a trap composed of 17 places in 445 ms of which 1 ms to minimize.
[2021-05-15 20:18:31] [INFO ] Deduced a trap composed of 25 places in 469 ms of which 1 ms to minimize.
[2021-05-15 20:18:32] [INFO ] Deduced a trap composed of 30 places in 465 ms of which 1 ms to minimize.
[2021-05-15 20:18:32] [INFO ] Deduced a trap composed of 21 places in 427 ms of which 1 ms to minimize.
[2021-05-15 20:18:33] [INFO ] Deduced a trap composed of 16 places in 425 ms of which 1 ms to minimize.
[2021-05-15 20:18:33] [INFO ] Deduced a trap composed of 18 places in 429 ms of which 1 ms to minimize.
[2021-05-15 20:18:34] [INFO ] Deduced a trap composed of 35 places in 386 ms of which 2 ms to minimize.
[2021-05-15 20:18:34] [INFO ] Deduced a trap composed of 35 places in 394 ms of which 2 ms to minimize.
[2021-05-15 20:18:35] [INFO ] Deduced a trap composed of 34 places in 378 ms of which 1 ms to minimize.
[2021-05-15 20:18:35] [INFO ] Deduced a trap composed of 37 places in 355 ms of which 1 ms to minimize.
[2021-05-15 20:18:35] [INFO ] Deduced a trap composed of 34 places in 378 ms of which 1 ms to minimize.
[2021-05-15 20:18:36] [INFO ] Deduced a trap composed of 34 places in 379 ms of which 1 ms to minimize.
[2021-05-15 20:18:36] [INFO ] Deduced a trap composed of 26 places in 401 ms of which 16 ms to minimize.
[2021-05-15 20:18:37] [INFO ] Deduced a trap composed of 24 places in 338 ms of which 1 ms to minimize.
[2021-05-15 20:18:37] [INFO ] Deduced a trap composed of 36 places in 369 ms of which 1 ms to minimize.
[2021-05-15 20:18:38] [INFO ] Deduced a trap composed of 31 places in 355 ms of which 1 ms to minimize.
[2021-05-15 20:18:38] [INFO ] Deduced a trap composed of 21 places in 305 ms of which 1 ms to minimize.
[2021-05-15 20:18:38] [INFO ] Deduced a trap composed of 48 places in 324 ms of which 1 ms to minimize.
[2021-05-15 20:18:39] [INFO ] Deduced a trap composed of 22 places in 353 ms of which 1 ms to minimize.
[2021-05-15 20:18:39] [INFO ] Deduced a trap composed of 36 places in 312 ms of which 1 ms to minimize.
[2021-05-15 20:18:40] [INFO ] Deduced a trap composed of 40 places in 315 ms of which 2 ms to minimize.
[2021-05-15 20:18:40] [INFO ] Deduced a trap composed of 36 places in 326 ms of which 1 ms to minimize.
[2021-05-15 20:18:40] [INFO ] Deduced a trap composed of 37 places in 304 ms of which 3 ms to minimize.
[2021-05-15 20:18:41] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 3 ms to minimize.
[2021-05-15 20:18:41] [INFO ] Deduced a trap composed of 46 places in 310 ms of which 9 ms to minimize.
[2021-05-15 20:18:42] [INFO ] Deduced a trap composed of 41 places in 286 ms of which 1 ms to minimize.
[2021-05-15 20:18:42] [INFO ] Deduced a trap composed of 40 places in 273 ms of which 1 ms to minimize.
[2021-05-15 20:18:42] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 1 ms to minimize.
[2021-05-15 20:18:43] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 1 ms to minimize.
[2021-05-15 20:18:43] [INFO ] Deduced a trap composed of 38 places in 260 ms of which 1 ms to minimize.
[2021-05-15 20:18:43] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 1 ms to minimize.
[2021-05-15 20:18:43] [INFO ] Deduced a trap composed of 44 places in 250 ms of which 1 ms to minimize.
[2021-05-15 20:18:44] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 1 ms to minimize.
[2021-05-15 20:18:44] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 0 ms to minimize.
[2021-05-15 20:18:44] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 1 ms to minimize.
[2021-05-15 20:18:45] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 0 ms to minimize.
[2021-05-15 20:18:45] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 1 ms to minimize.
[2021-05-15 20:18:45] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 1 ms to minimize.
[2021-05-15 20:18:46] [INFO ] Deduced a trap composed of 50 places in 212 ms of which 1 ms to minimize.
[2021-05-15 20:18:46] [INFO ] Deduced a trap composed of 48 places in 200 ms of which 0 ms to minimize.
[2021-05-15 20:18:46] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 1 ms to minimize.
[2021-05-15 20:18:46] [INFO ] Deduced a trap composed of 44 places in 203 ms of which 0 ms to minimize.
[2021-05-15 20:18:46] [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 1
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(G((F(p1)||p0)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 2366 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2366/2366 places, 2166/2166 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2361 transition count 2161
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2361 transition count 2161
Applied a total of 10 rules in 254 ms. Remains 2361 /2366 variables (removed 5) and now considering 2161/2166 (removed 5) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:18:47] [INFO ] Computed 361 place invariants in 7 ms
[2021-05-15 20:18:47] [INFO ] Implicit Places using invariants in 792 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:18:47] [INFO ] Computed 361 place invariants in 11 ms
[2021-05-15 20:18:50] [INFO ] Implicit Places using invariants and state equation in 2084 ms returned []
Implicit Place search using SMT with State Equation took 2878 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:18:50] [INFO ] Computed 361 place invariants in 7 ms
[2021-05-15 20:18:51] [INFO ] Dead Transitions using invariants and state equation in 1451 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2361/2366 places, 2161/2166 transitions.
Stuttering acceptance computed with spot in 3352 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s586 0) (EQ s1350 1)), p1:(OR (EQ s586 0) (EQ s1350 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 828 ms.
Product exploration explored 100000 steps with 1 reset in 1073 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 766 ms.
Product exploration explored 100000 steps with 0 reset in 931 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 2361 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2361 transition count 2161
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 479 place count 2361 transition count 2402
Deduced a syphon composed of 679 places in 4 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 679 place count 2361 transition count 2402
Performed 758 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1437 places in 3 ms
Iterating global reduction 1 with 758 rules applied. Total rules applied 1437 place count 2361 transition count 2402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1438 place count 2361 transition count 2401
Renaming transitions due to excessive name length > 1024 char.
Discarding 280 places :
Symmetric choice reduction at 2 with 280 rule applications. Total rules 1718 place count 2081 transition count 2121
Deduced a syphon composed of 1157 places in 3 ms
Iterating global reduction 2 with 280 rules applied. Total rules applied 1998 place count 2081 transition count 2121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1158 places in 7 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1999 place count 2081 transition count 2121
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2001 place count 2079 transition count 2119
Deduced a syphon composed of 1156 places in 6 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2003 place count 2079 transition count 2119
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -545
Deduced a syphon composed of 1257 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2104 place count 2079 transition count 2664
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2205 place count 1978 transition count 2462
Deduced a syphon composed of 1156 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2306 place count 1978 transition count 2462
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -102
Deduced a syphon composed of 1175 places in 4 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 2325 place count 1978 transition count 2564
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 2344 place count 1959 transition count 2526
Deduced a syphon composed of 1156 places in 3 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 2363 place count 1959 transition count 2526
Deduced a syphon composed of 1156 places in 2 ms
Applied a total of 2363 rules in 1886 ms. Remains 1959 /2361 variables (removed 402) and now considering 2526/2161 (removed -365) transitions.
[2021-05-15 20:19:01] [INFO ] Redundant transitions in 168 ms returned []
// Phase 1: matrix 2526 rows 1959 cols
[2021-05-15 20:19:01] [INFO ] Computed 361 place invariants in 17 ms
[2021-05-15 20:19:03] [INFO ] Dead Transitions using invariants and state equation in 1469 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1959/2361 places, 2526/2161 transitions.
Product exploration explored 100000 steps with 1 reset in 912 ms.
Product exploration explored 100000 steps with 2 reset in 1112 ms.
[2021-05-15 20:19:08] [INFO ] Flatten gal took : 169 ms
[2021-05-15 20:19:08] [INFO ] Flatten gal took : 141 ms
[2021-05-15 20:19:08] [INFO ] Time to serialize gal into /tmp/LTL9643984793553397465.gal : 25 ms
[2021-05-15 20:19:08] [INFO ] Time to serialize properties into /tmp/LTL1018607372725298102.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/LTL9643984793553397465.gal, -t, CGAL, -LTL, /tmp/LTL1018607372725298102.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/LTL9643984793553397465.gal -t CGAL -LTL /tmp/LTL1018607372725298102.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G(("((p685==0)||(p1594==1))")||(F("((p685==0)||(p1594==1))")))))))))
Formula 0 simplified : !XXXXG("((p685==0)||(p1594==1))" | F"((p685==0)||(p1594==1))")
Detected timeout of ITS tools.
[2021-05-15 20:19:23] [INFO ] Flatten gal took : 91 ms
[2021-05-15 20:19:23] [INFO ] Applying decomposition
[2021-05-15 20:19:23] [INFO ] Flatten gal took : 66 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/graph665060795960824652.txt, -o, /tmp/graph665060795960824652.bin, -w, /tmp/graph665060795960824652.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/graph665060795960824652.bin, -l, -1, -v, -w, /tmp/graph665060795960824652.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:19:23] [INFO ] Decomposing Gal with order
[2021-05-15 20:19:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:19:24] [INFO ] Removed a total of 398 redundant transitions.
[2021-05-15 20:19:24] [INFO ] Flatten gal took : 175 ms
[2021-05-15 20:19:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2021-05-15 20:19:24] [INFO ] Time to serialize gal into /tmp/LTL16968601351224057122.gal : 30 ms
[2021-05-15 20:19:24] [INFO ] Time to serialize properties into /tmp/LTL13293253336260172881.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/LTL16968601351224057122.gal, -t, CGAL, -LTL, /tmp/LTL13293253336260172881.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/LTL16968601351224057122.gal -t CGAL -LTL /tmp/LTL13293253336260172881.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G(("((i9.i2.u220.p685==0)||(i22.i3.u498.p1594==1))")||(F("((i9.i2.u220.p685==0)||(i22.i3.u498.p1594==1))")))))))))
Formula 0 simplified : !XXXXG("((i9.i2.u220.p685==0)||(i22.i3.u498.p1594==1))" | F"((i9.i2.u220.p685==0)||(i22.i3.u498.p1594==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16927730615244552199
[2021-05-15 20:19:39] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16927730615244552199
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/ltsmin16927730615244552199]
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/ltsmin16927730615244552199] 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/ltsmin16927730615244552199] 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 ShieldIIPt-PT-040B-03 finished in 53406 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2366 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2366/2366 places, 2166/2166 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2361 transition count 2161
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2361 transition count 2161
Applied a total of 10 rules in 299 ms. Remains 2361 /2366 variables (removed 5) and now considering 2161/2166 (removed 5) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:19:40] [INFO ] Computed 361 place invariants in 7 ms
[2021-05-15 20:19:41] [INFO ] Implicit Places using invariants in 766 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:19:41] [INFO ] Computed 361 place invariants in 15 ms
[2021-05-15 20:19:43] [INFO ] Implicit Places using invariants and state equation in 2140 ms returned []
Implicit Place search using SMT with State Equation took 2918 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:19:43] [INFO ] Computed 361 place invariants in 6 ms
[2021-05-15 20:19:44] [INFO ] Dead Transitions using invariants and state equation in 1299 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2361/2366 places, 2161/2166 transitions.
Stuttering acceptance computed with spot in 1811 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040B-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s716 0) (EQ s963 1)), p1:(NEQ s2010 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1601 ms.
Product exploration explored 100000 steps with 50000 reset in 1588 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 1550 ms.
Product exploration explored 100000 steps with 50000 reset in 1516 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 2361 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 476 rules applied. Total rules applied 476 place count 2361 transition count 2161
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 202 Pre rules applied. Total rules applied 476 place count 2361 transition count 2404
Deduced a syphon composed of 678 places in 3 ms
Iterating global reduction 1 with 202 rules applied. Total rules applied 678 place count 2361 transition count 2404
Performed 758 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1436 places in 3 ms
Iterating global reduction 1 with 758 rules applied. Total rules applied 1436 place count 2361 transition count 2404
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1437 place count 2361 transition count 2403
Renaming transitions due to excessive name length > 1024 char.
Discarding 279 places :
Symmetric choice reduction at 2 with 279 rule applications. Total rules 1716 place count 2082 transition count 2124
Deduced a syphon composed of 1157 places in 2 ms
Iterating global reduction 2 with 279 rules applied. Total rules applied 1995 place count 2082 transition count 2124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1158 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1996 place count 2082 transition count 2124
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1998 place count 2080 transition count 2122
Deduced a syphon composed of 1156 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2000 place count 2080 transition count 2122
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -537
Deduced a syphon composed of 1257 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2101 place count 2080 transition count 2659
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2202 place count 1979 transition count 2457
Deduced a syphon composed of 1156 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2303 place count 1979 transition count 2457
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 1174 places in 2 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 2321 place count 1979 transition count 2557
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 2339 place count 1961 transition count 2521
Deduced a syphon composed of 1156 places in 2 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 2357 place count 1961 transition count 2521
Deduced a syphon composed of 1156 places in 3 ms
Applied a total of 2357 rules in 971 ms. Remains 1961 /2361 variables (removed 400) and now considering 2521/2161 (removed -360) transitions.
[2021-05-15 20:20:01] [INFO ] Redundant transitions in 219 ms returned []
// Phase 1: matrix 2521 rows 1961 cols
[2021-05-15 20:20:01] [INFO ] Computed 361 place invariants in 16 ms
[2021-05-15 20:20:02] [INFO ] Dead Transitions using invariants and state equation in 1284 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1961/2361 places, 2521/2161 transitions.
Product exploration explored 100000 steps with 50000 reset in 7571 ms.
Product exploration explored 100000 steps with 50000 reset in 7598 ms.
[2021-05-15 20:20:18] [INFO ] Flatten gal took : 60 ms
[2021-05-15 20:20:18] [INFO ] Flatten gal took : 74 ms
[2021-05-15 20:20:18] [INFO ] Time to serialize gal into /tmp/LTL11505466942924538989.gal : 10 ms
[2021-05-15 20:20:18] [INFO ] Time to serialize properties into /tmp/LTL3275851832846269652.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/LTL11505466942924538989.gal, -t, CGAL, -LTL, /tmp/LTL3275851832846269652.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/LTL11505466942924538989.gal -t CGAL -LTL /tmp/LTL3275851832846269652.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((p841==0)||(p1136==1))"))||(G("(p2382!=1)")))))
Formula 0 simplified : !X(F"((p841==0)||(p1136==1))" | G"(p2382!=1)")
Detected timeout of ITS tools.
[2021-05-15 20:20:33] [INFO ] Flatten gal took : 55 ms
[2021-05-15 20:20:33] [INFO ] Applying decomposition
[2021-05-15 20:20:33] [INFO ] Flatten gal took : 67 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/graph14603807915968459539.txt, -o, /tmp/graph14603807915968459539.bin, -w, /tmp/graph14603807915968459539.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/graph14603807915968459539.bin, -l, -1, -v, -w, /tmp/graph14603807915968459539.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:20:33] [INFO ] Decomposing Gal with order
[2021-05-15 20:20:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:20:33] [INFO ] Removed a total of 402 redundant transitions.
[2021-05-15 20:20:33] [INFO ] Flatten gal took : 106 ms
[2021-05-15 20:20:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-05-15 20:20:33] [INFO ] Time to serialize gal into /tmp/LTL9210229321779309019.gal : 24 ms
[2021-05-15 20:20:33] [INFO ] Time to serialize properties into /tmp/LTL6377175143145584988.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/LTL9210229321779309019.gal, -t, CGAL, -LTL, /tmp/LTL6377175143145584988.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/LTL9210229321779309019.gal -t CGAL -LTL /tmp/LTL6377175143145584988.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("((i11.i4.u269.p841==0)||(i15.i6.u360.p1136==1))"))||(G("(i33.i6.u749.p2382!=1)")))))
Formula 0 simplified : !X(F"((i11.i4.u269.p841==0)||(i15.i6.u360.p1136==1))" | G"(i33.i6.u749.p2382!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8673188556990582314
[2021-05-15 20:20:48] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8673188556990582314
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/ltsmin8673188556990582314]
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/ltsmin8673188556990582314] 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/ltsmin8673188556990582314] 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 ShieldIIPt-PT-040B-04 finished in 69540 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 2366 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2366/2366 places, 2166/2166 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 476 rules applied. Total rules applied 476 place count 2365 transition count 1689
Reduce places removed 476 places and 0 transitions.
Iterating post reduction 1 with 476 rules applied. Total rules applied 952 place count 1889 transition count 1689
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 952 place count 1889 transition count 1370
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1590 place count 1570 transition count 1370
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1593 place count 1567 transition count 1367
Iterating global reduction 2 with 3 rules applied. Total rules applied 1596 place count 1567 transition count 1367
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1596 place count 1567 transition count 1364
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1602 place count 1564 transition count 1364
Performed 677 Post agglomeration using F-continuation condition.Transition count delta: 677
Deduced a syphon composed of 677 places in 1 ms
Reduce places removed 677 places and 0 transitions.
Iterating global reduction 2 with 1354 rules applied. Total rules applied 2956 place count 887 transition count 687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2957 place count 887 transition count 686
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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2959 place count 886 transition count 685
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3161 place count 785 transition count 750
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3195 place count 768 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3196 place count 767 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3198 place count 765 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3198 place count 765 transition count 759
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3200 place count 764 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3201 place count 763 transition count 758
Applied a total of 3201 rules in 370 ms. Remains 763 /2366 variables (removed 1603) and now considering 758/2166 (removed 1408) transitions.
// Phase 1: matrix 758 rows 763 cols
[2021-05-15 20:20:50] [INFO ] Computed 359 place invariants in 1 ms
[2021-05-15 20:20:50] [INFO ] Implicit Places using invariants in 373 ms returned [752]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 375 ms to find 1 implicit places.
[2021-05-15 20:20:50] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 758 rows 762 cols
[2021-05-15 20:20:50] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:20:51] [INFO ] Dead Transitions using invariants and state equation in 387 ms returned []
Starting structural reductions, iteration 1 : 762/2366 places, 758/2166 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 761 transition count 757
Applied a total of 2 rules in 24 ms. Remains 761 /762 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 761 cols
[2021-05-15 20:20:51] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:20:51] [INFO ] Implicit Places using invariants in 422 ms returned []
// Phase 1: matrix 757 rows 761 cols
[2021-05-15 20:20:51] [INFO ] Computed 358 place invariants in 2 ms
[2021-05-15 20:20:52] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 761/2366 places, 757/2166 transitions.
Stuttering acceptance computed with spot in 9236 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (OR (EQ s54 0) (EQ s98 1)) (OR (EQ s584 0) (EQ s35 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-06 finished in 11604 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 2366 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2366/2366 places, 2166/2166 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2362 transition count 2162
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2362 transition count 2162
Applied a total of 8 rules in 253 ms. Remains 2362 /2366 variables (removed 4) and now considering 2162/2166 (removed 4) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2021-05-15 20:21:01] [INFO ] Computed 361 place invariants in 5 ms
[2021-05-15 20:21:02] [INFO ] Implicit Places using invariants in 639 ms returned []
// Phase 1: matrix 2162 rows 2362 cols
[2021-05-15 20:21:02] [INFO ] Computed 361 place invariants in 14 ms
[2021-05-15 20:21:04] [INFO ] Implicit Places using invariants and state equation in 1983 ms returned []
Implicit Place search using SMT with State Equation took 2625 ms to find 0 implicit places.
// Phase 1: matrix 2162 rows 2362 cols
[2021-05-15 20:21:04] [INFO ] Computed 361 place invariants in 10 ms
[2021-05-15 20:21:05] [INFO ] Dead Transitions using invariants and state equation in 1444 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2362/2366 places, 2162/2166 transitions.
Stuttering acceptance computed with spot in 8638 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s596 0) (NEQ s200 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-08 finished in 12984 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 2366 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2366/2366 places, 2166/2166 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 475 place count 2365 transition count 1690
Reduce places removed 475 places and 0 transitions.
Iterating post reduction 1 with 475 rules applied. Total rules applied 950 place count 1890 transition count 1690
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 320 Pre rules applied. Total rules applied 950 place count 1890 transition count 1370
Deduced a syphon composed of 320 places in 1 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 2 with 640 rules applied. Total rules applied 1590 place count 1570 transition count 1370
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1593 place count 1567 transition count 1367
Iterating global reduction 2 with 3 rules applied. Total rules applied 1596 place count 1567 transition count 1367
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1596 place count 1567 transition count 1364
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1602 place count 1564 transition count 1364
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 0 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 2960 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2961 place count 885 transition count 684
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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2963 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3165 place count 783 transition count 749
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3201 place count 765 transition count 762
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3202 place count 764 transition count 761
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3204 place count 762 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3204 place count 762 transition count 760
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3206 place count 761 transition count 760
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3207 place count 760 transition count 759
Applied a total of 3207 rules in 368 ms. Remains 760 /2366 variables (removed 1606) and now considering 759/2166 (removed 1407) transitions.
// Phase 1: matrix 759 rows 760 cols
[2021-05-15 20:21:14] [INFO ] Computed 359 place invariants in 2 ms
[2021-05-15 20:21:15] [INFO ] Implicit Places using invariants in 456 ms returned [749]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 458 ms to find 1 implicit places.
[2021-05-15 20:21:15] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 759 rows 759 cols
[2021-05-15 20:21:15] [INFO ] Computed 358 place invariants in 2 ms
[2021-05-15 20:21:15] [INFO ] Dead Transitions using invariants and state equation in 372 ms returned []
Starting structural reductions, iteration 1 : 759/2366 places, 759/2166 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 758
Applied a total of 2 rules in 23 ms. Remains 758 /759 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 758 cols
[2021-05-15 20:21:15] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:21:16] [INFO ] Implicit Places using invariants in 467 ms returned []
// Phase 1: matrix 758 rows 758 cols
[2021-05-15 20:21:16] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:21:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-15 20:21:16] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 758/2366 places, 758/2166 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-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 s473 0) (NEQ s52 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 ShieldIIPt-PT-040B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-10 finished in 2500 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2366 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2366/2366 places, 2166/2166 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2361 transition count 2161
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2361 transition count 2161
Applied a total of 10 rules in 234 ms. Remains 2361 /2366 variables (removed 5) and now considering 2161/2166 (removed 5) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:21:17] [INFO ] Computed 361 place invariants in 6 ms
[2021-05-15 20:21:17] [INFO ] Implicit Places using invariants in 685 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:21:17] [INFO ] Computed 361 place invariants in 6 ms
[2021-05-15 20:21:19] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned []
Implicit Place search using SMT with State Equation took 2715 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:21:19] [INFO ] Computed 361 place invariants in 6 ms
[2021-05-15 20:21:21] [INFO ] Dead Transitions using invariants and state equation in 1293 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2361/2366 places, 2161/2166 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s1373 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1458 ms.
Product exploration explored 100000 steps with 50000 reset in 7433 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 1517 ms.
Product exploration explored 100000 steps with 50000 reset in 1537 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2361 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2361 transition count 2161
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 478 place count 2361 transition count 2404
Deduced a syphon composed of 679 places in 3 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 679 place count 2361 transition count 2404
Performed 760 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1439 places in 3 ms
Iterating global reduction 1 with 760 rules applied. Total rules applied 1439 place count 2361 transition count 2404
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1440 place count 2361 transition count 2403
Renaming transitions due to excessive name length > 1024 char.
Discarding 280 places :
Symmetric choice reduction at 2 with 280 rule applications. Total rules 1720 place count 2081 transition count 2123
Deduced a syphon composed of 1159 places in 2 ms
Iterating global reduction 2 with 280 rules applied. Total rules applied 2000 place count 2081 transition count 2123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1160 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2001 place count 2081 transition count 2123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2003 place count 2079 transition count 2121
Deduced a syphon composed of 1158 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2005 place count 2079 transition count 2121
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -537
Deduced a syphon composed of 1259 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2106 place count 2079 transition count 2658
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2207 place count 1978 transition count 2456
Deduced a syphon composed of 1158 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2308 place count 1978 transition count 2456
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 1176 places in 2 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 2326 place count 1978 transition count 2556
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 2344 place count 1960 transition count 2520
Deduced a syphon composed of 1158 places in 3 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 2362 place count 1960 transition count 2520
Deduced a syphon composed of 1158 places in 3 ms
Applied a total of 2362 rules in 930 ms. Remains 1960 /2361 variables (removed 401) and now considering 2520/2161 (removed -359) transitions.
[2021-05-15 20:21:34] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 2520 rows 1960 cols
[2021-05-15 20:21:34] [INFO ] Computed 361 place invariants in 17 ms
[2021-05-15 20:21:35] [INFO ] Dead Transitions using invariants and state equation in 1363 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1960/2361 places, 2520/2161 transitions.
Product exploration explored 100000 steps with 50000 reset in 7690 ms.
Product exploration explored 100000 steps with 50000 reset in 7778 ms.
[2021-05-15 20:21:51] [INFO ] Flatten gal took : 49 ms
[2021-05-15 20:21:51] [INFO ] Flatten gal took : 49 ms
[2021-05-15 20:21:58] [INFO ] Time to serialize gal into /tmp/LTL11355333250906395718.gal : 7010 ms
[2021-05-15 20:21:58] [INFO ] Time to serialize properties into /tmp/LTL3990945291675787986.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/LTL11355333250906395718.gal, -t, CGAL, -LTL, /tmp/LTL3990945291675787986.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/LTL11355333250906395718.gal -t CGAL -LTL /tmp/LTL3990945291675787986.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p1624!=1)"))))
Formula 0 simplified : !XF"(p1624!=1)"
Detected timeout of ITS tools.
[2021-05-15 20:22:13] [INFO ] Flatten gal took : 48 ms
[2021-05-15 20:22:13] [INFO ] Applying decomposition
[2021-05-15 20:22:13] [INFO ] Flatten gal took : 48 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/graph12217695926456141867.txt, -o, /tmp/graph12217695926456141867.bin, -w, /tmp/graph12217695926456141867.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/graph12217695926456141867.bin, -l, -1, -v, -w, /tmp/graph12217695926456141867.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:22:13] [INFO ] Decomposing Gal with order
[2021-05-15 20:22:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:22:13] [INFO ] Removed a total of 403 redundant transitions.
[2021-05-15 20:22:13] [INFO ] Flatten gal took : 94 ms
[2021-05-15 20:22:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-05-15 20:22:13] [INFO ] Time to serialize gal into /tmp/LTL7150254810953130047.gal : 15 ms
[2021-05-15 20:22:13] [INFO ] Time to serialize properties into /tmp/LTL11897377788465206516.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/LTL7150254810953130047.gal, -t, CGAL, -LTL, /tmp/LTL11897377788465206516.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/LTL7150254810953130047.gal -t CGAL -LTL /tmp/LTL11897377788465206516.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i22.i7.u515.p1624!=1)"))))
Formula 0 simplified : !XF"(i22.i7.u515.p1624!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2613925827113477430
[2021-05-15 20:22:29] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2613925827113477430
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/ltsmin2613925827113477430]
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/ltsmin2613925827113477430] 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/ltsmin2613925827113477430] 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 ShieldIIPt-PT-040B-12 finished in 73099 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11003271423120718253
[2021-05-15 20:22:30] [INFO ] Too many transitions (2166) to apply POR reductions. Disabling POR matrices.
[2021-05-15 20:22:30] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11003271423120718253
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/ltsmin11003271423120718253]
[2021-05-15 20:22:30] [INFO ] Applying decomposition
[2021-05-15 20:22:30] [INFO ] Flatten gal took : 54 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/graph15735246938558145435.txt, -o, /tmp/graph15735246938558145435.bin, -w, /tmp/graph15735246938558145435.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/graph15735246938558145435.bin, -l, -1, -v, -w, /tmp/graph15735246938558145435.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:22:30] [INFO ] Decomposing Gal with order
[2021-05-15 20:22:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:22:30] [INFO ] Removed a total of 396 redundant transitions.
[2021-05-15 20:22:30] [INFO ] Flatten gal took : 104 ms
[2021-05-15 20:22:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-15 20:22:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality2918840002030244994.gal : 102 ms
[2021-05-15 20:22:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality10514816412397734433.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/LTLCardinality2918840002030244994.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10514816412397734433.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/LTLCardinality2918840002030244994.gal -t CGAL -LTL /tmp/LTLCardinality10514816412397734433.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X(X(X(X(G(("((i9.u222.p685==0)||(i22.u505.p1594==1))")||(F("((i9.u222.p685==0)||(i22.u505.p1594==1))")))))))))
Formula 0 simplified : !XXXXG("((i9.u222.p685==0)||(i22.u505.p1594==1))" | F"((i9.u222.p685==0)||(i22.u505.p1594==1))")
Compilation finished in 23886 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11003271423120718253]
Link finished in 62 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(X(X(X([]((<>((LTLAPp1==true))||(LTLAPp0==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11003271423120718253]
WARNING : LTSmin timed out (>600 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(X(X(X([]((<>((LTLAPp1==true))||(LTLAPp0==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11003271423120718253]
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((<>((LTLAPp2==true))||[]((LTLAPp3==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin11003271423120718253]
LTSmin run took 769 ms.
FORMULA ShieldIIPt-PT-040B-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
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(<>((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11003271423120718253]
LTSmin run took 932 ms.
FORMULA ShieldIIPt-PT-040B-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 4800 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(X(X(X([]((<>((LTLAPp1==true))||(LTLAPp0==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11003271423120718253]
Detected timeout of ITS tools.
[2021-05-15 20:44:03] [INFO ] Applying decomposition
[2021-05-15 20:44:03] [INFO ] Flatten gal took : 183 ms
[2021-05-15 20:44:03] [INFO ] Decomposing Gal with order
[2021-05-15 20:44:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:44:04] [INFO ] Removed a total of 117 redundant transitions.
[2021-05-15 20:44:04] [INFO ] Flatten gal took : 229 ms
[2021-05-15 20:44:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2021-05-15 20:44:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality16613981603882389553.gal : 38 ms
[2021-05-15 20:44:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality15636047203225488650.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/LTLCardinality16613981603882389553.gal, -t, CGAL, -LTL, /tmp/LTLCardinality15636047203225488650.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/LTLCardinality16613981603882389553.gal -t CGAL -LTL /tmp/LTLCardinality15636047203225488650.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(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.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.u206.p685==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u428.p1594==1))")||(F("((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.i0.i1.i0.i0.i0.i0.u206.p685==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u428.p1594==1))")))))))))
Formula 0 simplified : !XXXXG("((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.i0.i1.i0.i0.i0.i0.u206.p685==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u428.p1594==1))" | F"((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.i0.i1.i0.i0.i0.i0.u206.p685==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u428.p1594==1))")
Detected timeout of ITS tools.
[2021-05-15 21:05:36] [INFO ] Flatten gal took : 199 ms
[2021-05-15 21:05:36] [INFO ] Input system was already deterministic with 2166 transitions.
[2021-05-15 21:05:36] [INFO ] Transformed 2366 places.
[2021-05-15 21:05:36] [INFO ] Transformed 2166 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-15 21:05:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality15345524667217613897.gal : 89 ms
[2021-05-15 21:05:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality7079712220232530339.ltl : 3843 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/LTLCardinality15345524667217613897.gal, -t, CGAL, -LTL, /tmp/LTLCardinality7079712220232530339.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/LTLCardinality15345524667217613897.gal -t CGAL -LTL /tmp/LTLCardinality7079712220232530339.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(X(X(X(G(("((p685==0)||(p1594==1))")||(F("((p685==0)||(p1594==1))")))))))))
Formula 0 simplified : !XXXXG("((p685==0)||(p1594==1))" | F"((p685==0)||(p1594==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="ShieldIIPt-PT-040B"
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 ShieldIIPt-PT-040B, 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 r216-tall-162098205100476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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