Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r233-tall-165286037000054.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 gold2021
Input is ShieldIIPs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037000054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.3K Apr 29 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 29 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 15:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 15:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 29 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 29 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 29 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 675K May 10 09:34 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 ShieldIIPs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655068635894

Running Version 0
[2022-06-12 21:17:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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]
[2022-06-12 21:17:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:17:17] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2022-06-12 21:17:17] [INFO ] Transformed 2403 places.
[2022-06-12 21:17:17] [INFO ] Transformed 2363 transitions.
[2022-06-12 21:17:17] [INFO ] Found NUPN structural information;
[2022-06-12 21:17:17] [INFO ] Parsed PT model containing 2403 places and 2363 transitions in 332 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 16) seen :7
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2363 rows 2403 cols
[2022-06-12 21:17:18] [INFO ] Computed 361 place invariants in 37 ms
[2022-06-12 21:17:18] [INFO ] [Real]Absence check using 361 positive place invariants in 166 ms returned sat
[2022-06-12 21:17:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:19] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2022-06-12 21:17:20] [INFO ] Deduced a trap composed of 19 places in 698 ms of which 9 ms to minimize.
[2022-06-12 21:17:21] [INFO ] Deduced a trap composed of 27 places in 708 ms of which 3 ms to minimize.
[2022-06-12 21:17:22] [INFO ] Deduced a trap composed of 34 places in 801 ms of which 4 ms to minimize.
[2022-06-12 21:17:23] [INFO ] Deduced a trap composed of 28 places in 658 ms of which 4 ms to minimize.
[2022-06-12 21:17:23] [INFO ] Deduced a trap composed of 24 places in 614 ms of which 3 ms to minimize.
[2022-06-12 21:17: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
[2022-06-12 21:17:24] [INFO ] [Real]Absence check using 361 positive place invariants in 209 ms returned sat
[2022-06-12 21:17:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:28] [INFO ] [Real]Absence check using state equation in 4141 ms returned sat
[2022-06-12 21:17:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:29] [INFO ] [Nat]Absence check using 361 positive place invariants in 217 ms returned sat
[2022-06-12 21:17:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:33] [INFO ] [Nat]Absence check using state equation in 4510 ms returned unknown
[2022-06-12 21:17:34] [INFO ] [Real]Absence check using 361 positive place invariants in 147 ms returned sat
[2022-06-12 21:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:35] [INFO ] [Real]Absence check using state equation in 1424 ms returned sat
[2022-06-12 21:17:36] [INFO ] Deduced a trap composed of 25 places in 612 ms of which 11 ms to minimize.
[2022-06-12 21:17:37] [INFO ] Deduced a trap composed of 17 places in 570 ms of which 2 ms to minimize.
[2022-06-12 21:17:37] [INFO ] Deduced a trap composed of 21 places in 567 ms of which 2 ms to minimize.
[2022-06-12 21:17:38] [INFO ] Deduced a trap composed of 25 places in 539 ms of which 1 ms to minimize.
[2022-06-12 21:17:39] [INFO ] Deduced a trap composed of 25 places in 545 ms of which 1 ms to minimize.
[2022-06-12 21:17:39] [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 2
[2022-06-12 21:17:39] [INFO ] [Real]Absence check using 361 positive place invariants in 159 ms returned sat
[2022-06-12 21:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:41] [INFO ] [Real]Absence check using state equation in 1825 ms returned sat
[2022-06-12 21:17:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:41] [INFO ] [Nat]Absence check using 361 positive place invariants in 154 ms returned sat
[2022-06-12 21:17:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:43] [INFO ] [Nat]Absence check using state equation in 1626 ms returned sat
[2022-06-12 21:17:44] [INFO ] Deduced a trap composed of 16 places in 541 ms of which 1 ms to minimize.
[2022-06-12 21:17:44] [INFO ] Deduced a trap composed of 23 places in 530 ms of which 1 ms to minimize.
[2022-06-12 21:17:45] [INFO ] Deduced a trap composed of 26 places in 530 ms of which 1 ms to minimize.
[2022-06-12 21:17:45] [INFO ] Deduced a trap composed of 18 places in 546 ms of which 1 ms to minimize.
[2022-06-12 21:17:46] [INFO ] Deduced a trap composed of 23 places in 568 ms of which 1 ms to minimize.
[2022-06-12 21:17: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 3
[2022-06-12 21:17:47] [INFO ] [Real]Absence check using 361 positive place invariants in 167 ms returned sat
[2022-06-12 21:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:48] [INFO ] [Real]Absence check using state equation in 983 ms returned sat
[2022-06-12 21:17:48] [INFO ] Deduced a trap composed of 10 places in 589 ms of which 1 ms to minimize.
[2022-06-12 21:17:49] [INFO ] Deduced a trap composed of 17 places in 543 ms of which 2 ms to minimize.
[2022-06-12 21:17:50] [INFO ] Deduced a trap composed of 19 places in 553 ms of which 1 ms to minimize.
[2022-06-12 21:17:50] [INFO ] Deduced a trap composed of 30 places in 543 ms of which 2 ms to minimize.
[2022-06-12 21:17:51] [INFO ] Deduced a trap composed of 20 places in 558 ms of which 3 ms to minimize.
[2022-06-12 21:17:51] [INFO ] Deduced a trap composed of 22 places in 536 ms of which 1 ms to minimize.
[2022-06-12 21:17:51] [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 4
[2022-06-12 21:17:52] [INFO ] [Real]Absence check using 361 positive place invariants in 155 ms returned sat
[2022-06-12 21:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:54] [INFO ] [Real]Absence check using state equation in 1618 ms returned sat
[2022-06-12 21:17:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:54] [INFO ] [Nat]Absence check using 361 positive place invariants in 172 ms returned sat
[2022-06-12 21:17:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:56] [INFO ] [Nat]Absence check using state equation in 1734 ms returned sat
[2022-06-12 21:17:56] [INFO ] Deduced a trap composed of 18 places in 556 ms of which 1 ms to minimize.
[2022-06-12 21:17:57] [INFO ] Deduced a trap composed of 22 places in 552 ms of which 1 ms to minimize.
[2022-06-12 21:17:58] [INFO ] Deduced a trap composed of 17 places in 600 ms of which 2 ms to minimize.
[2022-06-12 21:17:58] [INFO ] Deduced a trap composed of 25 places in 558 ms of which 2 ms to minimize.
[2022-06-12 21:17:59] [INFO ] Deduced a trap composed of 22 places in 552 ms of which 1 ms to minimize.
[2022-06-12 21:17:59] [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 5
[2022-06-12 21:17:59] [INFO ] [Real]Absence check using 361 positive place invariants in 159 ms returned sat
[2022-06-12 21:17:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:02] [INFO ] [Real]Absence check using state equation in 2009 ms returned sat
[2022-06-12 21:18:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:02] [INFO ] [Nat]Absence check using 361 positive place invariants in 166 ms returned sat
[2022-06-12 21:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:04] [INFO ] [Nat]Absence check using state equation in 2239 ms returned sat
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 23 places in 601 ms of which 1 ms to minimize.
[2022-06-12 21:18:06] [INFO ] Deduced a trap composed of 22 places in 594 ms of which 1 ms to minimize.
[2022-06-12 21:18:06] [INFO ] Deduced a trap composed of 21 places in 559 ms of which 1 ms to minimize.
[2022-06-12 21:18:07] [INFO ] Deduced a trap composed of 30 places in 580 ms of which 1 ms to minimize.
[2022-06-12 21:18:07] [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 6
[2022-06-12 21:18:07] [INFO ] [Real]Absence check using 361 positive place invariants in 137 ms returned sat
[2022-06-12 21:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:08] [INFO ] [Real]Absence check using state equation in 966 ms returned sat
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 19 places in 592 ms of which 2 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 13 places in 590 ms of which 2 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 23 places in 551 ms of which 1 ms to minimize.
[2022-06-12 21:18:11] [INFO ] Deduced a trap composed of 20 places in 525 ms of which 1 ms to minimize.
[2022-06-12 21:18:12] [INFO ] Deduced a trap composed of 10 places in 527 ms of which 1 ms to minimize.
[2022-06-12 21:18:12] [INFO ] Deduced a trap composed of 21 places in 535 ms of which 2 ms to minimize.
[2022-06-12 21:18:12] [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 7
[2022-06-12 21:18:13] [INFO ] [Real]Absence check using 361 positive place invariants in 137 ms returned sat
[2022-06-12 21:18:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:14] [INFO ] [Real]Absence check using state equation in 967 ms returned sat
[2022-06-12 21:18:14] [INFO ] Deduced a trap composed of 23 places in 582 ms of which 1 ms to minimize.
[2022-06-12 21:18:15] [INFO ] Deduced a trap composed of 28 places in 564 ms of which 1 ms to minimize.
[2022-06-12 21:18:16] [INFO ] Deduced a trap composed of 20 places in 567 ms of which 1 ms to minimize.
[2022-06-12 21:18:16] [INFO ] Deduced a trap composed of 24 places in 570 ms of which 1 ms to minimize.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 19 places in 559 ms of which 2 ms to minimize.
[2022-06-12 21:18:18] [INFO ] Deduced a trap composed of 19 places in 574 ms of which 2 ms to minimize.
[2022-06-12 21:18:18] [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 8
Fused 9 Parikh solutions to 1 different solutions.
Support contains 207 out of 2403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 2403 transition count 2195
Reduce places removed 168 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 176 rules applied. Total rules applied 344 place count 2235 transition count 2187
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 352 place count 2227 transition count 2187
Performed 193 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 193 Pre rules applied. Total rules applied 352 place count 2227 transition count 1994
Deduced a syphon composed of 193 places in 4 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 3 with 386 rules applied. Total rules applied 738 place count 2034 transition count 1994
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 977 place count 1795 transition count 1755
Iterating global reduction 3 with 239 rules applied. Total rules applied 1216 place count 1795 transition count 1755
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 1216 place count 1795 transition count 1680
Deduced a syphon composed of 75 places in 11 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 1366 place count 1720 transition count 1680
Performed 530 Post agglomeration using F-continuation condition.Transition count delta: 530
Deduced a syphon composed of 530 places in 4 ms
Reduce places removed 530 places and 0 transitions.
Iterating global reduction 3 with 1060 rules applied. Total rules applied 2426 place count 1190 transition count 1150
Partial Free-agglomeration rule applied 222 times.
Drop transitions removed 222 transitions
Iterating global reduction 3 with 222 rules applied. Total rules applied 2648 place count 1190 transition count 1150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2649 place count 1189 transition count 1149
Applied a total of 2649 rules in 873 ms. Remains 1189 /2403 variables (removed 1214) and now considering 1149/2363 (removed 1214) transitions.
Finished structural reductions, in 1 iterations. Remains : 1189/2403 places, 1149/2363 transitions.
[2022-06-12 21:18:19] [INFO ] Flatten gal took : 157 ms
[2022-06-12 21:18:19] [INFO ] Flatten gal took : 83 ms
[2022-06-12 21:18:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16613926603615318780.gal : 38 ms
[2022-06-12 21:18:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11524850049334601681.prop : 3 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16613926603615318780.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11524850049334601681.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16613926603615318780.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11524850049334601681.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11524850049334601681.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :7 after 17
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :17 after 221
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :221 after 48389
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :48389 after 2.90305e+06
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :2.90305e+06 after 4.33422e+12
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :4.33422e+12 after 6.64072e+20
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :5.30152e+26 after 7.50822e+26
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :7.50822e+26 after 7.50822e+26
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :7.50822e+26 after 7.50822e+26
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :7.50822e+26 after 7.50822e+26
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :7.50822e+26 after 7.50822e+26
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :7.50822e+26 after 7.50822e+26
SDD proceeding with computation,9 properties remain. new max is 65536
SDD size :7.50822e+26 after 7.50822e+26
Detected timeout of ITS tools.
[2022-06-12 21:18:34] [INFO ] Flatten gal took : 77 ms
[2022-06-12 21:18:34] [INFO ] Applying decomposition
[2022-06-12 21:18:34] [INFO ] Flatten gal took : 85 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/graph12334891970021338879.txt, -o, /tmp/graph12334891970021338879.bin, -w, /tmp/graph12334891970021338879.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/graph12334891970021338879.bin, -l, -1, -v, -w, /tmp/graph12334891970021338879.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:18:35] [INFO ] Decomposing Gal with order
[2022-06-12 21:18:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:18:35] [INFO ] Removed a total of 841 redundant transitions.
[2022-06-12 21:18:35] [INFO ] Flatten gal took : 366 ms
[2022-06-12 21:18:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 708 labels/synchronizations in 206 ms.
[2022-06-12 21:18:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14281230998002585552.gal : 18 ms
[2022-06-12 21:18:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13205900346341879404.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14281230998002585552.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13205900346341879404.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality14281230998002585552.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13205900346341879404.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13205900346341879404.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :1 after 12
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :12 after 799206
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :799206 after 5.5181e+10
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :5.5181e+10 after 5.5181e+10
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6617903163096515130
[2022-06-12 21:18:51] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6617903163096515130
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/ltsmin6617903163096515130]
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/ltsmin6617903163096515130] 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/ltsmin6617903163096515130] 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)
Incomplete random walk after 1000000 steps, including 304 resets, run finished after 7858 ms. (steps per millisecond=127 ) properties (out of 9) seen :5
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 859171 steps, including 14 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 14 resets, run finished after 4941 ms. (steps per millisecond=202 ) properties (out of 4) seen :1
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 13 resets, run finished after 4910 ms. (steps per millisecond=203 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 825171 steps, including 16 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen :{2=1}
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 1149 rows 1189 cols
[2022-06-12 21:19:19] [INFO ] Computed 361 place invariants in 34 ms
[2022-06-12 21:19:20] [INFO ] [Real]Absence check using 354 positive place invariants in 101 ms returned sat
[2022-06-12 21:19:20] [INFO ] [Real]Absence check using 354 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-12 21:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:20] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2022-06-12 21:19:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:21] [INFO ] [Nat]Absence check using 354 positive place invariants in 84 ms returned sat
[2022-06-12 21:19:21] [INFO ] [Nat]Absence check using 354 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-12 21:19:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:21] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2022-06-12 21:19:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-12 21:19:21] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:19:22] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:19:22] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:19:22] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:19:22] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:19:22] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:19:22] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:19:22] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2898 ms
[2022-06-12 21:19:24] [INFO ] Computed and/alt/rep : 1117/5188/1117 causal constraints (skipped 24 transitions) in 71 ms.
[2022-06-12 21:19:44] [INFO ] Added : 870 causal constraints over 174 iterations in 20177 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-06-12 21:19:45] [INFO ] [Real]Absence check using 354 positive place invariants in 88 ms returned sat
[2022-06-12 21:19:45] [INFO ] [Real]Absence check using 354 positive and 7 generalized place invariants in 1 ms returned sat
[2022-06-12 21:19:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:45] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2022-06-12 21:19:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:45] [INFO ] [Nat]Absence check using 354 positive place invariants in 69 ms returned sat
[2022-06-12 21:19:45] [INFO ] [Nat]Absence check using 354 positive and 7 generalized place invariants in 1 ms returned sat
[2022-06-12 21:19:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:46] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2022-06-12 21:19:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-06-12 21:19:46] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:19:46] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2022-06-12 21:19:46] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:19:46] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:19:46] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:19:47] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:19:47] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:19:47] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:19:47] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2022-06-12 21:19:47] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2022-06-12 21:19:47] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2022-06-12 21:19:47] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:19:48] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:19:48] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 3 ms to minimize.
[2022-06-12 21:19:48] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:19:48] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:19:48] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:19:48] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:19:48] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 3 ms to minimize.
[2022-06-12 21:19:48] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:19:49] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:19:49] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:19:49] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:19:49] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:19:49] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:19:49] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:19:49] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:19:49] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:19:49] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:19:49] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3686 ms
[2022-06-12 21:19:50] [INFO ] Computed and/alt/rep : 1117/5188/1117 causal constraints (skipped 24 transitions) in 54 ms.
[2022-06-12 21:20:10] [INFO ] Added : 890 causal constraints over 178 iterations in 20129 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 65 ms.
Incomplete Parikh walk after 166400 steps, including 988 resets, run finished after 1013 ms. (steps per millisecond=164 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 186100 steps, including 990 resets, run finished after 1218 ms. (steps per millisecond=152 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 87 out of 1189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1189/1189 places, 1149/1149 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1189 transition count 1140
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 1180 transition count 1140
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 18 place count 1180 transition count 1124
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 50 place count 1164 transition count 1124
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 1162 transition count 1122
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 1162 transition count 1122
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 208 place count 1085 transition count 1045
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 248 place count 1085 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 249 place count 1084 transition count 1044
Iterating global reduction 2 with 1 rules applied. Total rules applied 250 place count 1084 transition count 1044
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 251 place count 1083 transition count 1043
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 252 place count 1082 transition count 1043
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 253 place count 1081 transition count 1042
Applied a total of 253 rules in 473 ms. Remains 1081 /1189 variables (removed 108) and now considering 1042/1149 (removed 107) transitions.
Finished structural reductions, in 1 iterations. Remains : 1081/1189 places, 1042/1149 transitions.
[2022-06-12 21:20:12] [INFO ] Flatten gal took : 50 ms
[2022-06-12 21:20:13] [INFO ] Flatten gal took : 48 ms
[2022-06-12 21:20:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1894452004457690114.gal : 6 ms
[2022-06-12 21:20:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6292960293146816305.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1894452004457690114.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6292960293146816305.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality1894452004457690114.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6292960293146816305.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6292960293146816305.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 17
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :17 after 41
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :41 after 1301
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1301 after 62216
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :62216 after 2.35169e+08
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :6.77286e+13 after 1.25385e+14
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.25385e+14 after 1.25385e+14
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.25385e+14 after 1.25385e+14
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.25385e+14 after 1.25385e+14
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.25385e+14 after 1.25385e+14
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.25385e+14 after 1.25388e+14
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.25388e+14 after 1.25591e+14
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.25591e+14 after 1.27104e+14
Detected timeout of ITS tools.
[2022-06-12 21:20:28] [INFO ] Flatten gal took : 48 ms
[2022-06-12 21:20:28] [INFO ] Applying decomposition
[2022-06-12 21:20:28] [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/graph5696368471000241314.txt, -o, /tmp/graph5696368471000241314.bin, -w, /tmp/graph5696368471000241314.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/graph5696368471000241314.bin, -l, -1, -v, -w, /tmp/graph5696368471000241314.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:20:28] [INFO ] Decomposing Gal with order
[2022-06-12 21:20:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:20:28] [INFO ] Removed a total of 828 redundant transitions.
[2022-06-12 21:20:28] [INFO ] Flatten gal took : 82 ms
[2022-06-12 21:20:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 857 labels/synchronizations in 94 ms.
[2022-06-12 21:20:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14438537231943179496.gal : 11 ms
[2022-06-12 21:20:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2629526346334162179.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14438537231943179496.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2629526346334162179.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality14438537231943179496.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2629526346334162179.prop --nowitness
Loading property file /tmp/ReachabilityCardinality2629526346334162179.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 33
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :33 after 34593
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :34593 after 622143
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :622143 after 622143
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6256396979728609324
[2022-06-12 21:20:43] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6256396979728609324
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/ltsmin6256396979728609324]
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/ltsmin6256396979728609324] 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/ltsmin6256396979728609324] 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)
Incomplete random walk after 1000000 steps, including 275 resets, run finished after 8178 ms. (steps per millisecond=122 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 847786 steps, including 15 resets, run timeout after 5001 ms. (steps per millisecond=169 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 12 resets, run finished after 4991 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1786273 steps, run timeout after 30001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 1786273 steps, saw 337656 distinct states, run finished after 30001 ms. (steps per millisecond=59 ) properties seen :{}
Running SMT prover for 2 properties.
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-12 21:21:32] [INFO ] Computed 360 place invariants in 28 ms
[2022-06-12 21:21:33] [INFO ] [Real]Absence check using 352 positive place invariants in 79 ms returned sat
[2022-06-12 21:21:33] [INFO ] [Real]Absence check using 352 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:33] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2022-06-12 21:21:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:33] [INFO ] [Nat]Absence check using 352 positive place invariants in 74 ms returned sat
[2022-06-12 21:21:33] [INFO ] [Nat]Absence check using 352 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:34] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2022-06-12 21:21:34] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:21:34] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:21:34] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2022-06-12 21:21:34] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 13 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3245 ms
[2022-06-12 21:21:37] [INFO ] Computed and/alt/rep : 993/5115/993 causal constraints (skipped 43 transitions) in 49 ms.
[2022-06-12 21:21:57] [INFO ] Added : 880 causal constraints over 176 iterations in 20210 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-06-12 21:21:58] [INFO ] [Real]Absence check using 352 positive place invariants in 74 ms returned sat
[2022-06-12 21:21:58] [INFO ] [Real]Absence check using 352 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-12 21:21:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:58] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2022-06-12 21:21:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:58] [INFO ] [Nat]Absence check using 352 positive place invariants in 71 ms returned sat
[2022-06-12 21:21:58] [INFO ] [Nat]Absence check using 352 positive and 8 generalized place invariants in 1 ms returned sat
[2022-06-12 21:21:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:59] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2022-06-12 21:21:59] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:21:59] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:21:59] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:21:59] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:21:59] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:22:00] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:22:00] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:22:00] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:22:00] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:22:00] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2022-06-12 21:22:00] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:22:00] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:22:00] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2022-06-12 21:22:00] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:22:00] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:22:00] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2022-06-12 21:22:01] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:22:01] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:22:01] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:22:01] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:22:01] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:22:01] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:22:01] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2110 ms
[2022-06-12 21:22:01] [INFO ] Computed and/alt/rep : 993/5115/993 causal constraints (skipped 43 transitions) in 49 ms.
[2022-06-12 21:22:21] [INFO ] Added : 855 causal constraints over 171 iterations in 20150 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 65 ms.
Incomplete Parikh walk after 144300 steps, including 986 resets, run finished after 808 ms. (steps per millisecond=178 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 146600 steps, including 995 resets, run finished after 804 ms. (steps per millisecond=182 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 87 out of 1081 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1081/1081 places, 1042/1042 transitions.
Applied a total of 0 rules in 25 ms. Remains 1081 /1081 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1081/1081 places, 1042/1042 transitions.
Starting structural reductions, iteration 0 : 1081/1081 places, 1042/1042 transitions.
Applied a total of 0 rules in 24 ms. Remains 1081 /1081 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-12 21:22:23] [INFO ] Computed 360 place invariants in 9 ms
[2022-06-12 21:22:23] [INFO ] Implicit Places using invariants in 541 ms returned []
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-12 21:22:23] [INFO ] Computed 360 place invariants in 9 ms
[2022-06-12 21:22:25] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1706 ms to find 0 implicit places.
[2022-06-12 21:22:25] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-12 21:22:25] [INFO ] Computed 360 place invariants in 10 ms
[2022-06-12 21:22:25] [INFO ] Dead Transitions using invariants and state equation in 506 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1081/1081 places, 1042/1042 transitions.
Incomplete random walk after 100000 steps, including 27 resets, run finished after 838 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-12 21:22:26] [INFO ] Computed 360 place invariants in 15 ms
[2022-06-12 21:22:26] [INFO ] [Real]Absence check using 352 positive place invariants in 102 ms returned sat
[2022-06-12 21:22:26] [INFO ] [Real]Absence check using 352 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:27] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2022-06-12 21:22:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:27] [INFO ] [Nat]Absence check using 352 positive place invariants in 79 ms returned sat
[2022-06-12 21:22:27] [INFO ] [Nat]Absence check using 352 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:28] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2022-06-12 21:22:28] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2022-06-12 21:22:28] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:22:28] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:22:28] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:22:28] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:22:28] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
[2022-06-12 21:22:29] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2022-06-12 21:22:29] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2022-06-12 21:22:29] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:22:29] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:22:29] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:22:29] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:22:29] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:22:29] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:22:30] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:22:30] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:22:30] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:22:30] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:22:30] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:22:30] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2022-06-12 21:22:30] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:22:30] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:22:30] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:22:30] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2022-06-12 21:22:31] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:22:31] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:22:31] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:22:31] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:22:31] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:22:31] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3339 ms
[2022-06-12 21:22:31] [INFO ] Computed and/alt/rep : 993/5115/993 causal constraints (skipped 43 transitions) in 60 ms.
[2022-06-12 21:22:47] [INFO ] Added : 775 causal constraints over 155 iterations in 15969 ms. Result :unknown
[2022-06-12 21:22:47] [INFO ] [Real]Absence check using 352 positive place invariants in 71 ms returned sat
[2022-06-12 21:22:47] [INFO ] [Real]Absence check using 352 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:22:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:48] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2022-06-12 21:22:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:48] [INFO ] [Nat]Absence check using 352 positive place invariants in 71 ms returned sat
[2022-06-12 21:22:48] [INFO ] [Nat]Absence check using 352 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:48] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 9 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:22:50] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2022-06-12 21:22:50] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2022-06-12 21:22:50] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:22:50] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:22:50] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:22:50] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:22:50] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2022-06-12 21:22:50] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2022-06-12 21:22:50] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:22:50] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:22:50] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:22:51] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2309 ms
[2022-06-12 21:22:51] [INFO ] Computed and/alt/rep : 993/5115/993 causal constraints (skipped 43 transitions) in 52 ms.
[2022-06-12 21:23:08] [INFO ] Deduced a trap composed of 2 places in 439 ms of which 1 ms to minimize.
[2022-06-12 21:23:08] [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
[2022-06-12 21:23:08] [INFO ] Flatten gal took : 47 ms
[2022-06-12 21:23:08] [INFO ] Flatten gal took : 45 ms
[2022-06-12 21:23:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8738291345965570291.gal : 14 ms
[2022-06-12 21:23:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7275500627323501551.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8738291345965570291.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7275500627323501551.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality8738291345965570291.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7275500627323501551.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7275500627323501551.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 17
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :17 after 41
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :41 after 1301
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1301 after 62216
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :62216 after 2.35169e+08
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :6.77286e+13 after 1.25385e+14
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.25385e+14 after 1.25385e+14
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.25385e+14 after 1.25385e+14
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.25385e+14 after 1.25385e+14
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.25385e+14 after 1.25385e+14
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.25385e+14 after 1.25388e+14
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.25388e+14 after 1.25591e+14
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.25591e+14 after 1.27104e+14
Detected timeout of ITS tools.
[2022-06-12 21:23:23] [INFO ] Flatten gal took : 45 ms
[2022-06-12 21:23:23] [INFO ] Applying decomposition
[2022-06-12 21:23:23] [INFO ] Flatten gal took : 43 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/graph12732429000709268913.txt, -o, /tmp/graph12732429000709268913.bin, -w, /tmp/graph12732429000709268913.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/graph12732429000709268913.bin, -l, -1, -v, -w, /tmp/graph12732429000709268913.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:23:23] [INFO ] Decomposing Gal with order
[2022-06-12 21:23:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:23:24] [INFO ] Removed a total of 837 redundant transitions.
[2022-06-12 21:23:24] [INFO ] Flatten gal took : 72 ms
[2022-06-12 21:23:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 926 labels/synchronizations in 112 ms.
[2022-06-12 21:23:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality307637460205194217.gal : 14 ms
[2022-06-12 21:23:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4923878082027040194.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality307637460205194217.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4923878082027040194.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality307637460205194217.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4923878082027040194.prop --nowitness
Loading property file /tmp/ReachabilityCardinality4923878082027040194.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 26
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :26 after 90
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :90 after 1.49315e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.49315e+06 after 4.47941e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9769880414266129073
[2022-06-12 21:23:39] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9769880414266129073
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/ltsmin9769880414266129073]
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/ltsmin9769880414266129073] 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/ltsmin9769880414266129073] 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)
Applied a total of 0 rules in 30 ms. Remains 1081 /1081 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-12 21:23:40] [INFO ] Computed 360 place invariants in 10 ms
[2022-06-12 21:23:40] [INFO ] [Real]Absence check using 352 positive place invariants in 95 ms returned sat
[2022-06-12 21:23:40] [INFO ] [Real]Absence check using 352 positive and 8 generalized place invariants in 1 ms returned sat
[2022-06-12 21:23:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:41] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2022-06-12 21:23:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:23:41] [INFO ] [Nat]Absence check using 352 positive place invariants in 73 ms returned sat
[2022-06-12 21:23:41] [INFO ] [Nat]Absence check using 352 positive and 8 generalized place invariants in 1 ms returned sat
[2022-06-12 21:23:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:41] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2022-06-12 21:23:41] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:23:44] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:23:44] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:23:44] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:23:44] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:23:44] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:23:44] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:23:44] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:23:44] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:23:44] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:23:45] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2022-06-12 21:23:45] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2022-06-12 21:23:45] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2022-06-12 21:23:45] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:23:45] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3654 ms
[2022-06-12 21:23:45] [INFO ] Computed and/alt/rep : 993/5115/993 causal constraints (skipped 43 transitions) in 60 ms.
[2022-06-12 21:24:05] [INFO ] Added : 875 causal constraints over 175 iterations in 20126 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-06-12 21:24:05] [INFO ] [Real]Absence check using 352 positive place invariants in 70 ms returned sat
[2022-06-12 21:24:05] [INFO ] [Real]Absence check using 352 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:24:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:24:06] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2022-06-12 21:24:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:24:06] [INFO ] [Nat]Absence check using 352 positive place invariants in 71 ms returned sat
[2022-06-12 21:24:06] [INFO ] [Nat]Absence check using 352 positive and 8 generalized place invariants in 1 ms returned sat
[2022-06-12 21:24:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:24:06] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2022-06-12 21:24:07] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:24:07] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:24:07] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:24:07] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:24:07] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:24:07] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:24:07] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:24:07] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:24:07] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:24:08] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:24:08] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:24:08] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:24:08] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:24:08] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:24:08] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:24:08] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:24:08] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:24:08] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:24:08] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:24:08] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:24:09] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:24:09] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:24:09] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2202 ms
[2022-06-12 21:24:09] [INFO ] Computed and/alt/rep : 993/5115/993 causal constraints (skipped 43 transitions) in 52 ms.
[2022-06-12 21:24:29] [INFO ] Added : 855 causal constraints over 171 iterations in 20102 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 69 ms.
[2022-06-12 21:24:29] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15303519805193408906
[2022-06-12 21:24:29] [INFO ] Computing symmetric may disable matrix : 1042 transitions.
[2022-06-12 21:24:29] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:24:29] [INFO ] Computing symmetric may enable matrix : 1042 transitions.
[2022-06-12 21:24:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:24:29] [INFO ] Flatten gal took : 71 ms
[2022-06-12 21:24:29] [INFO ] Applying decomposition
[2022-06-12 21:24:29] [INFO ] Flatten gal took : 97 ms
[2022-06-12 21:24:29] [INFO ] Input system was already deterministic with 1042 transitions.
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/graph12155172742027287802.txt, -o, /tmp/graph12155172742027287802.bin, -w, /tmp/graph12155172742027287802.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/graph12155172742027287802.bin, -l, -1, -v, -w, /tmp/graph12155172742027287802.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:24:29] [INFO ] Decomposing Gal with order
[2022-06-12 21:24:29] [INFO ] Computing Do-Not-Accords matrix : 1042 transitions.
[2022-06-12 21:24:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:24:29] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:24:29] [INFO ] Built C files in 340ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15303519805193408906
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/ltsmin15303519805193408906]
[2022-06-12 21:24:29] [INFO ] Removed a total of 815 redundant transitions.
[2022-06-12 21:24:29] [INFO ] Flatten gal took : 79 ms
[2022-06-12 21:24:30] [INFO ] Ran tautology test, simplified 0 / 2 in 538 ms.
[2022-06-12 21:24:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 845 labels/synchronizations in 110 ms.
[2022-06-12 21:24:30] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(UNSAT) depth K=0 took 24 ms
[2022-06-12 21:24:30] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(UNSAT) depth K=0 took 2 ms
[2022-06-12 21:24:30] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14126781974173478710.gal : 45 ms
[2022-06-12 21:24:30] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6180618461917994999.prop : 42 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability14126781974173478710.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability6180618461917994999.prop, --nowitness], workingDir=/home/mcc/execution]
[2022-06-12 21:24:30] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(UNSAT) depth K=1 took 33 ms
[2022-06-12 21:24:30] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(UNSAT) depth K=1 took 2 ms

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability14126781974173478710.gal -t CGAL -reachable-file /tmp/ReachabilityFireability6180618461917994999.prop --nowitness
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-12 21:24:30] [INFO ] Computed 360 place invariants in 23 ms
inv : p7 + p8 + p26 + p27 + p553 + p555 + p557 + p559 = 1
inv : p2230 + p2231 + p2234 + p2236 = 1
inv : p7 + p8 + p26 + p27 + p644 + p647 + p648 = 1
inv : p1997 + p2001 + p2006 + p2007 = 1
inv : p7 + p8 + p1362 + p1364 = 1
inv : p7 + p8 + p979 + p981 + p983 + p985 = 1
inv : p7 + p8 + p1459 + p1460 + p1493 + p1495 = 1
inv : p7 + p8 + p1244 + p1246 = 1
inv : p7 + p8 + p26 + p27 + p703 + p708 + p709 = 1
inv : p7 + p8 + p1054 + p1056 = 1
inv : p7 + p8 + p26 + p818 + p820 = 1
inv : p7 + p8 + p1231 + p1233 = 1
inv : p2134 + p2136 + p2138 + p2140 = 1
inv : p7 + p8 + p907 + p909 + p911 + p912 + p913 = 1
inv : p7 + p8 + p939 + p944 + p945 = 1
inv : p7 + p8 + p26 + p27 + p32 + p456 + p457 + p458 + p490 + p492 = 1
inv : p7 + p8 + p1247 + p1249 + p1251 + p1253 = 1
inv : p7 + p8 + p26 + p27 + p582 + p584 = 1
inv : p2119 + p2122 + p2123 = 1
inv : p7 + p8 + p903 + p905 = 1
inv : p2378 + p2380 = 1
inv : p2011 + p2013 = 1
inv : p2287 + p2306 + p2308 = 1
inv : p7 + p8 + p26 + p27 + p681 + p684 + p686 + p688 + p689 = 1
inv : p7 + p8 + p989 + p995 + p997 = 1
inv : p7 + p8 + p1330 + p1333 + p1335 + p1337 = 1
inv : p2287 + p2323 + p2325 + p2327 + p2329 + p2331 = 1
inv : p7 + p8 + p1057 + p1060 + p1061 = 1
inv : p7 + p8 + p1459 + p1460 + p1507 + p1509 + p1512 + p1514 = 1
inv : p7 + p8 + p1035 + p1038 + p1040 + p1042 + p1043 = 1
inv : p7 + p8 + p26 + p27 + p32 + p61 + p63 = 1
inv : p7 + p8 + p26 + p27 + p762 + p765 + p766 = 1
inv : p7 + p8 + p26 + p27 + p32 + p372 + p374 = 1
inv : p7 + p8 + p880 + p883 + p884 = 1
inv : p7 + p8 + p1628 + p1630 + p1632 + p1634 = 1
inv : p7 + p1969 + p1971 + p1973 + p1975 = 1
inv : p7 + p1934 + p1935 + p1955 + p1957 + p1959 + p1961 + p1963 + p1964 = 1
inv : p7 + p8 + p1759 + p1775 + p1777 = 1
inv : p7 + p8 + p26 + p27 + p585 + p590 + p591 = 1
inv : p7 + p8 + p26 + p27 + p759 + p761 = 1
inv : p2129 + p2131 = 1
inv : p7 + p8 + p1821 + p1823 = 1
inv : p7 + p8 + p989 + p1005 + p1007 = 1
inv : p7 + p8 + p1805 + p1807 + p1809 + p1811 = 1
inv : p7 + p8 + p26 + p27 + p549 + p551 = 1
inv : p7 + p8 + p26 + p27 + p526 + p529 + p530 = 1
inv : p7 + p1934 + p1935 + p1939 + p1941 = 1
inv : p2287 + p2311 + p2313 + p2315 + p2317 = 1
inv : p7 + p8 + p26 + p27 + p32 + p268 + p271 + p273 + p275 = 1
inv : p7 + p8 + p26 + p27 + p592 + p594 = 1
inv : p7 + p8 + p26 + p828 + p830 = 1
inv : -p1532 - p1533 + p1534 + p1535 = 0
inv : p7 + p8 + p26 + p27 + p32 + p150 + p153 + p155 + p157 + p158 + p159 = 1
inv : p2024 + p2026 = 1
inv : p2264 + p2266 + p2268 + p2270 = 1
inv : p7 + p8 + p1861 + p1864 + p1866 + p1868 = 1
inv : p7 + p8 + p1743 + p1746 + p1748 + p1750 + p1751 = 1
inv : p7 + p8 + p1759 + p1760 + p1765 + p1770 + p1771 = 1
inv : p7 + p8 + p1824 + p1827 + p1828 = 1
inv : p7 + p8 + p26 + p27 + p32 + p163 + p199 + p201 + p203 + p205 + p207 = 1
inv : p2230 + p2231 + p2244 + p2246 = 1
inv : p7 + p1979 + p1982 + p1984 + p1986 = 1
inv : p7 + p8 + p1389 + p1392 + p1394 + p1396 = 1
inv : p2028 + p2030 + p2032 + p2034 = 1
inv : p7 + p8 + p1831 + p1833 = 1
inv : p470 + p471 - p472 - p473 = 0
inv : p2215 + p2218 + p2220 + p2222 = 1
inv : p7 + p8 + p1403 + p1404 + p1424 + p1426 + p1428 + p1430 = 1
inv : p7 + p8 + p1706 + p1711 + p1712 = 1
inv : p7 + p8 + p1790 + p1791 = 1
inv : p7 + p8 + p1166 + p1167 + p1198 + p1200 = 1
inv : p7 + p8 + p1166 + p1167 + p1175 + p1180 + p1181 = 1
inv : p7 + p8 + p26 + p27 + p32 + p113 + p118 + p119 = 1
inv : p7 + p8 + p26 + p27 + p563 + p565 + p568 + p570 = 1
inv : p2260 + p2262 = 1
inv : p7 + p8 + p1657 + p1659 = 1
inv : p7 + p8 + p949 + p951 = 1
inv : p7 + p8 + p893 + p895 + p897 + p899 = 1
inv : p7 + p8 + p26 + p27 + p32 + p400 + p431 + p433 = 1
inv : p7 + p8 + p26 + p27 + p32 + p400 + p401 + p415 + p416 + p417 = 1
inv : p1886 + p1887 - p1888 - p1889 = 0
inv : p7 + p8 + p989 + p1011 + p1013 + p1015 + p1017 + p1018 = 1
inv : p7 + p8 + p1143 + p1145 + p1147 + p1149 = 1
inv : p7 + p8 + p26 + p821 + p826 + p827 = 1
inv : p7 + p8 + p26 + p27 + p32 + p456 + p457 + p458 + p480 + p482 + p484 + p486 = 1
inv : p7 + p8 + p954 + p956 + p958 + p960 = 1
inv : p7 + p8 + p26 + p27 + p32 + p231 + p234 + p235 = 1
inv : p7 + p8 + p26 + p27 + p32 + p290 + p295 + p296 = 1
inv : p2085 + p2086 = 1
inv : p7 + p8 + p26 + p27 + p654 + p656 = 1
inv : p2368 + p2372 + p2374 = 1
inv : p7 + p8 + p26 + p27 + p32 + p92 + p94 + p96 + p98 + p100 = 1
inv : p7 + p8 + p26 + p27 + p32 + p54 + p57 + p58 = 1
inv : p7 + p8 + p1375 + p1377 = 1
inv : p7 + p8 + p1834 + p1836 = 1
inv : p7 + p8 + p26 + p27 + p32 + p343 + p344 + p356 + p358 = 1
inv : p7 + p8 + p1212 + p1215 + p1217 + p1219 = 1
inv : p7 + p8 + p917 + p920 + p922 + p924 = 1
inv : p7 + p8 + p26 + p27 + p32 + p400 + p401 + p408 + p410 + p413 + p414 = 1
inv : p2193 + p2195 + p2197 + p2199 = 1
inv : p2287 + p2296 + p2299 + p2300 = 1
inv : p7 + p8 + p26 + p27 + p32 + p290 + p293 + p294 = 1
inv : p7 + p8 + p26 + p27 + p32 + p120 + p122 = 1
inv : p7 + p8 + p26 + p27 + p32 + p81 + p83 + p85 + p87 = 1
inv : p2116 + p2118 = 1
inv : p7 + p8 + p1647 + p1652 + p1653 = 1
inv : p7 + p8 + p962 + p964 = 1
inv : p7 + p8 + p26 + p27 + p740 + p743 + p745 + p747 = 1
inv : p7 + p8 + p1271 + p1274 + p1276 + p1278 = 1
inv : p7 + p8 + p1306 + p1308 + p1310 + p1312 = 1
inv : p7 + p8 + p26 + p27 + p775 + p777 + p779 + p781 = 1
inv : p2060 + p2061 + p2065 + p2066 = 1
inv : p7 + p8 + p26 + p27 + p595 + p597 = 1
inv : p7 + p8 + p1166 + p1167 + p1182 + p1184 = 1
inv : p7 + p8 + p1403 + p1404 + p1421 + p1423 = 1
inv : p7 + p8 + p1778 + p1780 + p1782 + p1784 = 1
inv : p7 + p8 + p989 + p998 + p1001 + p1002 = 1
inv : p2156 + p2159 + p2161 + p2163 = 1
inv : p7 + p8 + p26 + p27 + p32 + p400 + p401 + p418 + p420 = 1
inv : p7 + p8 + p1110 + p1123 + p1125 = 1
inv : p7 + p8 + p1759 + p1760 + p1762 + p1764 = 1
inv : p175 + p176 - p177 - p178 = 0
inv : p7 + p8 + p1352 + p1357 + p1358 = 1
inv : p7 + p8 + p1110 + p1113 + p1115 = 1
inv : p7 + p8 + p1166 + p1167 + p1172 + p1174 = 1
inv : p1997 + p1998 + p1999 + p2000 = 1
inv : p2014 + p2016 + p2018 + p2020 = 1
inv : p7 + p8 + p26 + p27 + p32 + p163 + p182 + p184 = 1
inv : p7 + p8 + p26 + p27 + p713 + p715 = 1
inv : p7 + p8 + p1872 + p1873 + p1874 + p1875 + p1893 + p1895 = 1
inv : p7 + p8 + p26 + p27 + p769 + p771 = 1
inv : p7 + p8 + p1459 + p1460 + p1470 + p1473 + p1474 = 1
inv : p7 + p8 + p1615 + p1618 + p1619 + p1621 = 1
inv : p7 + p8 + p1257 + p1259 = 1
inv : p7 + p8 + p1403 + p1404 + p1407 + p1408 + p1410 = 1
inv : p7 + p8 + p1716 + p1718 = 1
inv : p7 + p8 + p26 + p27 + p32 + p136 + p138 = 1
inv : p7 + p8 + p1234 + p1236 + p1239 + p1240 = 1
inv : p7 + p8 + p1536 + p1538 = 1
inv : p7 + p8 + p1064 + p1066 = 1
inv : p2392 + p2395 + p2397 + p2399 = 1
inv : p7 + p8 + p1403 + p1434 + p1436 + p1437 = 1
inv : p7 + p8 + p1459 + p1460 + p1497 + p1499 + p1501 + p1503 = 1
inv : p7 + p8 + p1403 + p1404 + p1407 + p1411 + p1414 + p1415 = 1
inv : p7 + p8 + p26 + p27 + p539 + p541 + p543 + p545 = 1
inv : p7 + p8 + p1759 + p1760 + p1772 + p1774 = 1
inv : p7 + p8 + p26 + p27 + p32 + p297 + p299 = 1
inv : p7 + p8 + p26 + p27 + p32 + p456 + p457 + p458 + p474 + p476 = 1
inv : p7 + p8 + p26 + p27 + p32 + p51 + p53 = 1
inv : p2126 + p2128 = 1
inv : p2178 + p2183 + p2184 = 1
inv : p7 + p8 + p26 + p27 + p533 + p535 = 1
inv : p7 + p8 + p1300 + p1302 = 1
inv : p7 + p8 + p1526 + p1528 = 1
inv : p7 + p8 + p26 + p27 + p598 + p600 + p602 + p604 = 1
inv : p7 + p8 + p26 + p848 + p850 + p852 + p854 = 1
inv : p7 + p8 + p1588 + p1591 + p1592 = 1
inv : p7 + p8 + p1872 + p1873 + p1874 + p1875 + p1883 + p1888 + p1889 = 1
inv : p2057 + p2059 = 1
inv : p7 + p8 + p26 + p27 + p726 + p728 = 1
inv : p2287 + p2319 + p2321 = 1
inv : p7 + p8 + p1110 + p1116 + p1121 + p1122 = 1
inv : p7 + p8 + p26 + p27 + p32 + p376 + p378 + p380 + p382 = 1
inv : p7 + p8 + p1730 + p1731 + p1732 = 1
inv : p7 + p8 + p26 + p27 + p32 + p246 + p248 + p250 + p252 = 1
inv : p7 + p1934 + p1965 + p1967 = 1
inv : p7 + p8 + p877 + p879 = 1
inv : p7 + p8 + p1290 + p1292 = 1
inv : p7 + p8 + p1837 + p1839 + p1841 + p1843 = 1
inv : p7 + p8 + p1459 + p1460 + p1480 + p1482 = 1
inv : p2073 + p2075 + p2077 + p2079 = 1
inv : p2087 + p2089 + p2091 + p2092 + p2093 = 1
inv : p7 + p8 + p26 + p27 + p32 + p241 + p243 = 1
inv : p7 + p8 + p1585 + p1587 = 1
inv : p7 + p8 + p1847 + p1849 = 1
inv : p2119 + p2124 + p2125 = 1
inv : p7 + p8 + p26 + p27 + p32 + p163 + p185 + p187 + p189 + p191 = 1
inv : p7 + p8 + p1293 + p1298 + p1299 = 1
inv : p7 + p8 + p26 + p27 + p659 + p661 + p663 + p664 + p665 = 1
inv : p7 + p8 + p1556 + p1558 + p1560 + p1562 + p1563 = 1
inv : p7 + p8 + p26 + p27 + p32 + p287 + p289 = 1
inv : p2230 + p2231 + p2237 + p2240 + p2241 = 1
inv : p7 + p8 + p1595 + p1597 = 1
inv : p7 + p8 + p26 + p27 + p32 + p456 + p457 + p458 + p464 + p466 = 1
inv : p7 + p8 + p1365 + p1367 + p1369 + p1371 = 1
inv : p2070 + p2072 = 1
inv : p7 + p8 + p989 + p1025 + p1027 + p1029 + p1031 + p1033 = 1
inv : p7 + p8 + p1566 + p1569 + p1571 + p1573 + p1574 = 1
inv : p7 + p1934 + p1935 + p1949 + p1951 = 1
inv : p7 + p8 + p26 + p27 + p523 + p525 = 1
inv : p7 + p8 + p26 + p844 + p846 = 1
inv : p7 + p8 + p1670 + p1672 = 1
inv : p7 + p8 + p26 + p27 + p32 + p313 + p315 = 1
inv : p7 + p8 + p26 + p27 + p32 + p163 + p169 + p171 = 1
inv : p7 + p8 + p887 + p889 = 1
inv : p7 + p8 + p1759 + p1760 + p1765 + p1768 + p1769 = 1
inv : p7 + p8 + p1097 + p1099 + p1101 + p1103 = 1
inv : p2274 + p2277 + p2279 + p2281 + p2282 = 1
inv : p7 + p8 + p880 + p885 + p886 = 1
inv : p2097 + p2100 + p2102 + p2104 = 1
inv : p7 + p8 + p1611 + p1613 = 1
inv : p2230 + p2231 + p2247 + p2248 + p2249 = 1
inv : p7 + p8 + p26 + p27 + p32 + p254 + p256 + p257 = 1
inv : p7 + p8 + p1644 + p1646 = 1
inv : p7 + p8 + p26 + p27 + p32 + p303 + p305 + p307 + p309 + p311 + p312 = 1
inv : p7 + p8 + p1303 + p1305 = 1
inv : p7 + p8 + p1459 + p1460 + p1467 + p1469 = 1
inv : p7 + p8 + p1706 + p1709 + p1710 = 1
inv : p7 + p8 + p26 + p27 + p32 + p343 + p344 + p349 + p351 + p352 + p353 = 1
inv : p2287 + p2303 + p2305 = 1
inv : p7 + p8 + p26 + p27 + p32 + p400 + p401 + p405 + p407 = 1
inv : p7 + p8 + p26 + p27 + p608 + p610 = 1
inv : p7 + p8 + p26 + p27 + p762 + p767 + p768 = 1
inv : p7 + p8 + p1719 + p1721 + p1723 + p1725 + p1726 = 1
inv : p2230 + p2250 + p2252 + p2254 + p2256 + p2257 = 1
inv : p2188 + p2190 = 1
inv : p7 + p8 + p1057 + p1062 + p1063 = 1
inv : p7 + p8 + p26 + p27 + p718 + p720 + p722 + p724 = 1
inv : p2362 + p2364 = 1
inv : p7 + p8 + p1448 + p1451 + p1453 + p1455 = 1
inv : p7 + p8 + p26 + p27 + p32 + p386 + p389 + p391 + p393 = 1
inv : p7 + p8 + p26 + p27 + p799 + p802 + p804 + p806 = 1
inv : p2067 + p2069 = 1
inv : p7 + p8 + p1166 + p1167 + p1188 + p1190 + p1192 + p1194 = 1
inv : p7 + p8 + p26 + p27 + p32 + p456 + p457 + p458 + p467 + p472 + p473 = 1
inv : p7 + p8 + p1110 + p1126 + p1127 + p1128 = 1
inv : p7 + p8 + p1084 + p1087 + p1088 + p1090 = 1
inv : p7 + p8 + p1654 + p1656 = 1
inv : p7 + p8 + p1660 + p1662 + p1664 + p1666 = 1
inv : p7 + p8 + p26 + p27 + p32 + p54 + p59 + p60 = 1
inv : p7 + p8 + p1872 + p1873 + p1874 + p1875 + p1906 + p1908 = 1
inv : p7 + p8 + p1359 + p1361 = 1
inv : p7 + p8 + p1080 + p1082 = 1
inv : p7 + p8 + p26 + p27 + p641 + p643 = 1
inv : p1178 + p1179 - p1180 - p1181 = 0
inv : p7 + p8 + p1598 + p1600 = 1
inv : p7 + p1934 + p1935 + p1942 + p1944 + p1945 + p1946 = 1
inv : p2060 + p2061 + p2063 + p2064 = 1
inv : p7 + p8 + p1141 + p1142 = 1
inv : p7 + p8 + p26 + p27 + p32 + p231 + p236 + p237 = 1
inv : -p2358 - p2359 + p2360 + p2361 = 0
inv : p7 + p8 + p989 + p1008 + p1010 = 1
inv : p7 + p8 + p26 + p27 + p32 + p163 + p172 + p174 + p177 + p178 = 1
inv : p7 + p8 + p26 + p27 + p32 + p123 + p125 = 1
inv : p7 + p8 + p1438 + p1440 + p1442 + p1444 = 1
inv : p7 + p8 + p1234 + p1236 + p1237 + p1238 = 1
inv : -p352 - p353 + p354 + p355 = 0
inv : p7 + p8 + p1166 + p1202 + p1204 + p1205 + p1206 + p1208 = 1
inv : p7 + p8 + p26 + p27 + p32 + p110 + p112 = 1
inv : p7 + p8 + p26 + p27 + p32 + p163 + p195 + p197 = 1
inv : p2352 + p2354 = 1
inv : -p1945 - p1946 + p1947 + p1948 = 0
inv : p7 + p8 + p26 + p27 + p32 + p456 + p457 + p458 + p494 + p496 + p498 + p500 = 1
inv : p7 + p8 + p26 + p27 + p651 + p653 = 1
inv : p1997 + p2001 + p2004 + p2005 = 1
inv : p2038 + p2040 + p2041 + p2043 + p2045 = 1
inv : p7 + p8 + p1872 + p1873 + p1874 + p1910 + p1912 + p1914 + p1916 = 1
inv : p7 + p8 + p26 + p27 + p585 + p588 + p589 = 1
inv : p7 + p8 + p1129 + p1131 + p1133 + p1135 = 1
inv : p7 + p8 + p26 + p27 + p32 + p64 + p66 = 1
inv : p7 + p8 + p1872 + p1873 + p1920 + p1923 + p1925 + p1927 = 1
inv : p2382 + p2384 + p2386 + p2388 = 1
inv : p7 + p8 + p26 + p831 + p833 = 1
inv : p7 + p8 + p26 + p27 + p622 + p625 + p627 + p629 = 1
inv : p7 + p8 + p26 + p27 + p526 + p531 + p532 = 1
inv : p7 + p8 + p26 + p858 + p861 + p863 + p865 = 1
inv : p7 + p8 + p989 + p1021 + p1023 = 1
inv : p7 + p8 + p26 + p27 + p785 + p787 = 1
inv : p7 + p8 + p1241 + p1243 = 1
inv : p2355 + p2358 + p2359 = 1
inv : p7 + p8 + p26 + p27 + p32 + p445 + p448 + p450 + p452 = 1
inv : p7 + p8 + p26 + p27 + p32 + p435 + p437 + p438 + p439 + p441 = 1
inv : p2175 + p2177 = 1
inv : p7 + p8 + p26 + p27 + p32 + p456 + p457 + p504 + p507 + p509 + p511 = 1
inv : p7 + p8 + p1824 + p1829 + p1830 = 1
inv : p2142 + p2144 = 1
inv : p7 + p8 + p26 + p27 + p32 + p228 + p230 = 1
inv : p7 + p8 + p26 + p27 + p32 + p40 + p42 = 1
inv : p2201 + p2203 = 1
inv : p7 + p8 + p26 + p834 + p836 + p838 + p840 = 1
inv : p7 + p8 + p26 + p27 + p32 + p343 + p344 + p346 + p348 = 1
inv : p7 + p8 + p26 + p27 + p32 + p456 + p457 + p458 + p477 + p479 = 1
inv : p7 + p8 + p26 + p27 + p32 + p300 + p302 = 1
inv : p7 + p8 + p1588 + p1593 + p1594 = 1
inv : p7 + p8 + p1110 + p1116 + p1119 + p1120 = 1
inv : p7 + p8 + p1153 + p1156 + p1158 + p1160 = 1
inv : p7 + p8 + p26 + p27 + p32 + p362 + p364 + p366 + p368 = 1
inv : p7 + p8 + p1539 + p1541 = 1
inv : p2333 + p2336 + p2338 + p2340 = 1
inv : p7 + p8 + p1459 + p1460 + p1483 + p1485 + p1487 + p1489 = 1
inv : p7 + p8 + p966 + p968 + p970 + p972 + p973 + p974 = 1
inv : p7 + p8 + p936 + p938 = 1
inv : p7 + p8 + p1529 + p1532 + p1533 = 1
inv : p7 + p8 + p26 + p27 + p612 + p614 + p616 + p618 = 1
inv : p7 + p8 + p1459 + p1460 + p1470 + p1475 + p1476 = 1
inv : p7 + p8 + p26 + p27 + p667 + p669 = 1
inv : p7 + p8 + p1070 + p1072 + p1074 + p1076 = 1
inv : p7 + p8 + p26 + p27 + p32 + p400 + p401 + p423 + p425 + p427 + p429 = 1
inv : p7 + p8 + p26 + p821 + p824 + p825 = 1
inv : p7 + p8 + p1316 + p1318 = 1
inv : p7 + p8 + p989 + p998 + p1003 + p1004 = 1
inv : p7 + p8 + p1675 + p1676 + p1678 + p1679 + p1680 + p1682 = 1
inv : p7 + p8 + p1542 + p1544 + p1546 + p1548 = 1
inv : p7 + p8 + p26 + p27 + p32 + p163 + p179 + p181 = 1
inv : p7 + p8 + p26 + p27 + p710 + p712 = 1
inv : p7 + p8 + p1349 + p1351 = 1
inv : p7 + p8 + p1733 + p1735 + p1737 + p1739 = 1
inv : p7 + p8 + p26 + p27 + p536 + p538 = 1
inv : p7 + p8 + p946 + p948 = 1
inv : p7 + p8 + p26 + p27 + p32 + p67 + p69 + p71 + p73 = 1
inv : p7 + p8 + p1067 + p1069 = 1
inv : p2185 + p2187 = 1
inv : p2230 + p2231 + p2237 + p2242 + p2243 = 1
inv : p2287 + p2296 + p2301 + p2302 = 1
inv : p7 + p8 + p26 + p27 + p32 + p113 + p116 + p117 = 1
inv : p7 + p1934 + p1935 + p1952 + p1954 = 1
inv : p7 + p8 + p939 + p942 + p943 = 1
inv : p7 + p8 + p26 + p27 + p703 + p706 + p707 = 1
inv : p7 + p8 + p26 + p27 + p791 + p793 + p795 + p797 = 1
inv : p7 + p8 + p1166 + p1167 + p1185 + p1187 = 1
inv : p7 + p8 + p1647 + p1650 + p1651 = 1
inv : p7 + p8 + p1320 + p1322 + p1324 + p1326 = 1
inv : p7 + p8 + p26 + p27 + p32 + p400 + p401 + p408 + p410 + p411 + p412 = 1
inv : p7 + p8 + p1293 + p1296 + p1297 = 1
inv : p7 + p8 + p26 + p27 + p700 + p702 = 1
inv : p7 + p8 + p890 + p892 = 1
inv : p7 + p8 + p1684 + p1687 + p1689 + p1691 = 1
inv : p7 + p8 + p1601 + p1603 + p1605 + p1607 + p1608 = 1
inv : p2287 + p2293 + p2295 = 1
inv : p7 + p8 + p26 + p27 + p32 + p327 + p330 + p332 + p334 + p335 = 1
inv : p7 + p8 + p26 + p27 + p32 + p238 + p240 = 1
inv : p7 + p8 + p1261 + p1263 + p1265 + p1267 = 1
inv : p7 + p8 + p1872 + p1873 + p1874 + p1875 + p1880 + p1882 = 1
inv : p7 + p8 + p1459 + p1460 + p1477 + p1479 = 1
inv : p7 + p8 + p26 + p27 + p32 + p317 + p319 + p321 + p323 + p324 = 1
inv : p7 + p8 + p1792 + p1794 + p1796 + p1798 = 1
inv : p7 + p8 + p1713 + p1715 = 1
inv : p7 + p8 + p26 + p27 + p644 + p649 + p650 = 1
inv : p7 + p8 + p26 + p27 + p32 + p126 + p128 + p130 + p132 = 1
inv : p7 + p8 + p26 + p27 + p32 + p209 + p212 + p213 + p214 + p216 = 1
inv : p7 + p8 + p26 + p27 + p32 + p258 + p260 + p262 + p264 = 1
inv : p7 + p8 + p26 + p27 + p671 + p673 + p675 + p677 = 1
inv : p7 + p8 + p1381 + p1383 + p1385 + p1387 = 1
inv : p7 + p8 + p1352 + p1355 + p1356 = 1
inv : p7 + p8 + p1403 + p1404 + p1418 + p1420 = 1
inv : p7 + p8 + p1872 + p1873 + p1874 + p1875 + p1896 + p1898 + p1900 + p1902 = 1
inv : p7 + p8 + p26 + p27 + p32 + p343 + p359 + p360 + p361 = 1
inv : p7 + p8 + p26 + p27 + p730 + p732 + p734 + p736 = 1
inv : p7 + p8 + p1552 + p1554 = 1
inv : p7 + p8 + p1851 + p1853 + p1855 + p1857 = 1
inv : p2008 + p2010 = 1
inv : p2178 + p2181 + p2182 = 1
inv : p7 + p8 + p26 + p27 + p32 + p140 + p142 + p144 + p146 + p147 = 1
inv : p2205 + p2207 + p2209 + p2211 = 1
inv : p7 + p8 + p1703 + p1705 = 1
inv : p2146 + p2148 + p2150 + p2152 = 1
inv : p7 + p8 + p1403 + p1404 + p1407 + p1411 + p1416 + p1417 = 1
inv : p7 + p8 + p26 + p27 + p32 + p77 + p79 = 1
inv : p7 + p8 + p26 + p27 + p772 + p774 = 1
inv : p7 + p8 + p1872 + p1873 + p1874 + p1875 + p1890 + p1892 = 1
Total of 360 invariants.
[2022-06-12 21:24:30] [INFO ] Computed 360 place invariants in 40 ms
Loading property file /tmp/ReachabilityFireability6180618461917994999.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 56
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :56 after 15256
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :15256 after 1.16666e+06
[2022-06-12 21:24:31] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(UNSAT) depth K=2 took 1169 ms
[2022-06-12 21:24:31] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(UNSAT) depth K=2 took 449 ms
[2022-06-12 21:24:33] [INFO ] Proved 1081 variables to be positive in 2722 ms
[2022-06-12 21:24:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-01
[2022-06-12 21:24:33] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(SAT) depth K=0 took 401 ms
[2022-06-12 21:24:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-06
[2022-06-12 21:24:33] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(SAT) depth K=0 took 151 ms
[2022-06-12 21:24:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-01
[2022-06-12 21:24:34] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(SAT) depth K=1 took 603 ms
[2022-06-12 21:24:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-06
[2022-06-12 21:24:35] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(SAT) depth K=1 took 1304 ms
Compilation finished in 9420 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15303519805193408906]
Link finished in 74 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, -p, --pins-guards, --when, -i, ShieldIIPsPT040BReachabilityFireability01==true], workingDir=/tmp/ltsmin15303519805193408906]
[2022-06-12 21:25:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-01
[2022-06-12 21:25:04] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(SAT) depth K=2 took 28609 ms
[2022-06-12 21:26:13] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(UNSAT) depth K=3 took 101930 ms
[2022-06-12 21:26:41] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(UNSAT) depth K=3 took 27499 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.16666e+06 after 2.43493e+22
[2022-06-12 21:32:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-06
[2022-06-12 21:32:56] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(SAT) depth K=2 took 472039 ms
[2022-06-12 21:38:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-01
[2022-06-12 21:38:14] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(SAT) depth K=3 took 318389 ms
Detected timeout of ITS tools.
[2022-06-12 21:46:55] [INFO ] Applying decomposition
[2022-06-12 21:46:55] [INFO ] Flatten gal took : 133 ms
[2022-06-12 21:46:55] [INFO ] Decomposing Gal with order
[2022-06-12 21:46:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:46:55] [INFO ] Removed a total of 837 redundant transitions.
[2022-06-12 21:46:55] [INFO ] Flatten gal took : 213 ms
[2022-06-12 21:46:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 926 labels/synchronizations in 302 ms.
[2022-06-12 21:46:56] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12184540060991642820.gal : 40 ms
[2022-06-12 21:46:56] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5762204708129695680.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability12184540060991642820.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability5762204708129695680.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability12184540060991642820.gal -t CGAL -reachable-file /tmp/ReachabilityFireability5762204708129695680.prop --nowitness
Loading property file /tmp/ReachabilityFireability5762204708129695680.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 52
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :52 after 420028
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :420028 after 8.95883e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :8.95883e+06 after 6.71911e+07
WARNING : LTSmin timed out (>1800 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, -p, --pins-guards, --when, -i, ShieldIIPsPT040BReachabilityFireability01==true], workingDir=/tmp/ltsmin15303519805193408906]
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, -p, --pins-guards, --when, -i, ShieldIIPsPT040BReachabilityFireability06==true], workingDir=/tmp/ltsmin15303519805193408906]
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3.8424e+21 after 5.90879e+30
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5.90879e+30 after 2.99963e+51
Detected timeout of ITS tools.
[2022-06-12 22:09:20] [INFO ] Flatten gal took : 126 ms
[2022-06-12 22:09:21] [INFO ] Input system was already deterministic with 1042 transitions.
[2022-06-12 22:09:21] [INFO ] Transformed 1081 places.
[2022-06-12 22:09:21] [INFO ] Transformed 1042 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
[2022-06-12 22:09:21] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3431483356960671131.gal : 4 ms
[2022-06-12 22:09:21] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16244219885509052539.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability3431483356960671131.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability16244219885509052539.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability3431483356960671131.gal -t CGAL -reachable-file /tmp/ReachabilityFireability16244219885509052539.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability16244219885509052539.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 50
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :50 after 74
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :74 after 702
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :702 after 1606
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1606 after 28992
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :28992 after 485889
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :485889 after 1.70508e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.70508e+06 after 4.56586e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.56586e+06 after 2.5195e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.5195e+08 after 1.6725e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.6725e+10 after 2.33105e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.33105e+10 after 2.67707e+11
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.67707e+11 after 5.56106e+12
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :5.56106e+12 after 4.47609e+13
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :4.47609e+13 after 6.00633e+14
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :6.00633e+14 after 1.88101e+16
[2022-06-12 22:15:14] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(UNSAT) depth K=4 took 2912689 ms
SDD proceeding with computation,2 properties remain. new max is 1048576
SDD size :1.88101e+16 after 6.07165e+17

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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="ShieldIIPs-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is ShieldIIPs-PT-040B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-165286037000054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040B.tgz
mv ShieldIIPs-PT-040B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;