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-165286037400251.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 ShieldPPPt-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037400251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 29 13:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 29 13:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 29 13:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 29 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 29 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 13:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 29 13:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 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 762K 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 ShieldPPPt-PT-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655076269823

Running Version 0
[2022-06-12 23:24:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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 23:24:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 23:24:31] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2022-06-12 23:24:31] [INFO ] Transformed 3123 places.
[2022-06-12 23:24:31] [INFO ] Transformed 2843 transitions.
[2022-06-12 23:24:31] [INFO ] Found NUPN structural information;
[2022-06-12 23:24:31] [INFO ] Parsed PT model containing 3123 places and 2843 transitions in 315 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 114 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 15) seen :3
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) 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 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2843 rows 3123 cols
[2022-06-12 23:24:32] [INFO ] Computed 441 place invariants in 52 ms
[2022-06-12 23:24:33] [INFO ] [Real]Absence check using 441 positive place invariants in 233 ms returned sat
[2022-06-12 23:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:24:35] [INFO ] [Real]Absence check using state equation in 2142 ms returned sat
[2022-06-12 23:24:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:24:36] [INFO ] [Nat]Absence check using 441 positive place invariants in 217 ms returned sat
[2022-06-12 23:24:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:24:38] [INFO ] [Nat]Absence check using state equation in 2118 ms returned sat
[2022-06-12 23:24:39] [INFO ] Deduced a trap composed of 22 places in 1115 ms of which 13 ms to minimize.
[2022-06-12 23:24:40] [INFO ] Deduced a trap composed of 21 places in 989 ms of which 6 ms to minimize.
[2022-06-12 23:24:40] [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 23:24:41] [INFO ] [Real]Absence check using 441 positive place invariants in 211 ms returned sat
[2022-06-12 23:24:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:24:42] [INFO ] [Real]Absence check using state equation in 1436 ms returned sat
[2022-06-12 23:24:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:24:44] [INFO ] [Real]Absence check using 441 positive place invariants in 200 ms returned sat
[2022-06-12 23:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:24:45] [INFO ] [Real]Absence check using state equation in 1445 ms returned sat
[2022-06-12 23:24:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:24:46] [INFO ] [Real]Absence check using 441 positive place invariants in 190 ms returned sat
[2022-06-12 23:24:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:24:48] [INFO ] [Real]Absence check using state equation in 1662 ms returned sat
[2022-06-12 23:24:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:24:49] [INFO ] [Nat]Absence check using 441 positive place invariants in 206 ms returned sat
[2022-06-12 23:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:24:50] [INFO ] [Nat]Absence check using state equation in 1751 ms returned sat
[2022-06-12 23:24:52] [INFO ] Deduced a trap composed of 23 places in 998 ms of which 6 ms to minimize.
[2022-06-12 23:24:53] [INFO ] Deduced a trap composed of 29 places in 938 ms of which 2 ms to minimize.
[2022-06-12 23:24:54] [INFO ] Deduced a trap composed of 26 places in 998 ms of which 8 ms to minimize.
[2022-06-12 23:24:54] [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 23:24:54] [INFO ] [Real]Absence check using 441 positive place invariants in 215 ms returned sat
[2022-06-12 23:24:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:24:57] [INFO ] [Real]Absence check using state equation in 2620 ms returned sat
[2022-06-12 23:24:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:24:58] [INFO ] [Nat]Absence check using 441 positive place invariants in 208 ms returned sat
[2022-06-12 23:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:25:00] [INFO ] [Nat]Absence check using state equation in 1799 ms returned sat
[2022-06-12 23:25:01] [INFO ] Deduced a trap composed of 33 places in 1118 ms of which 5 ms to minimize.
[2022-06-12 23:25:02] [INFO ] Deduced a trap composed of 25 places in 1070 ms of which 3 ms to minimize.
[2022-06-12 23:25:03] [INFO ] Deduced a trap composed of 22 places in 1073 ms of which 3 ms to minimize.
[2022-06-12 23:25:03] [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 23:25:04] [INFO ] [Real]Absence check using 441 positive place invariants in 219 ms returned sat
[2022-06-12 23:25:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:25:06] [INFO ] [Real]Absence check using state equation in 2329 ms returned sat
[2022-06-12 23:25:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:25:07] [INFO ] [Nat]Absence check using 441 positive place invariants in 219 ms returned sat
[2022-06-12 23:25:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:25:09] [INFO ] [Nat]Absence check using state equation in 2417 ms returned sat
[2022-06-12 23:25:10] [INFO ] Deduced a trap composed of 34 places in 928 ms of which 2 ms to minimize.
[2022-06-12 23:25:11] [INFO ] Deduced a trap composed of 22 places in 938 ms of which 2 ms to minimize.
[2022-06-12 23:25:11] [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 23:25:12] [INFO ] [Real]Absence check using 441 positive place invariants in 210 ms returned sat
[2022-06-12 23:25:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:25:14] [INFO ] [Real]Absence check using state equation in 2055 ms returned sat
[2022-06-12 23:25:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:25:15] [INFO ] [Nat]Absence check using 441 positive place invariants in 208 ms returned sat
[2022-06-12 23:25:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:25:17] [INFO ] [Nat]Absence check using state equation in 1749 ms returned sat
[2022-06-12 23:25:18] [INFO ] Deduced a trap composed of 20 places in 1020 ms of which 2 ms to minimize.
[2022-06-12 23:25:19] [INFO ] Deduced a trap composed of 20 places in 1011 ms of which 3 ms to minimize.
[2022-06-12 23:25:20] [INFO ] Deduced a trap composed of 23 places in 976 ms of which 2 ms to minimize.
[2022-06-12 23:25:20] [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 23:25:20] [INFO ] [Real]Absence check using 441 positive place invariants in 192 ms returned sat
[2022-06-12 23:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:25:22] [INFO ] [Real]Absence check using state equation in 1403 ms returned sat
[2022-06-12 23:25:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:25:23] [INFO ] [Nat]Absence check using 441 positive place invariants in 209 ms returned sat
[2022-06-12 23:25:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:25:24] [INFO ] [Nat]Absence check using state equation in 1407 ms returned sat
[2022-06-12 23:25:25] [INFO ] Deduced a trap composed of 18 places in 1203 ms of which 3 ms to minimize.
[2022-06-12 23:25:27] [INFO ] Deduced a trap composed of 28 places in 1162 ms of which 3 ms to minimize.
[2022-06-12 23:25:28] [INFO ] Deduced a trap composed of 22 places in 1196 ms of which 2 ms to minimize.
[2022-06-12 23:25:28] [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 23:25:28] [INFO ] [Real]Absence check using 441 positive place invariants in 228 ms returned sat
[2022-06-12 23:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:25:31] [INFO ] [Real]Absence check using state equation in 2381 ms returned sat
[2022-06-12 23:25:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:25:32] [INFO ] [Nat]Absence check using 441 positive place invariants in 228 ms returned sat
[2022-06-12 23:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:25:34] [INFO ] [Nat]Absence check using state equation in 2134 ms returned sat
[2022-06-12 23:25:35] [INFO ] Deduced a trap composed of 25 places in 903 ms of which 3 ms to minimize.
[2022-06-12 23:25:36] [INFO ] Deduced a trap composed of 21 places in 921 ms of which 2 ms to minimize.
[2022-06-12 23:25:37] [INFO ] Deduced a trap composed of 22 places in 872 ms of which 2 ms to minimize.
[2022-06-12 23:25:37] [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
[2022-06-12 23:25:37] [INFO ] [Real]Absence check using 441 positive place invariants in 246 ms returned sat
[2022-06-12 23:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:25:41] [INFO ] [Real]Absence check using state equation in 3552 ms returned sat
[2022-06-12 23:25:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:25:42] [INFO ] [Real]Absence check using 441 positive place invariants in 218 ms returned sat
[2022-06-12 23:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:25:44] [INFO ] [Real]Absence check using state equation in 2078 ms returned sat
[2022-06-12 23:25:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:25:45] [INFO ] [Real]Absence check using 441 positive place invariants in 213 ms returned sat
[2022-06-12 23:25:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:25:47] [INFO ] [Real]Absence check using state equation in 1412 ms returned sat
[2022-06-12 23:25:48] [INFO ] Deduced a trap composed of 25 places in 943 ms of which 2 ms to minimize.
[2022-06-12 23:25:49] [INFO ] Deduced a trap composed of 29 places in 949 ms of which 2 ms to minimize.
[2022-06-12 23:25:50] [INFO ] Deduced a trap composed of 19 places in 920 ms of which 2 ms to minimize.
[2022-06-12 23:25:50] [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 11
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 1 different solutions.
Support contains 96 out of 3123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions removed 691 transitions
Trivial Post-agglo rules discarded 691 transitions
Performed 691 trivial Post agglomeration. Transition count delta: 691
Iterating post reduction 0 with 691 rules applied. Total rules applied 691 place count 3123 transition count 2152
Reduce places removed 691 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 693 rules applied. Total rules applied 1384 place count 2432 transition count 2150
Reduce places removed 1 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 16 rules applied. Total rules applied 1400 place count 2431 transition count 2135
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 1415 place count 2416 transition count 2135
Performed 172 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 172 Pre rules applied. Total rules applied 1415 place count 2416 transition count 1963
Deduced a syphon composed of 172 places in 19 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 4 with 344 rules applied. Total rules applied 1759 place count 2244 transition count 1963
Discarding 262 places :
Symmetric choice reduction at 4 with 262 rule applications. Total rules 2021 place count 1982 transition count 1701
Iterating global reduction 4 with 262 rules applied. Total rules applied 2283 place count 1982 transition count 1701
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 110 Pre rules applied. Total rules applied 2283 place count 1982 transition count 1591
Deduced a syphon composed of 110 places in 40 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 2503 place count 1872 transition count 1591
Performed 625 Post agglomeration using F-continuation condition.Transition count delta: 625
Deduced a syphon composed of 625 places in 20 ms
Reduce places removed 625 places and 0 transitions.
Iterating global reduction 4 with 1250 rules applied. Total rules applied 3753 place count 1247 transition count 966
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 12 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3955 place count 1146 transition count 966
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 3971 place count 1138 transition count 966
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 3976 place count 1138 transition count 961
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 3981 place count 1133 transition count 961
Partial Free-agglomeration rule applied 109 times.
Drop transitions removed 109 transitions
Iterating global reduction 5 with 109 rules applied. Total rules applied 4090 place count 1133 transition count 961
Applied a total of 4090 rules in 1382 ms. Remains 1133 /3123 variables (removed 1990) and now considering 961/2843 (removed 1882) transitions.
Finished structural reductions, in 1 iterations. Remains : 1133/3123 places, 961/2843 transitions.
[2022-06-12 23:25:52] [INFO ] Flatten gal took : 222 ms
[2022-06-12 23:25:52] [INFO ] Flatten gal took : 84 ms
[2022-06-12 23:25:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2274724730563853331.gal : 34 ms
[2022-06-12 23:25:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10097729360932187681.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/ReachabilityCardinality2274724730563853331.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10097729360932187681.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/ReachabilityCardinality2274724730563853331.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10097729360932187681.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10097729360932187681.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :2 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :13 after 166
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :166 after 5836
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :5836 after 1.7496e+06
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1.7496e+06 after 1.62125e+11
Invariant property ShieldPPPt-PT-040B-ReachabilityCardinality-08 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :1.62125e+11 after 3.22306e+15
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :3.22306e+15 after 3.22306e+15
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :3.22306e+15 after 3.22306e+15
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :3.22306e+15 after 3.22307e+15
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :3.22307e+15 after 3.22311e+15
Detected timeout of ITS tools.
[2022-06-12 23:26:07] [INFO ] Flatten gal took : 67 ms
[2022-06-12 23:26:07] [INFO ] Applying decomposition
[2022-06-12 23:26:07] [INFO ] Flatten gal took : 82 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/graph7065490560464529799.txt, -o, /tmp/graph7065490560464529799.bin, -w, /tmp/graph7065490560464529799.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/graph7065490560464529799.bin, -l, -1, -v, -w, /tmp/graph7065490560464529799.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:26:08] [INFO ] Decomposing Gal with order
[2022-06-12 23:26:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:26:08] [INFO ] Removed a total of 529 redundant transitions.
[2022-06-12 23:26:08] [INFO ] Flatten gal took : 262 ms
[2022-06-12 23:26:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 70 ms.
[2022-06-12 23:26:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2478727335567085330.gal : 20 ms
[2022-06-12 23:26:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6988791228253646969.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/ReachabilityCardinality2478727335567085330.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6988791228253646969.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/ReachabilityCardinality2478727335567085330.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6988791228253646969.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6988791228253646969.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 77
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :2.5536e+06 after 7.65888e+06
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :7.65888e+06 after 6.28639e+10
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :6.28639e+10 after 1.78677e+13
Invariant property ShieldPPPt-PT-040B-ReachabilityCardinality-06 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :4.46753e+20 after 1.60886e+45
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6005506582855473301
[2022-06-12 23:26:23] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6005506582855473301
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/ltsmin6005506582855473301]
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/ltsmin6005506582855473301] 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/ltsmin6005506582855473301] 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 2 resets, run finished after 7327 ms. (steps per millisecond=136 ) properties (out of 6) seen :1
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4565 ms. (steps per millisecond=219 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 4742 ms. (steps per millisecond=210 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4488 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 957101 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4531 ms. (steps per millisecond=220 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 961 rows 1133 cols
[2022-06-12 23:26:55] [INFO ] Computed 441 place invariants in 10 ms
[2022-06-12 23:26:55] [INFO ] [Real]Absence check using 441 positive place invariants in 154 ms returned sat
[2022-06-12 23:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:26:56] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2022-06-12 23:26:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:26:56] [INFO ] [Nat]Absence check using 441 positive place invariants in 98 ms returned sat
[2022-06-12 23:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:26:57] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2022-06-12 23:26:57] [INFO ] State equation strengthened by 238 read => feed constraints.
[2022-06-12 23:26:57] [INFO ] [Nat]Added 238 Read/Feed constraints in 65 ms returned sat
[2022-06-12 23:26:57] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2022-06-12 23:26:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-06-12 23:26:57] [INFO ] Computed and/alt/rep : 960/3621/960 causal constraints (skipped 0 transitions) in 59 ms.
[2022-06-12 23:27:17] [INFO ] Added : 905 causal constraints over 181 iterations in 20482 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 144 ms.
[2022-06-12 23:27:18] [INFO ] [Real]Absence check using 441 positive place invariants in 86 ms returned sat
[2022-06-12 23:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:27:18] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2022-06-12 23:27:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:27:18] [INFO ] [Nat]Absence check using 441 positive place invariants in 83 ms returned sat
[2022-06-12 23:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:27:19] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2022-06-12 23:27:19] [INFO ] [Nat]Added 238 Read/Feed constraints in 61 ms returned sat
[2022-06-12 23:27:19] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2022-06-12 23:27:19] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2022-06-12 23:27:19] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2022-06-12 23:27:19] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2022-06-12 23:27:19] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2022-06-12 23:27:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 389 ms
[2022-06-12 23:27:19] [INFO ] Computed and/alt/rep : 960/3621/960 causal constraints (skipped 0 transitions) in 48 ms.
[2022-06-12 23:27:39] [INFO ] Added : 900 causal constraints over 180 iterations in 20136 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-06-12 23:27:39] [INFO ] [Real]Absence check using 441 positive place invariants in 80 ms returned sat
[2022-06-12 23:27:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:27:40] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2022-06-12 23:27:40] [INFO ] [Real]Added 238 Read/Feed constraints in 27 ms returned sat
[2022-06-12 23:27:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:27:40] [INFO ] [Nat]Absence check using 441 positive place invariants in 81 ms returned sat
[2022-06-12 23:27:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:27:40] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2022-06-12 23:27:40] [INFO ] [Nat]Added 238 Read/Feed constraints in 66 ms returned sat
[2022-06-12 23:27:41] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2022-06-12 23:27:41] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2022-06-12 23:27:41] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2022-06-12 23:27:41] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2022-06-12 23:27:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 357 ms
[2022-06-12 23:27:41] [INFO ] Computed and/alt/rep : 960/3621/960 causal constraints (skipped 0 transitions) in 55 ms.
[2022-06-12 23:28:01] [INFO ] Added : 865 causal constraints over 173 iterations in 20178 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-06-12 23:28:01] [INFO ] [Real]Absence check using 441 positive place invariants in 91 ms returned sat
[2022-06-12 23:28:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:28:02] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2022-06-12 23:28:02] [INFO ] [Real]Added 238 Read/Feed constraints in 27 ms returned sat
[2022-06-12 23:28:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:28:02] [INFO ] [Nat]Absence check using 441 positive place invariants in 92 ms returned sat
[2022-06-12 23:28:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:28:02] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2022-06-12 23:28:03] [INFO ] [Nat]Added 238 Read/Feed constraints in 71 ms returned sat
[2022-06-12 23:28:03] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2022-06-12 23:28:03] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2022-06-12 23:28:03] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2022-06-12 23:28:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 277 ms
[2022-06-12 23:28:03] [INFO ] Computed and/alt/rep : 960/3621/960 causal constraints (skipped 0 transitions) in 45 ms.
[2022-06-12 23:28:23] [INFO ] Added : 870 causal constraints over 174 iterations in 20248 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-06-12 23:28:23] [INFO ] [Real]Absence check using 441 positive place invariants in 77 ms returned sat
[2022-06-12 23:28:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:28:24] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2022-06-12 23:28:24] [INFO ] [Real]Added 238 Read/Feed constraints in 26 ms returned sat
[2022-06-12 23:28:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:28:24] [INFO ] [Nat]Absence check using 441 positive place invariants in 78 ms returned sat
[2022-06-12 23:28:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:28:24] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2022-06-12 23:28:24] [INFO ] [Nat]Added 238 Read/Feed constraints in 52 ms returned sat
[2022-06-12 23:28:24] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2022-06-12 23:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-06-12 23:28:25] [INFO ] Computed and/alt/rep : 960/3621/960 causal constraints (skipped 0 transitions) in 46 ms.
[2022-06-12 23:28:45] [INFO ] Added : 900 causal constraints over 180 iterations in 20190 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 95 ms.
Incomplete Parikh walk after 225200 steps, including 1000 resets, run finished after 1435 ms. (steps per millisecond=156 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 142800 steps, including 1000 resets, run finished after 926 ms. (steps per millisecond=154 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 168400 steps, including 1000 resets, run finished after 1080 ms. (steps per millisecond=155 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 109200 steps, including 978 resets, run finished after 735 ms. (steps per millisecond=148 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 116900 steps, including 511 resets, run finished after 776 ms. (steps per millisecond=150 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 69 out of 1133 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1133/1133 places, 961/961 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1133 transition count 953
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 1125 transition count 953
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 1125 transition count 951
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 1123 transition count 951
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 76 place count 1095 transition count 923
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 1093 transition count 923
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 1093 transition count 921
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 1091 transition count 921
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 1091 transition count 921
Applied a total of 86 rules in 270 ms. Remains 1091 /1133 variables (removed 42) and now considering 921/961 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1133 places, 921/961 transitions.
[2022-06-12 23:28:50] [INFO ] Flatten gal took : 45 ms
[2022-06-12 23:28:50] [INFO ] Flatten gal took : 45 ms
[2022-06-12 23:28:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11622975025916539157.gal : 6 ms
[2022-06-12 23:28:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12361550950530212203.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/ReachabilityCardinality11622975025916539157.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12361550950530212203.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/ReachabilityCardinality11622975025916539157.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12361550950530212203.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12361550950530212203.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :2 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :15 after 219
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :219 after 4323
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :4323 after 486003
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :486003 after 2.76437e+10
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2.76437e+10 after 2.78625e+10
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2.78625e+10 after 2.78688e+10
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :2.78688e+10 after 3.99075e+10
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :3.99075e+10 after 5.06229e+12
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :5.06229e+12 after 2.93941e+14
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :2.93941e+14 after 1.27605e+18
Detected timeout of ITS tools.
[2022-06-12 23:29:05] [INFO ] Flatten gal took : 44 ms
[2022-06-12 23:29:05] [INFO ] Applying decomposition
[2022-06-12 23:29:05] [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/graph13981534298159680184.txt, -o, /tmp/graph13981534298159680184.bin, -w, /tmp/graph13981534298159680184.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/graph13981534298159680184.bin, -l, -1, -v, -w, /tmp/graph13981534298159680184.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:29:05] [INFO ] Decomposing Gal with order
[2022-06-12 23:29:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:29:06] [INFO ] Removed a total of 536 redundant transitions.
[2022-06-12 23:29:06] [INFO ] Flatten gal took : 69 ms
[2022-06-12 23:29:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 230 labels/synchronizations in 76 ms.
[2022-06-12 23:29:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5332316093780943359.gal : 11 ms
[2022-06-12 23:29:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10582885623196478257.prop : 117 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/ReachabilityCardinality5332316093780943359.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10582885623196478257.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/ReachabilityCardinality5332316093780943359.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10582885623196478257.prop --nowitness
Loading property file /tmp/ReachabilityCardinality10582885623196478257.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 25
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :5.10336e+06 after 5.10912e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14548991236292586732
[2022-06-12 23:29:21] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14548991236292586732
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/ltsmin14548991236292586732]
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/ltsmin14548991236292586732] 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/ltsmin14548991236292586732] 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 2 resets, run finished after 6998 ms. (steps per millisecond=142 ) properties (out of 5) seen :1
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4539 ms. (steps per millisecond=220 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4633 ms. (steps per millisecond=215 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4443 ms. (steps per millisecond=225 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 953536 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=190 ) properties seen :{}
Running SMT prover for 4 properties.
// Phase 1: matrix 921 rows 1091 cols
[2022-06-12 23:29:48] [INFO ] Computed 441 place invariants in 11 ms
[2022-06-12 23:29:48] [INFO ] [Real]Absence check using 441 positive place invariants in 88 ms returned sat
[2022-06-12 23:29:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:29:48] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2022-06-12 23:29:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:29:48] [INFO ] [Nat]Absence check using 441 positive place invariants in 85 ms returned sat
[2022-06-12 23:29:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:29:49] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2022-06-12 23:29:49] [INFO ] State equation strengthened by 243 read => feed constraints.
[2022-06-12 23:29:49] [INFO ] [Nat]Added 243 Read/Feed constraints in 53 ms returned sat
[2022-06-12 23:29:49] [INFO ] Computed and/alt/rep : 920/3614/920 causal constraints (skipped 0 transitions) in 48 ms.
[2022-06-12 23:30:10] [INFO ] Added : 890 causal constraints over 178 iterations in 21307 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 122 ms.
[2022-06-12 23:30:10] [INFO ] [Real]Absence check using 441 positive place invariants in 92 ms returned sat
[2022-06-12 23:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:30:11] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2022-06-12 23:30:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:30:11] [INFO ] [Nat]Absence check using 441 positive place invariants in 81 ms returned sat
[2022-06-12 23:30:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:30:11] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2022-06-12 23:30:11] [INFO ] [Nat]Added 243 Read/Feed constraints in 114 ms returned sat
[2022-06-12 23:30:12] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2022-06-12 23:30:12] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2022-06-12 23:30:12] [INFO ] Deduced a trap composed of 11 places in 12 ms of which 0 ms to minimize.
[2022-06-12 23:30:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 225 ms
[2022-06-12 23:30:12] [INFO ] Computed and/alt/rep : 920/3614/920 causal constraints (skipped 0 transitions) in 52 ms.
[2022-06-12 23:30:32] [INFO ] Added : 883 causal constraints over 178 iterations in 20177 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 81 ms.
[2022-06-12 23:30:32] [INFO ] [Real]Absence check using 441 positive place invariants in 71 ms returned sat
[2022-06-12 23:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:30:33] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2022-06-12 23:30:33] [INFO ] [Real]Added 243 Read/Feed constraints in 27 ms returned sat
[2022-06-12 23:30:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:30:33] [INFO ] [Nat]Absence check using 441 positive place invariants in 73 ms returned sat
[2022-06-12 23:30:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:30:33] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2022-06-12 23:30:33] [INFO ] [Nat]Added 243 Read/Feed constraints in 58 ms returned sat
[2022-06-12 23:30:33] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2022-06-12 23:30:33] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2022-06-12 23:30:33] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2022-06-12 23:30:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 257 ms
[2022-06-12 23:30:33] [INFO ] Computed and/alt/rep : 920/3614/920 causal constraints (skipped 0 transitions) in 44 ms.
[2022-06-12 23:30:57] [INFO ] Added : 850 causal constraints over 170 iterations in 23969 ms.(timeout) Result :unknown
[2022-06-12 23:30:58] [INFO ] [Real]Absence check using 441 positive place invariants in 92 ms returned sat
[2022-06-12 23:30:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:30:58] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2022-06-12 23:30:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:30:58] [INFO ] [Nat]Absence check using 441 positive place invariants in 89 ms returned sat
[2022-06-12 23:30:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:30:59] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2022-06-12 23:30:59] [INFO ] [Nat]Added 243 Read/Feed constraints in 48 ms returned sat
[2022-06-12 23:30:59] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2022-06-12 23:30:59] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2022-06-12 23:30:59] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2022-06-12 23:30:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 225 ms
[2022-06-12 23:30:59] [INFO ] Computed and/alt/rep : 920/3614/920 causal constraints (skipped 0 transitions) in 44 ms.
[2022-06-12 23:31:19] [INFO ] Added : 850 causal constraints over 170 iterations in 20351 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 63 ms.
Incomplete Parikh walk after 132300 steps, including 1000 resets, run finished after 914 ms. (steps per millisecond=144 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 131600 steps, including 1000 resets, run finished after 822 ms. (steps per millisecond=160 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 125100 steps, including 1000 resets, run finished after 591 ms. (steps per millisecond=211 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 91200 steps, including 737 resets, run finished after 577 ms. (steps per millisecond=158 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 68 out of 1091 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1091/1091 places, 921/921 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1090 transition count 920
Applied a total of 2 rules in 69 ms. Remains 1090 /1091 variables (removed 1) and now considering 920/921 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1091 places, 920/921 transitions.
[2022-06-12 23:31:22] [INFO ] Flatten gal took : 42 ms
[2022-06-12 23:31:22] [INFO ] Flatten gal took : 43 ms
[2022-06-12 23:31:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8152194200397828373.gal : 6 ms
[2022-06-12 23:31:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality478977177852801499.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/ReachabilityCardinality8152194200397828373.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality478977177852801499.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/ReachabilityCardinality8152194200397828373.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality478977177852801499.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality478977177852801499.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :2 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :15 after 219
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :219 after 4323
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :4323 after 486003
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :486003 after 2.76437e+10
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2.76437e+10 after 2.78625e+10
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2.78625e+10 after 2.78688e+10
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.78688e+10 after 3.99075e+10
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :3.99075e+10 after 5.06229e+12
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :5.06229e+12 after 2.93941e+14
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :2.93941e+14 after 1.27605e+18
Detected timeout of ITS tools.
[2022-06-12 23:31:38] [INFO ] Flatten gal took : 40 ms
[2022-06-12 23:31:38] [INFO ] Applying decomposition
[2022-06-12 23:31:38] [INFO ] Flatten gal took : 39 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/graph14612658983536507772.txt, -o, /tmp/graph14612658983536507772.bin, -w, /tmp/graph14612658983536507772.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/graph14612658983536507772.bin, -l, -1, -v, -w, /tmp/graph14612658983536507772.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:31:38] [INFO ] Decomposing Gal with order
[2022-06-12 23:31:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:31:38] [INFO ] Removed a total of 535 redundant transitions.
[2022-06-12 23:31:38] [INFO ] Flatten gal took : 112 ms
[2022-06-12 23:31:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 24 ms.
[2022-06-12 23:31:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11951565568907981414.gal : 12 ms
[2022-06-12 23:31:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1688332834036769933.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/ReachabilityCardinality11951565568907981414.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1688332834036769933.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/ReachabilityCardinality11951565568907981414.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1688332834036769933.prop --nowitness
Loading property file /tmp/ReachabilityCardinality1688332834036769933.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 14
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :14 after 254
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :254 after 7.656e+06
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :7.656e+06 after 1.93456e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8133291685130219245
[2022-06-12 23:31:53] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8133291685130219245
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/ltsmin8133291685130219245]
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/ltsmin8133291685130219245] 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/ltsmin8133291685130219245] 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 2 resets, run finished after 6856 ms. (steps per millisecond=145 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4599 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4559 ms. (steps per millisecond=219 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4463 ms. (steps per millisecond=224 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 860057 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen :{}
Interrupted probabilistic random walk after 1964226 steps, run timeout after 30001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 1964226 steps, saw 1222991 distinct states, run finished after 30001 ms. (steps per millisecond=65 ) properties seen :{}
Running SMT prover for 4 properties.
// Phase 1: matrix 920 rows 1090 cols
[2022-06-12 23:32:49] [INFO ] Computed 441 place invariants in 9 ms
[2022-06-12 23:32:50] [INFO ] [Real]Absence check using 441 positive place invariants in 85 ms returned sat
[2022-06-12 23:32:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:32:50] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2022-06-12 23:32:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:32:50] [INFO ] [Nat]Absence check using 441 positive place invariants in 80 ms returned sat
[2022-06-12 23:32:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:32:51] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2022-06-12 23:32:51] [INFO ] State equation strengthened by 243 read => feed constraints.
[2022-06-12 23:32:51] [INFO ] [Nat]Added 243 Read/Feed constraints in 72 ms returned sat
[2022-06-12 23:32:51] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2022-06-12 23:32:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-06-12 23:32:51] [INFO ] Computed and/alt/rep : 919/3616/919 causal constraints (skipped 0 transitions) in 42 ms.
[2022-06-12 23:33:14] [INFO ] Added : 865 causal constraints over 173 iterations in 23434 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-06-12 23:33:15] [INFO ] [Real]Absence check using 441 positive place invariants in 76 ms returned sat
[2022-06-12 23:33:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:15] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2022-06-12 23:33:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:33:15] [INFO ] [Nat]Absence check using 441 positive place invariants in 80 ms returned sat
[2022-06-12 23:33:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:15] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2022-06-12 23:33:16] [INFO ] [Nat]Added 243 Read/Feed constraints in 55 ms returned sat
[2022-06-12 23:33:16] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2022-06-12 23:33:16] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2022-06-12 23:33:16] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2022-06-12 23:33:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 258 ms
[2022-06-12 23:33:16] [INFO ] Computed and/alt/rep : 919/3616/919 causal constraints (skipped 0 transitions) in 51 ms.
[2022-06-12 23:33:35] [INFO ] Added : 864 causal constraints over 175 iterations in 18849 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 104 ms.
[2022-06-12 23:33:35] [INFO ] [Real]Absence check using 441 positive place invariants in 73 ms returned sat
[2022-06-12 23:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:35] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2022-06-12 23:33:35] [INFO ] [Real]Added 243 Read/Feed constraints in 31 ms returned sat
[2022-06-12 23:33:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:33:36] [INFO ] [Nat]Absence check using 441 positive place invariants in 77 ms returned sat
[2022-06-12 23:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:36] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2022-06-12 23:33:36] [INFO ] [Nat]Added 243 Read/Feed constraints in 51 ms returned sat
[2022-06-12 23:33:36] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 5 ms to minimize.
[2022-06-12 23:33:36] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2022-06-12 23:33:36] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2022-06-12 23:33:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 247 ms
[2022-06-12 23:33:36] [INFO ] Computed and/alt/rep : 919/3616/919 causal constraints (skipped 0 transitions) in 49 ms.
[2022-06-12 23:33:57] [INFO ] Added : 886 causal constraints over 178 iterations in 20522 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 96 ms.
[2022-06-12 23:33:57] [INFO ] [Real]Absence check using 441 positive place invariants in 82 ms returned sat
[2022-06-12 23:33:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:57] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2022-06-12 23:33:58] [INFO ] [Real]Added 243 Read/Feed constraints in 28 ms returned sat
[2022-06-12 23:33:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:33:58] [INFO ] [Nat]Absence check using 441 positive place invariants in 85 ms returned sat
[2022-06-12 23:33:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:58] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2022-06-12 23:33:58] [INFO ] [Nat]Added 243 Read/Feed constraints in 55 ms returned sat
[2022-06-12 23:33:58] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2022-06-12 23:33:58] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2022-06-12 23:33:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2022-06-12 23:33:58] [INFO ] Computed and/alt/rep : 919/3616/919 causal constraints (skipped 0 transitions) in 45 ms.
[2022-06-12 23:34:19] [INFO ] Added : 854 causal constraints over 171 iterations in 20727 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 134 ms.
Incomplete Parikh walk after 123100 steps, including 1000 resets, run finished after 796 ms. (steps per millisecond=154 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 159500 steps, including 355 resets, run finished after 1048 ms. (steps per millisecond=152 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 135000 steps, including 1000 resets, run finished after 805 ms. (steps per millisecond=167 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 185200 steps, including 1000 resets, run finished after 1047 ms. (steps per millisecond=176 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 58 out of 1090 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1090/1090 places, 920/920 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1090 transition count 915
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1085 transition count 915
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 1079 transition count 909
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 1079 transition count 909
Applied a total of 25 rules in 71 ms. Remains 1079 /1090 variables (removed 11) and now considering 909/920 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 1079/1090 places, 909/920 transitions.
[2022-06-12 23:34:23] [INFO ] Flatten gal took : 36 ms
[2022-06-12 23:34:23] [INFO ] Flatten gal took : 36 ms
[2022-06-12 23:34:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4579091107330047148.gal : 4 ms
[2022-06-12 23:34:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality439199777831543596.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/ReachabilityCardinality4579091107330047148.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality439199777831543596.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/ReachabilityCardinality4579091107330047148.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality439199777831543596.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality439199777831543596.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :2 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :15 after 75
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :75 after 2883
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2883 after 54003
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :54003 after 3.08124e+09
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :3.08124e+09 after 3.09595e+09
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3.09595e+09 after 3.10575e+09
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :3.10575e+09 after 1.51401e+10
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.51401e+10 after 5.03752e+12
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :5.03752e+12 after 2.07038e+14
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :2.07038e+14 after 1.0171e+18
Detected timeout of ITS tools.
[2022-06-12 23:34:43] [INFO ] Flatten gal took : 35 ms
[2022-06-12 23:34:43] [INFO ] Applying decomposition
[2022-06-12 23:34:43] [INFO ] Flatten gal took : 37 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/graph8106042210944757126.txt, -o, /tmp/graph8106042210944757126.bin, -w, /tmp/graph8106042210944757126.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/graph8106042210944757126.bin, -l, -1, -v, -w, /tmp/graph8106042210944757126.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:34:43] [INFO ] Decomposing Gal with order
[2022-06-12 23:34:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:34:43] [INFO ] Removed a total of 544 redundant transitions.
[2022-06-12 23:34:43] [INFO ] Flatten gal took : 54 ms
[2022-06-12 23:34:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 226 labels/synchronizations in 26 ms.
[2022-06-12 23:34:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6157850734577343910.gal : 11 ms
[2022-06-12 23:34:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17775747428991648843.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/ReachabilityCardinality6157850734577343910.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17775747428991648843.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/ReachabilityCardinality6157850734577343910.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17775747428991648843.prop --nowitness
Loading property file /tmp/ReachabilityCardinality17775747428991648843.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 26
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :26 after 23681
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :2.04102e+07 after 2.0439e+07
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :2.0439e+07 after 2.24781e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5262888592399641837
[2022-06-12 23:35:04] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5262888592399641837
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/ltsmin5262888592399641837]
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/ltsmin5262888592399641837] killed by timeout after 2 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/ltsmin5262888592399641837] killed by timeout after 2 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 2 resets, run finished after 6411 ms. (steps per millisecond=155 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4440 ms. (steps per millisecond=225 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4425 ms. (steps per millisecond=225 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 963968 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=192 ) properties seen :{}
Interrupted probabilistic random walk after 2094276 steps, run timeout after 30001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 2094276 steps, saw 1284712 distinct states, run finished after 30001 ms. (steps per millisecond=69 ) properties seen :{}
Running SMT prover for 3 properties.
// Phase 1: matrix 909 rows 1079 cols
[2022-06-12 23:35:56] [INFO ] Computed 441 place invariants in 3 ms
[2022-06-12 23:35:56] [INFO ] [Real]Absence check using 441 positive place invariants in 81 ms returned sat
[2022-06-12 23:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:35:56] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2022-06-12 23:35:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:35:57] [INFO ] [Nat]Absence check using 441 positive place invariants in 79 ms returned sat
[2022-06-12 23:35:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:35:57] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2022-06-12 23:35:57] [INFO ] State equation strengthened by 244 read => feed constraints.
[2022-06-12 23:35:57] [INFO ] [Nat]Added 244 Read/Feed constraints in 60 ms returned sat
[2022-06-12 23:35:57] [INFO ] Computed and/alt/rep : 908/3632/908 causal constraints (skipped 0 transitions) in 43 ms.
[2022-06-12 23:36:17] [INFO ] Added : 895 causal constraints over 179 iterations in 19693 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 102 ms.
[2022-06-12 23:36:17] [INFO ] [Real]Absence check using 441 positive place invariants in 72 ms returned sat
[2022-06-12 23:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:36:17] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2022-06-12 23:36:17] [INFO ] [Real]Added 244 Read/Feed constraints in 26 ms returned sat
[2022-06-12 23:36:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:36:18] [INFO ] [Nat]Absence check using 441 positive place invariants in 71 ms returned sat
[2022-06-12 23:36:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:36:18] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2022-06-12 23:36:18] [INFO ] [Nat]Added 244 Read/Feed constraints in 56 ms returned sat
[2022-06-12 23:36:18] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 1 ms to minimize.
[2022-06-12 23:36:18] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2022-06-12 23:36:18] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 3 ms to minimize.
[2022-06-12 23:36:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 211 ms
[2022-06-12 23:36:18] [INFO ] Computed and/alt/rep : 908/3632/908 causal constraints (skipped 0 transitions) in 43 ms.
[2022-06-12 23:36:38] [INFO ] Added : 857 causal constraints over 172 iterations in 20285 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 86 ms.
[2022-06-12 23:36:39] [INFO ] [Real]Absence check using 441 positive place invariants in 83 ms returned sat
[2022-06-12 23:36:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:36:39] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2022-06-12 23:36:39] [INFO ] [Real]Added 244 Read/Feed constraints in 29 ms returned sat
[2022-06-12 23:36:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:36:39] [INFO ] [Nat]Absence check using 441 positive place invariants in 86 ms returned sat
[2022-06-12 23:36:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:36:40] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2022-06-12 23:36:40] [INFO ] [Nat]Added 244 Read/Feed constraints in 58 ms returned sat
[2022-06-12 23:36:40] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2022-06-12 23:36:40] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2022-06-12 23:36:40] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2022-06-12 23:36:40] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2022-06-12 23:36:40] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2022-06-12 23:36:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 404 ms
[2022-06-12 23:36:40] [INFO ] Computed and/alt/rep : 908/3632/908 causal constraints (skipped 0 transitions) in 43 ms.
[2022-06-12 23:37:01] [INFO ] Added : 847 causal constraints over 174 iterations in 20540 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 147 ms.
Incomplete Parikh walk after 146700 steps, including 1000 resets, run finished after 868 ms. (steps per millisecond=169 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 102600 steps, including 997 resets, run finished after 640 ms. (steps per millisecond=160 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 175700 steps, including 1000 resets, run finished after 1014 ms. (steps per millisecond=173 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 58 out of 1079 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1079/1079 places, 909/909 transitions.
Applied a total of 0 rules in 25 ms. Remains 1079 /1079 variables (removed 0) and now considering 909/909 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1079/1079 places, 909/909 transitions.
Starting structural reductions, iteration 0 : 1079/1079 places, 909/909 transitions.
Applied a total of 0 rules in 22 ms. Remains 1079 /1079 variables (removed 0) and now considering 909/909 (removed 0) transitions.
// Phase 1: matrix 909 rows 1079 cols
[2022-06-12 23:37:04] [INFO ] Computed 441 place invariants in 6 ms
[2022-06-12 23:37:04] [INFO ] Implicit Places using invariants in 520 ms returned [1070]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 527 ms to find 1 implicit places.
[2022-06-12 23:37:04] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 909 rows 1078 cols
[2022-06-12 23:37:04] [INFO ] Computed 440 place invariants in 3 ms
[2022-06-12 23:37:05] [INFO ] Dead Transitions using invariants and state equation in 435 ms returned []
Starting structural reductions, iteration 1 : 1078/1079 places, 909/909 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1078 transition count 907
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1076 transition count 907
Applied a total of 4 rules in 33 ms. Remains 1076 /1078 variables (removed 2) and now considering 907/909 (removed 2) transitions.
// Phase 1: matrix 907 rows 1076 cols
[2022-06-12 23:37:05] [INFO ] Computed 440 place invariants in 6 ms
[2022-06-12 23:37:05] [INFO ] Implicit Places using invariants in 520 ms returned [1057, 1061]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 523 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 1074/1079 places, 907/909 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1072 transition count 905
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1072 transition count 905
Applied a total of 4 rules in 38 ms. Remains 1072 /1074 variables (removed 2) and now considering 905/907 (removed 2) transitions.
// Phase 1: matrix 905 rows 1072 cols
[2022-06-12 23:37:05] [INFO ] Computed 438 place invariants in 3 ms
[2022-06-12 23:37:06] [INFO ] Implicit Places using invariants in 463 ms returned []
// Phase 1: matrix 905 rows 1072 cols
[2022-06-12 23:37:06] [INFO ] Computed 438 place invariants in 5 ms
[2022-06-12 23:37:06] [INFO ] State equation strengthened by 242 read => feed constraints.
[2022-06-12 23:37:09] [INFO ] Implicit Places using invariants and state equation in 3406 ms returned []
Implicit Place search using SMT with State Equation took 3870 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 1072/1079 places, 905/909 transitions.
[2022-06-12 23:37:09] [INFO ] Flatten gal took : 33 ms
[2022-06-12 23:37:09] [INFO ] Flatten gal took : 33 ms
[2022-06-12 23:37:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4417390425478329551.gal : 4 ms
[2022-06-12 23:37:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5852672534567684028.prop : 22 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/ReachabilityCardinality4417390425478329551.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5852672534567684028.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/ReachabilityCardinality4417390425478329551.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5852672534567684028.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5852672534567684028.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :2 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :15 after 75
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :75 after 2883
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2883 after 54003
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :54003 after 3.08707e+09
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :3.08707e+09 after 3.09596e+09
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3.09596e+09 after 3.10575e+09
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :3.10575e+09 after 1.51409e+10
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.51409e+10 after 5.04223e+12
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :5.04223e+12 after 2.07038e+14
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :2.07038e+14 after 1.0171e+18
Detected timeout of ITS tools.
[2022-06-12 23:37:34] [INFO ] Flatten gal took : 34 ms
[2022-06-12 23:37:34] [INFO ] Applying decomposition
[2022-06-12 23:37:34] [INFO ] Flatten gal took : 34 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/graph9418637235769126861.txt, -o, /tmp/graph9418637235769126861.bin, -w, /tmp/graph9418637235769126861.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/graph9418637235769126861.bin, -l, -1, -v, -w, /tmp/graph9418637235769126861.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:37:34] [INFO ] Decomposing Gal with order
[2022-06-12 23:37:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:37:35] [INFO ] Removed a total of 543 redundant transitions.
[2022-06-12 23:37:35] [INFO ] Flatten gal took : 54 ms
[2022-06-12 23:37:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 230 labels/synchronizations in 26 ms.
[2022-06-12 23:37:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11364196412925811575.gal : 316 ms
[2022-06-12 23:37:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12890969909050831125.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/ReachabilityCardinality11364196412925811575.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12890969909050831125.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/ReachabilityCardinality11364196412925811575.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12890969909050831125.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12890969909050831125.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :11 after 1.14867e+06
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1.14867e+06 after 2.29709e+06
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :2.29709e+06 after 8.65946e+06
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :8.65946e+06 after 1.5016e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4134950979902311590
[2022-06-12 23:38:00] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4134950979902311590
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/ltsmin4134950979902311590]
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/ltsmin4134950979902311590] killed by timeout after 2 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/ltsmin4134950979902311590] killed by timeout after 2 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 2 resets, run finished after 6398 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4382 ms. (steps per millisecond=228 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4326 ms. (steps per millisecond=231 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 986472 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen :{}
Interrupted probabilistic random walk after 2114904 steps, run timeout after 30001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 2114904 steps, saw 1358090 distinct states, run finished after 30001 ms. (steps per millisecond=70 ) properties seen :{}
Running SMT prover for 3 properties.
// Phase 1: matrix 905 rows 1072 cols
[2022-06-12 23:38:52] [INFO ] Computed 438 place invariants in 7 ms
[2022-06-12 23:38:52] [INFO ] [Real]Absence check using 438 positive place invariants in 81 ms returned sat
[2022-06-12 23:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:38:53] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2022-06-12 23:38:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:38:53] [INFO ] [Nat]Absence check using 438 positive place invariants in 91 ms returned sat
[2022-06-12 23:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:38:53] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2022-06-12 23:38:53] [INFO ] State equation strengthened by 242 read => feed constraints.
[2022-06-12 23:38:53] [INFO ] [Nat]Added 242 Read/Feed constraints in 60 ms returned sat
[2022-06-12 23:38:53] [INFO ] Computed and/alt/rep : 904/3612/904 causal constraints (skipped 0 transitions) in 48 ms.
[2022-06-12 23:39:19] [INFO ] Added : 894 causal constraints over 179 iterations in 25269 ms.(timeout) Result :unknown
[2022-06-12 23:39:19] [INFO ] [Real]Absence check using 438 positive place invariants in 73 ms returned sat
[2022-06-12 23:39:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:39:19] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2022-06-12 23:39:19] [INFO ] [Real]Added 242 Read/Feed constraints in 28 ms returned sat
[2022-06-12 23:39:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:39:19] [INFO ] [Nat]Absence check using 438 positive place invariants in 74 ms returned sat
[2022-06-12 23:39:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:39:20] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2022-06-12 23:39:20] [INFO ] [Nat]Added 242 Read/Feed constraints in 52 ms returned sat
[2022-06-12 23:39:20] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2022-06-12 23:39:20] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2022-06-12 23:39:20] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2022-06-12 23:39:20] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2022-06-12 23:39:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 302 ms
[2022-06-12 23:39:20] [INFO ] Computed and/alt/rep : 904/3612/904 causal constraints (skipped 0 transitions) in 53 ms.
[2022-06-12 23:39:41] [INFO ] Added : 867 causal constraints over 174 iterations in 20411 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 102 ms.
[2022-06-12 23:39:41] [INFO ] [Real]Absence check using 438 positive place invariants in 81 ms returned sat
[2022-06-12 23:39:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:39:41] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2022-06-12 23:39:41] [INFO ] [Real]Added 242 Read/Feed constraints in 28 ms returned sat
[2022-06-12 23:39:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:39:42] [INFO ] [Nat]Absence check using 438 positive place invariants in 82 ms returned sat
[2022-06-12 23:39:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:39:42] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2022-06-12 23:39:42] [INFO ] [Nat]Added 242 Read/Feed constraints in 47 ms returned sat
[2022-06-12 23:39:42] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2022-06-12 23:39:42] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2022-06-12 23:39:42] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2022-06-12 23:39:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 255 ms
[2022-06-12 23:39:42] [INFO ] Computed and/alt/rep : 904/3612/904 causal constraints (skipped 0 transitions) in 43 ms.
[2022-06-12 23:40:06] [INFO ] Added : 868 causal constraints over 174 iterations in 23958 ms.(timeout) Result :unknown
Incomplete Parikh walk after 145200 steps, including 1001 resets, run finished after 914 ms. (steps per millisecond=158 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 124900 steps, including 1000 resets, run finished after 731 ms. (steps per millisecond=170 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 124600 steps, including 1000 resets, run finished after 734 ms. (steps per millisecond=169 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 58 out of 1072 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1072/1072 places, 905/905 transitions.
Applied a total of 0 rules in 22 ms. Remains 1072 /1072 variables (removed 0) and now considering 905/905 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1072/1072 places, 905/905 transitions.
Starting structural reductions, iteration 0 : 1072/1072 places, 905/905 transitions.
Applied a total of 0 rules in 29 ms. Remains 1072 /1072 variables (removed 0) and now considering 905/905 (removed 0) transitions.
// Phase 1: matrix 905 rows 1072 cols
[2022-06-12 23:40:09] [INFO ] Computed 438 place invariants in 6 ms
[2022-06-12 23:40:09] [INFO ] Implicit Places using invariants in 481 ms returned []
// Phase 1: matrix 905 rows 1072 cols
[2022-06-12 23:40:09] [INFO ] Computed 438 place invariants in 5 ms
[2022-06-12 23:40:10] [INFO ] State equation strengthened by 242 read => feed constraints.
[2022-06-12 23:40:13] [INFO ] Implicit Places using invariants and state equation in 3557 ms returned []
Implicit Place search using SMT with State Equation took 4045 ms to find 0 implicit places.
[2022-06-12 23:40:13] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 905 rows 1072 cols
[2022-06-12 23:40:13] [INFO ] Computed 438 place invariants in 7 ms
[2022-06-12 23:40:13] [INFO ] Dead Transitions using invariants and state equation in 425 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1072/1072 places, 905/905 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 905 rows 1072 cols
[2022-06-12 23:40:14] [INFO ] Computed 438 place invariants in 6 ms
[2022-06-12 23:40:14] [INFO ] [Real]Absence check using 438 positive place invariants in 83 ms returned sat
[2022-06-12 23:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:40:14] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2022-06-12 23:40:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:40:15] [INFO ] [Nat]Absence check using 438 positive place invariants in 80 ms returned sat
[2022-06-12 23:40:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:40:15] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2022-06-12 23:40:15] [INFO ] State equation strengthened by 242 read => feed constraints.
[2022-06-12 23:40:15] [INFO ] [Nat]Added 242 Read/Feed constraints in 50 ms returned sat
[2022-06-12 23:40:15] [INFO ] Computed and/alt/rep : 904/3612/904 causal constraints (skipped 0 transitions) in 39 ms.
[2022-06-12 23:40:34] [INFO ] Added : 894 causal constraints over 179 iterations in 19364 ms. Result :unknown
[2022-06-12 23:40:35] [INFO ] [Real]Absence check using 438 positive place invariants in 64 ms returned sat
[2022-06-12 23:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:40:35] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2022-06-12 23:40:35] [INFO ] [Real]Added 242 Read/Feed constraints in 25 ms returned sat
[2022-06-12 23:40:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:40:35] [INFO ] [Nat]Absence check using 438 positive place invariants in 71 ms returned sat
[2022-06-12 23:40:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:40:35] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2022-06-12 23:40:35] [INFO ] [Nat]Added 242 Read/Feed constraints in 50 ms returned sat
[2022-06-12 23:40:35] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2022-06-12 23:40:36] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2022-06-12 23:40:36] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2022-06-12 23:40:36] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2022-06-12 23:40:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 284 ms
[2022-06-12 23:40:36] [INFO ] Computed and/alt/rep : 904/3612/904 causal constraints (skipped 0 transitions) in 42 ms.
[2022-06-12 23:40:55] [INFO ] Added : 867 causal constraints over 174 iterations in 19225 ms. Result :unknown
[2022-06-12 23:40:55] [INFO ] [Real]Absence check using 438 positive place invariants in 81 ms returned sat
[2022-06-12 23:40:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:40:55] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2022-06-12 23:40:56] [INFO ] [Real]Added 242 Read/Feed constraints in 29 ms returned sat
[2022-06-12 23:40:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:40:56] [INFO ] [Nat]Absence check using 438 positive place invariants in 82 ms returned sat
[2022-06-12 23:40:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:40:56] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2022-06-12 23:40:56] [INFO ] [Nat]Added 242 Read/Feed constraints in 50 ms returned sat
[2022-06-12 23:40:56] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2022-06-12 23:40:56] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2022-06-12 23:40:56] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2022-06-12 23:40:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 254 ms
[2022-06-12 23:40:56] [INFO ] Computed and/alt/rep : 904/3612/904 causal constraints (skipped 0 transitions) in 44 ms.
[2022-06-12 23:41:16] [INFO ] Added : 868 causal constraints over 174 iterations in 19164 ms. Result :unknown
[2022-06-12 23:41:16] [INFO ] Flatten gal took : 33 ms
[2022-06-12 23:41:16] [INFO ] Flatten gal took : 32 ms
[2022-06-12 23:41:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10934459268192745361.gal : 3 ms
[2022-06-12 23:41:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1492248230848355483.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/ReachabilityCardinality10934459268192745361.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1492248230848355483.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/ReachabilityCardinality10934459268192745361.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1492248230848355483.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1492248230848355483.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :2 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :15 after 75
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :75 after 2883
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2883 after 54003
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :54003 after 3.08707e+09
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :3.08707e+09 after 3.09596e+09
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3.09596e+09 after 3.10575e+09
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :3.10575e+09 after 1.51409e+10
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.51409e+10 after 5.04223e+12
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :5.04223e+12 after 2.07038e+14
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :2.07038e+14 after 1.0171e+18
Detected timeout of ITS tools.
[2022-06-12 23:41:46] [INFO ] Flatten gal took : 32 ms
[2022-06-12 23:41:46] [INFO ] Applying decomposition
[2022-06-12 23:41:46] [INFO ] Flatten gal took : 33 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/graph11331935305708514619.txt, -o, /tmp/graph11331935305708514619.bin, -w, /tmp/graph11331935305708514619.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/graph11331935305708514619.bin, -l, -1, -v, -w, /tmp/graph11331935305708514619.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:41:46] [INFO ] Decomposing Gal with order
[2022-06-12 23:41:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:41:46] [INFO ] Removed a total of 543 redundant transitions.
[2022-06-12 23:41:46] [INFO ] Flatten gal took : 51 ms
[2022-06-12 23:41:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 26 ms.
[2022-06-12 23:41:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6301154183319161968.gal : 10 ms
[2022-06-12 23:41:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9840568047572597657.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/ReachabilityCardinality6301154183319161968.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9840568047572597657.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/ReachabilityCardinality6301154183319161968.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9840568047572597657.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9840568047572597657.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1793
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1793 after 3329
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :3329 after 11777
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :11777 after 8.29696e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8851457357117508920
[2022-06-12 23:42:16] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8851457357117508920
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/ltsmin8851457357117508920]
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/ltsmin8851457357117508920] killed by timeout after 3 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/ltsmin8851457357117508920] killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Partial Free-agglomeration rule applied 236 times.
Drop transitions removed 236 transitions
Iterating global reduction 0 with 236 rules applied. Total rules applied 236 place count 1072 transition count 905
Applied a total of 236 rules in 46 ms. Remains 1072 /1072 variables (removed 0) and now considering 905/905 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 905 rows 1072 cols
[2022-06-12 23:42:19] [INFO ] Computed 438 place invariants in 2 ms
[2022-06-12 23:42:19] [INFO ] [Real]Absence check using 438 positive place invariants in 78 ms returned sat
[2022-06-12 23:42:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:20] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2022-06-12 23:42:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:42:20] [INFO ] [Nat]Absence check using 438 positive place invariants in 77 ms returned sat
[2022-06-12 23:42:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:20] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2022-06-12 23:42:20] [INFO ] State equation strengthened by 215 read => feed constraints.
[2022-06-12 23:42:20] [INFO ] [Nat]Added 215 Read/Feed constraints in 30 ms returned sat
[2022-06-12 23:42:20] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2022-06-12 23:42:20] [INFO ] Deduced a trap composed of 7 places in 10 ms of which 1 ms to minimize.
[2022-06-12 23:42:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2022-06-12 23:42:21] [INFO ] Computed and/alt/rep : 904/4058/904 causal constraints (skipped 0 transitions) in 48 ms.
[2022-06-12 23:42:41] [INFO ] Added : 812 causal constraints over 163 iterations in 20169 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-06-12 23:42:41] [INFO ] [Real]Absence check using 438 positive place invariants in 69 ms returned sat
[2022-06-12 23:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:41] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2022-06-12 23:42:41] [INFO ] [Real]Added 215 Read/Feed constraints in 22 ms returned sat
[2022-06-12 23:42:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:42:42] [INFO ] [Nat]Absence check using 438 positive place invariants in 70 ms returned sat
[2022-06-12 23:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:42] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2022-06-12 23:42:42] [INFO ] [Nat]Added 215 Read/Feed constraints in 27 ms returned sat
[2022-06-12 23:42:42] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2022-06-12 23:42:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2022-06-12 23:42:42] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2022-06-12 23:42:42] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2022-06-12 23:42:42] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2022-06-12 23:42:42] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2022-06-12 23:42:42] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2022-06-12 23:42:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 522 ms
[2022-06-12 23:42:42] [INFO ] Computed and/alt/rep : 904/4058/904 causal constraints (skipped 0 transitions) in 48 ms.
[2022-06-12 23:43:03] [INFO ] Added : 840 causal constraints over 168 iterations in 20168 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 86 ms.
[2022-06-12 23:43:03] [INFO ] [Real]Absence check using 438 positive place invariants in 85 ms returned sat
[2022-06-12 23:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:43:03] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2022-06-12 23:43:03] [INFO ] [Real]Added 215 Read/Feed constraints in 26 ms returned sat
[2022-06-12 23:43:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:43:04] [INFO ] [Nat]Absence check using 438 positive place invariants in 86 ms returned sat
[2022-06-12 23:43:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:43:04] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2022-06-12 23:43:04] [INFO ] [Nat]Added 215 Read/Feed constraints in 30 ms returned sat
[2022-06-12 23:43:04] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2022-06-12 23:43:04] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2022-06-12 23:43:04] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2022-06-12 23:43:04] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2022-06-12 23:43:04] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2022-06-12 23:43:04] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2022-06-12 23:43:04] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2022-06-12 23:43:05] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2022-06-12 23:43:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 560 ms
[2022-06-12 23:43:05] [INFO ] Computed and/alt/rep : 904/4058/904 causal constraints (skipped 0 transitions) in 43 ms.
[2022-06-12 23:43:25] [INFO ] Added : 835 causal constraints over 167 iterations in 20328 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 82 ms.
[2022-06-12 23:43:25] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16848085107629749183
[2022-06-12 23:43:25] [INFO ] Computing symmetric may disable matrix : 905 transitions.
[2022-06-12 23:43:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 23:43:25] [INFO ] Computing symmetric may enable matrix : 905 transitions.
[2022-06-12 23:43:25] [INFO ] Applying decomposition
[2022-06-12 23:43:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 23:43:25] [INFO ] Flatten gal took : 42 ms
[2022-06-12 23:43:25] [INFO ] Flatten gal took : 47 ms
[2022-06-12 23:43:25] [INFO ] Input system was already deterministic with 905 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/graph7498271045312304478.txt, -o, /tmp/graph7498271045312304478.bin, -w, /tmp/graph7498271045312304478.weights], workingDir=null]
[2022-06-12 23:43:25] [INFO ] Computing Do-Not-Accords matrix : 905 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7498271045312304478.bin, -l, -1, -v, -w, /tmp/graph7498271045312304478.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:43:25] [INFO ] Decomposing Gal with order
[2022-06-12 23:43:25] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 23:43:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:43:25] [INFO ] Built C files in 202ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16848085107629749183
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/ltsmin16848085107629749183]
[2022-06-12 23:43:25] [INFO ] Removed a total of 543 redundant transitions.
[2022-06-12 23:43:25] [INFO ] Flatten gal took : 48 ms
[2022-06-12 23:43:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 230 labels/synchronizations in 25 ms.
[2022-06-12 23:43:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12264267603002946532.gal : 11 ms
[2022-06-12 23:43:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11156671915738934827.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/ReachabilityCardinality12264267603002946532.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11156671915738934827.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/ReachabilityCardinality12264267603002946532.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11156671915738934827.prop --nowitness
[2022-06-12 23:43:26] [INFO ] Ran tautology test, simplified 0 / 3 in 459 ms.
Loading property file /tmp/ReachabilityCardinality11156671915738934827.prop.
[2022-06-12 23:43:26] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-09(UNSAT) depth K=0 took 20 ms
[2022-06-12 23:43:26] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-11(UNSAT) depth K=0 took 1 ms
[2022-06-12 23:43:26] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-12(UNSAT) depth K=0 took 3 ms
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
[2022-06-12 23:43:26] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-09(UNSAT) depth K=1 took 15 ms
[2022-06-12 23:43:26] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-11(UNSAT) depth K=1 took 1 ms
[2022-06-12 23:43:26] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-12(UNSAT) depth K=1 took 3 ms
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 24321
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :24321 after 84481
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :84481 after 494593
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :494593 after 3.04217e+08
[2022-06-12 23:43:26] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-09(UNSAT) depth K=2 took 160 ms
[2022-06-12 23:43:26] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-11(UNSAT) depth K=2 took 2 ms
[2022-06-12 23:43:26] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-12(UNSAT) depth K=2 took 3 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 905 rows 1072 cols
[2022-06-12 23:43:26] [INFO ] Computed 438 place invariants in 2 ms
inv : p0 + p1 + p7 + p893 + p894 + p915 + p920 + p921 = 1
inv : p0 + p1 + p7 + p1561 + p1564 + p1569 = 1
inv : p0 + p1 + p7 + p1345 + p1350 = 1
inv : p0 + p1 + p7 + p1352 + p1353 + p1363 + p1368 + p1369 = 1
inv : p0 + p1 + p7 + p1429 + p1431 + p1440 + p1443 + p1444 = 1
inv : p0 + p1 + p7 + p1352 + p1353 + p1377 + p1382 + p1383 = 1
inv : p0 + p1 + p7 + p292 + p294 + p297 + p298 = 1
inv : p0 + p1 + p7 + p1660 + p1661 + p1696 + p1701 = 1
inv : p0 + p1 + p7 + p754 + p757 + p758 = 1
inv : p0 + p1 + p7 + p893 + p894 + p901 + p906 + p907 = 1
inv : p0 + p1 + p7 + p2015 + p2019 = 1
inv : p0 + p1 + p7 + p1755 + p1760 + p1761 = 1
inv : p0 + p1 + p7 + p2507 + p2518 + p2523 + p2524 = 1
inv : p0 + p1 + p7 + p2507 + p2515 + p2517 = 1
inv : p0 + p1 + p7 + p1872 + p1877 = 1
inv : p0 + p1 + p7 + p145 + p150 + p151 = 1
inv : p0 + p1 + p7 + p1293 + p1298 + p1299 = 1
inv : p0 + p1 + p7 + p2411 + p2416 = 1
inv : p0 + p1 + p2672 + p2677 + p2678 = 1
inv : p0 + p1 + p7 + p453 + p456 + p457 = 1
inv : p0 + p1 + p2826 + p2831 + p2832 = 1
inv : p0 + p1 + p7 + p1524 + p1529 + p1530 = 1
inv : p0 + p1 + p7 + p2269 + p2274 = 1
inv : p0 + p1 + p7 + p1429 + p1431 + p1454 + p1457 + p1458 = 1
inv : p0 + p1 + p7 + p376 + p381 + p382 = 1
inv : p0 + p1 + p7 + p729 + p734 = 1
inv : p0 + p1 + p7 + p2092 + p2096 = 1
inv : p0 + p1 + p7 + p267 + p272 = 1
inv : p0 + p1 + p7 + p2334 + p2339 = 1
inv : p0 + p1 + p7 + p1209 + p1214 + p1215 = 1
inv : p0 + p1 + p7 + p344 + p349 = 1
inv : p0 + p1 + p7 + p1286 + p1289 + p1290 = 1
inv : p0 + p3076 + p3077 = 1
inv : p0 + p1 + p2669 + p2671 = 1
inv : p0 + p1 + p7 + p1979 + p1982 + p1983 = 1
inv : p0 + p1 + p2950 + p2955 = 1
inv : p0 + p1 + p7 + p2140 + p2145 + p2146 = 1
inv : p0 + p3101 + p3104 + p3105 + p3109 = 1
inv : p0 + p1 + p7 + p2133 + p2136 + p2137 = 1
inv : p0 + p1 + p7 + p1594 + p1599 + p1600 = 1
inv : p0 + p1 + p7 + p1429 + p1431 + p1447 + p1452 + p1453 = 1
inv : p0 + p1 + p7 + p824 + p827 + p828 = 1
inv : p0 + p1 + p7 + p2294 + p2297 + p2298 = 1
inv : p0 + p1 + p7 + p513 + p515 = 1
inv : p0 + p1 + p7 + p747 + p752 + p753 = 1
inv : p0 + p1 + p3005 + p3010 = 1
inv : p0 + p1 + p7 + p79 + p84 = 1
inv : p0 + p1 + p7 + p1069 + p1072 + p1073 = 1
inv : p0 + p3057 + p3062 = 1
inv : p0 + p1 + p2910 + p2915 + p2916 = 1
inv : p0 + p1 + p7 + p849 + p854 = 1
inv : p0 + p1 + p7 + p893 + p937 + p941 = 1
inv : p0 + p1 + p7 + p61 + p66 + p67 = 1
inv : p0 + p1 + p7 + p1234 + p1239 = 1
inv : p0 + p1 + p2975 + p2976 + p2980 + p2985 + p2986 = 1
inv : p0 + p1 + p7 + p1352 + p1353 + p1370 + p1373 + p1374 = 1
inv : p0 + p1 + p7 + p2169 + p2173 = 1
inv : p0 + p1 + p7 + p1517 + p1520 + p1521 = 1
inv : p0 + p1 + p7 + p1311 + p1316 = 1
inv : p0 + p1 + p2595 + p2597 + p2600 + p2601 = 1
inv : p0 + p1 + p7 + p516 + p518 + p521 + p522 = 1
inv : p0 + p1 + p2763 + p2766 + p2767 = 1
inv : p0 + p1 + p7 + p1123 + p1168 + p1172 = 1
inv : p0 + p1 + p2785 + p2789 = 1
inv : p0 + p1 + p2697 + p2702 = 1
inv : p0 + p1 + p7 + p138 + p141 + p142 = 1
inv : p0 + p1 + p2642 + p2647 = 1
inv : p0 + p1 + p7 + p1576 + p1581 = 1
inv : p0 + p1 + p7 + p2430 + p2431 + p2441 + p2444 + p2445 = 1
inv : p0 + p1 + p7 + p893 + p894 + p923 + p926 + p931 = 1
inv : p0 + p1 + p7 + p1839 + p1842 + p1843 = 1
inv : p0 + p1 + p2862 + p2866 = 1
inv : p0 + p1 + p7 + p2507 + p2525 + p2528 + p2529 = 1
inv : p0 + p1 + p7 + p1223 + p1228 + p1229 = 1
inv : p0 + p1 + p7 + p1899 + p1901 = 1
inv : p0 + p1 + p7 + p439 + p442 + p443 = 1
inv : p0 + p1 + p2686 + p2691 + p2692 = 1
inv : p0 + p1 + p7 + p1268 + p1273 = 1
inv : p0 + p1 + p7 + p2049 + p2077 + p2081 + p2086 = 1
inv : p0 + p1 + p7 + p2507 + p2543 + p2548 = 1
inv : p0 + p1 + p7 + p2287 + p2292 + p2293 = 1
inv : p0 + p1 + p7 + p1660 + p1661 + p1715 + p1723 = 1
inv : p0 + p1 + p7 + p1216 + p1219 + p1220 = 1
inv : p0 + p1 + p7 + p167 + p171 = 1
inv : p0 + p1 + p7 + p1352 + p1353 + p1399 + p1403 = 1
inv : p0 + p1 + p7 + p387 + p392 = 1
inv : p0 + p1 + p7 + p985 + p990 + p991 = 1
inv : p0 + p1 + p2994 + p2997 + p2998 = 1
inv : p0 + p1 + p7 + p2176 + p2180 + p2181 + p2185 = 1
inv : p0 + p1 + p7 + p1608 + p1613 + p1614 = 1
inv : p0 + p1 + p7 + p1641 + p1646 = 1
inv : p0 + p1 + p7 + p684 + p687 + p688 = 1
inv : p0 + p1 + p7 + p821 + p823 = 1
inv : p0 + p1 + p2679 + p2682 + p2683 = 1
inv : p0 + p1 + p7 + p446 + p451 + p452 = 1
inv : p0 + p1 + p2746 + p2748 = 1
inv : p0 + p1 + p7 + p1206 + p1208 = 1
inv : p0 + p1 + p7 + p1762 + p1765 + p1766 = 1
inv : p0 + p1 + p7 + p2507 + p2532 + p2537 + p2538 = 1
inv : p0 + p1 + p7 + p1601 + p1602 + p1604 + p1605 = 1
inv : p0 + p1 + p2609 + p2612 + p2613 = 1
inv : p0 + p1 + p7 + p1832 + p1837 + p1838 = 1
inv : p0 + p1 + p7 + p2202 + p2203 + p2224 + p2229 + p2230 = 1
inv : p0 + p1 + p7 + p2158 + p2163 = 1
inv : p0 + p1 + p7 + p1608 + p1611 + p1612 = 1
inv : p0 + p1 + p7 + p1660 + p1661 + p1685 + p1690 + p1691 = 1
inv : p0 + p1 + p2903 + p2906 + p2907 = 1
inv : p0 + p1 + p7 + p670 + p675 + p676 = 1
inv : p0 + p1 + p7 + p860 + p864 = 1
inv : p0 + p1 + p7 + p1825 + p1827 + p1828 + p1829 = 1
inv : p0 + p1 + p7 + p551 + p552 + p556 = 1
inv : p0 + p1 + p7 + p1916 + p1919 + p1920 = 1
inv : p0 + p1 + p7 + p1014 + p1018 = 1
inv : p0 + p1 + p7 + p1745 + p1747 = 1
inv : p0 + p1 + p2917 + p2920 + p2921 = 1
inv : p0 + p1 + p7 + p1069 + p1074 + p1075 = 1
inv : p0 + p1 + p7 + p190 + p195 = 1
inv : p0 + p1 + p7 + p2358 + p2378 + p2381 + p2382 = 1
inv : p0 + p1 + p2602 + p2607 + p2608 = 1
inv : p0 + p1 + p7 + p1123 + p1139 + p1141 + p1142 + p1143 = 1
inv : p0 + p1 + p7 + p2202 + p2203 + p2210 + p2215 + p2216 = 1
inv : p0 + p1 + p7 + p684 + p689 + p690 = 1
inv : p0 + p1 + p7 + p1902 + p1905 + p1906 = 1
inv : p0 + p1 + p7 + p362 + p363 + p365 + p366 = 1
inv : p0 + p1 + p7 + p713 + p717 + p722 = 1
inv : p0 + p1 + p7 + p2430 + p2431 + p2455 + p2458 + p2459 = 1
inv : p0 + p1 + p7 + p2049 + p2056 + p2061 + p2062 = 1
inv : p0 + p1 + p7 + p233 + p238 = 1
inv : p0 + p1 + p7 + p222 + p223 + p227 + p228 = 1
inv : p0 + p1 + p7 + p831 + p836 + p837 = 1
inv : p0 + p1 + p7 + p1653 + p1658 = 1
inv : p0 + p1 + p7 + p1055 + p1058 + p1059 = 1
inv : p0 + p1 + p7 + p607 + p610 + p611 = 1
inv : p0 + p1 + p7 + p1283 + p1285 = 1
inv : p0 + p1 + p7 + p2049 + p2063 + p2066 + p2067 = 1
inv : p0 + p1 + p7 + p1514 + p1516 = 1
inv : p0 + p1 + p7 + p2049 + p2070 + p2075 + p2076 = 1
inv : p0 + p1 + p7 + p1542 + p1547 = 1
inv : p0 + p1 + p7 + p2130 + p2132 = 1
inv : p0 + p1 + p7 + p68 + p71 + p72 = 1
inv : p0 + p1 + p7 + p475 + p479 = 1
inv : p0 + p1 + p7 + p992 + p997 + p998 = 1
inv : p0 + p1 + p7 + p2049 + p2053 + p2055 = 1
inv : p0 + p1 + p7 + p772 + p777 = 1
inv : p0 + p1 + p7 + p985 + p988 + p989 = 1
inv : p0 + p1 + p7 + p2507 + p2557 + p2558 = 1
inv : p0 + p1 + p7 + p2430 + p2431 + p2448 + p2450 + p2453 + p2454 = 1
inv : p0 + p1 + p7 + p299 + p304 + p305 = 1
inv : p0 + p1 + p7 + p754 + p759 + p760 = 1
inv : p0 + p1 + p7 + p1123 + p1128 + p1129 + p1130 + p1131 = 1
inv : p0 + p1 + p7 + p1822 + p1824 = 1
inv : p0 + p1 + p7 + p54 + p59 + p60 = 1
inv : p0 + p1 + p7 + p1861 + p1865 = 1
inv : p0 + p1 + p7 + p281 + p285 + p290 + p291 = 1
inv : p0 + p1 + p7 + p51 + p53 = 1
inv : p0 + p1 + p7 + p893 + p894 + p908 + p911 + p912 = 1
inv : p0 + p1 + p3027 + p3032 = 1
inv : p0 + p1 + p7 + p1091 + p1095 = 1
inv : p0 + p1 + p2823 + p2825 = 1
inv : p0 + p1 + p7 + p421 + p426 = 1
inv : p0 + p1 + p7 + p2202 + p2203 + p2217 + p2220 + p2221 = 1
inv : p0 + p1 + p7 + p1524 + p1527 + p1528 = 1
inv : p0 + p1 + p7 + p1660 + p1661 + p1678 + p1679 + p1681 + p1682 = 1
inv : p0 + p1 + p7 + p2420 + p2428 = 1
inv : p0 + p1 + p7 + p2507 + p2577 + p2582 = 1
inv : p0 + p1 + p7 + p838 + p841 + p842 = 1
inv : p0 + p1 + p7 + p1062 + p1064 + p1067 + p1068 = 1
inv : p0 + p1 + p7 + p1429 + p1431 + p1487 + p1492 = 1
inv : p0 + p1 + p7 + p1660 + p1661 + p1704 + p1707 + p1711 + p1712 = 1
inv : p0 + p1 + p7 + p2202 + p2244 + p2249 + p2250 = 1
inv : p0 + p1 + p2975 + p2987 + p2992 + p2993 = 1
inv : p0 + p1 + p7 + p629 + p633 = 1
inv : p0 + p1 + p2975 + p2976 + p2977 + p2979 = 1
inv : p0 + p1 + p7 + p1961 + p1966 = 1
inv : p0 + p1 + p2756 + p2759 + p2760 = 1
inv : p0 + p1 + p7 + p1429 + p1431 + p1465 + p1470 = 1
inv : p0 + p1 + p7 + p530 + p533 + p534 = 1
inv : p0 + p1 + p7 + p1748 + p1751 + p1752 = 1
inv : p0 + p1 + p7 + p1795 + p1800 = 1
inv : p0 + p1 + p7 + p1429 + p1431 + p1440 + p1445 + p1446 = 1
inv : p0 + p1 + p7 + p1352 + p1353 + p1363 + p1366 + p1367 = 1
inv : p0 + p1 + p7 + p359 + p361 = 1
inv : p0 + p1 + p7 + p794 + p799 = 1
inv : p0 + p1 + p7 + p1123 + p1128 + p1132 + p1135 + p1136 = 1
inv : p0 + p1 + p7 + p1619 + p1624 = 1
inv : p0 + p1 + p7 + p369 + p372 + p373 = 1
inv : p0 + p1 + p7 + p1594 + p1597 + p1598 = 1
inv : p0 + p1 + p7 + p2358 + p2364 + p2367 + p2368 = 1
inv : p0 + p1 + p7 + p1429 + p1431 + p1437 + p1439 = 1
inv : p0 + p1 + p7 + p1660 + p1661 + p1671 + p1676 + p1677 = 1
inv : p0 + p1 + p7 + p1909 + p1914 + p1915 = 1
inv : p0 + p1 + p7 + p131 + p136 + p137 = 1
inv : p0 + p1 + p7 + p101 + p106 = 1
inv : p0 + p1 + p7 + p1052 + p1054 = 1
inv : p0 + p1 + p7 + p593 + p596 + p597 = 1
inv : p0 + p1 + p7 + p695 + p700 = 1
inv : p0 + p1 + p7 + p2140 + p2143 + p2144 = 1
inv : p0 + p1 + p7 + p2147 + p2152 + p2153 = 1
inv : p0 + p1 + p2928 + p2933 = 1
inv : p0 + p1 + p7 + p883 + p888 = 1
inv : p0 + p1 + p7 + p600 + p605 + p606 = 1
inv : p0 + p1 + p7 + p2301 + p2304 + p2305 = 1
inv : p0 + p1 + p7 + p1352 + p1353 + p1422 + p1427 = 1
inv : p0 + p1 + p7 + p1986 + p1989 + p1990 = 1
inv : p0 + p1 + p7 + p1123 + p1175 + p1179 + p1184 = 1
inv : p0 + p1 + p7 + p310 + p315 = 1
inv : p0 + p1 + p7 + p255 + p260 = 1
inv : p0 + p1 + p7 + p1993 + p1998 + p1999 = 1
inv : p0 + p1 + p7 + p2346 + p2351 = 1
inv : p0 + p1 + p2900 + p2902 = 1
inv : p0 + p1 + p2840 + p2845 + p2846 = 1
inv : p0 + p1 + p7 + p2430 + p2431 + p2488 + p2493 = 1
inv : p0 + p1 + p7 + p667 + p669 = 1
inv : p0 + p1 + p2833 + p2836 + p2837 = 1
inv : p0 + p1 + p7 + p1300 + p1303 + p1304 = 1
inv : p0 + p1 + p7 + p2358 + p2371 + p2376 + p2377 = 1
inv : p0 + p1 + p7 + p1352 + p1353 + p1370 + p1375 + p1376 = 1
inv : p0 + p1 + p2833 + p2838 + p2839 = 1
inv : p0 + p1 + p7 + p1429 + p1431 + p1447 + p1450 + p1451 = 1
inv : p0 + p1 + p7 + p1123 + p1146 + p1151 + p1152 = 1
inv : p0 + p1 + p7 + p1322 + p1326 = 1
inv : p0 + p1 + p7 + p208 + p213 + p214 = 1
inv : p0 + p1 + p7 + p747 + p750 + p751 = 1
inv : p0 + p1 + p7 + p704 + p709 + p710 = 1
inv : p0 + p1 + p7 + p1770 + p1773 + p1775 + p1778 = 1
inv : p0 + p1 + p7 + p1591 + p1593 = 1
inv : p0 + p1 + p7 + p1633 + p1634 = 1
inv : p0 + p1 + p7 + p523 + p528 + p529 = 1
inv : p0 + p1 + p7 + p975 + p977 = 1
inv : p0 + p1 + p7 + p1762 + p1767 + p1768 = 1
inv : p0 + p1 + p3016 + p3020 = 1
inv : p0 + p3054 + p3056 = 1
inv : p0 + p1 + p7 + p156 + p161 = 1
inv : p0 + p1 + p7 + p2430 + p2431 + p2466 + p2471 = 1
inv : p0 + p1 + p7 + p2507 + p2532 + p2535 + p2536 = 1
inv : p0 + p1 + p2975 + p2976 + p2980 + p2983 + p2984 = 1
inv : p0 + p1 + p7 + p1209 + p1212 + p1213 = 1
inv : p0 + p1 + p7 + p2133 + p2138 + p2139 = 1
inv : p0 + p1 + p7 + p893 + p894 + p908 + p913 + p914 = 1
inv : p0 + p1 + p2873 + p2878 = 1
inv : p0 + p1 + p2848 + p2851 + p2852 + p2856 = 1
inv : p0 + p1 + p2686 + p2689 + p2690 = 1
inv : p0 + p1 + p7 + p436 + p438 = 1
inv : p0 + p1 + p7 + p439 + p444 + p445 = 1
inv : p0 + p1 + p7 + p806 + p811 = 1
inv : p0 + p1 + p2679 + p2684 + p2685 = 1
inv : p0 + p1 + p7 + p446 + p449 + p450 = 1
inv : p0 + p1 + p7 + p1293 + p1296 + p1297 = 1
inv : p0 + p1 + p2763 + p2768 + p2769 = 1
inv : p0 + p1 + p7 + p1352 + p1353 + p1388 + p1393 = 1
inv : p0 + p1 + p7 + p318 + p321 + p325 + p327 = 1
inv : p0 + p1 + p7 + p1784 + p1788 = 1
inv : p0 + p1 + p2731 + p2736 = 1
inv : p0 + p1 + p7 + p1300 + p1305 + p1306 = 1
inv : p0 + p1 + p7 + p138 + p143 + p144 = 1
inv : p0 + p1 + p2749 + p2754 + p2755 = 1
inv : p0 + p1 + p2628 + p2631 + p2634 + p2635 + p2636 = 1
inv : p0 + p1 + p7 + p453 + p458 + p459 = 1
inv : p0 + p1 + p2672 + p2675 + p2676 = 1
inv : p0 + p1 + p7 + p2507 + p2518 + p2521 + p2522 = 1
inv : p0 + p1 + p7 + p2507 + p2525 + p2530 + p2531 = 1
inv : p0 + p1 + p7 + p2257 + p2262 = 1
inv : p0 + p1 + p7 + p215 + p218 + p219 = 1
inv : p0 + p1 + p7 + p744 + p746 = 1
inv : p0 + p1 + p7 + p1191 + p1196 = 1
inv : p0 + p1 + p7 + p1123 + p1157 + p1162 = 1
inv : p0 + p1 + p2796 + p2801 = 1
inv : p0 + p1 + p7 + p1531 + p1536 + p1537 = 1
inv : p0 + p1 + p7 + p369 + p374 + p375 = 1
inv : p0 + p1 + p7 + p1223 + p1226 + p1227 = 1
inv : p0 + p1 + p7 + p2389 + p2394 = 1
inv : p0 + p1 + p7 + p1660 + p1661 + p1730 + p1735 = 1
inv : p0 + p1 + p7 + p1884 + p1889 = 1
inv : p0 + p1 + p7 + p1111 + p1114 + p1117 + p1119 = 1
inv : p0 + p1 + p7 + p761 + p764 + p765 = 1
inv : p0 + p1 + p7 + p292 + p294 + p295 + p296 = 1
inv : p0 + p1 + p7 + p1003 + p1008 = 1
inv : p0 + p1 + p7 + p1755 + p1758 + p1759 = 1
inv : p0 + p1 + p7 + p128 + p130 = 1
inv : p0 + p1 + p7 + p145 + p148 + p149 = 1
inv : p0 + p1 + p7 + p1429 + p1431 + p1454 + p1459 + p1460 = 1
inv : p0 + p1 + p2592 + p2594 = 1
inv : p0 + p1 + p7 + p541 + p546 = 1
inv : p0 + p1 + p2917 + p2922 + p2923 = 1
inv : p0 + p1 + p2962 + p2967 = 1
inv : p0 + p1 + p7 + p1832 + p1835 + p1836 = 1
inv : p0 + p1 + p7 + p1352 + p1353 + p1360 + p1362 = 1
inv : p0 + p1 + p7 + p2323 + p2327 = 1
inv : p0 + p1 + p7 + p398 + p402 = 1
inv : p0 + p1 + p7 + p2111 + p2115 + p2120 = 1
inv : p0 + p1 + p7 + p498 + p503 = 1
inv : p0 + p1 + p7 + p1256 + p1261 = 1
inv : p0 + p1 + p2903 + p2908 + p2909 = 1
inv : p0 + p1 + p7 + p978 + p983 + p984 = 1
inv : p0 + p1 + p7 + p1979 + p1984 + p1985 = 1
inv : p0 + p1 + p7 + p677 + p680 + p681 = 1
inv : p0 + p1 + p7 + p2103 + p2108 = 1
inv : p0 + p1 + p7 + p2287 + p2290 + p2291 = 1
inv : p0 + p1 + p7 + p1517 + p1522 + p1523 = 1
inv : p0 + p1 + p7 + p1216 + p1221 + p1222 = 1
inv : p0 + p1 + p7 + p563 + p564 + p568 = 1
inv : p0 + p1 + p7 + p2294 + p2299 + p2300 = 1
inv : p0 + p1 + p7 + p2202 + p2203 + p2235 + p2240 = 1
inv : p0 + p1 + p7 + p2358 + p2361 + p2363 = 1
inv : p0 + p1 + p7 + p362 + p363 + p367 + p368 = 1
inv : p0 + p1 + p7 + p516 + p518 + p519 + p520 = 1
inv : p0 + p1 + p7 + p2430 + p2431 + p2441 + p2446 + p2447 = 1
inv : p0 + p1 + p7 + p824 + p829 + p830 = 1
inv : p0 + p1 + p7 + p2026 + p2031 = 1
inv : p0 + p1 + p7 + p1660 + p1661 + p1668 + p1670 = 1
inv : p0 + p1 + p7 + p61 + p64 + p65 = 1
inv : p0 + p1 + p7 + p68 + p73 + p74 = 1
inv : p0 + p1 + p7 + p332 + p337 = 1
inv : p0 + p1 + p7 + p2284 + p2286 = 1
inv : p0 + p3064 + p3069 = 1
inv : p0 + p1 + p7 + p1352 + p1353 + p1377 + p1380 + p1381 = 1
inv : p0 + p1 + p7 + p1553 + p1557 = 1
inv : p0 + p3116 + p3121 = 1
inv : p0 + p1 + p2654 + p2659 = 1
inv : p0 + p1 + p7 + p1286 + p1291 + p1292 = 1
inv : p0 + p1 + p7 + p1429 + p1499 + p1503 + p1504 = 1
inv : p0 + p1 + p7 + p2312 + p2317 = 1
inv : p0 + p1 + p7 + p2202 + p2203 + p2207 + p2209 = 1
inv : p0 + p1 + p2620 + p2625 = 1
inv : p0 + p1 + p7 + p992 + p995 + p996 = 1
inv : p0 + p1 + p2708 + p2712 = 1
inv : p0 + p1 + p7 + p486 + p491 = 1
inv : p0 + p1 + p7 + p677 + p682 + p683 = 1
inv : p0 + p1 + p7 + p1062 + p1064 + p1065 + p1066 = 1
inv : p0 + p1 + p2595 + p2597 + p2598 + p2599 = 1
inv : p0 + p1 + p7 + p409 + p414 = 1
inv : p0 + p1 + p7 + p618 + p623 = 1
inv : p0 + p1 + p2774 + p2779 = 1
inv : p0 + p1 + p7 + p978 + p981 + p982 = 1
inv : p0 + p1 + p7 + p783 + p787 = 1
inv : p0 + p1 + p7 + p1839 + p1844 + p1845 = 1
inv : p0 + p1 + p2910 + p2913 + p2914 = 1
inv : p0 + p1 + p7 + p40 + p42 = 1
inv : p0 + p1 + p7 + p1102 + p1107 = 1
inv : p0 + p1 + p7 + p1938 + p1940 + p1941 + p1942 = 1
inv : p0 + p1 + p7 + p54 + p57 + p58 = 1
inv : p0 + p1 + p7 + p2358 + p2364 + p2369 + p2370 = 1
inv : p0 + p1 + p7 + p948 + p953 = 1
inv : p0 + p1 + p7 + p1055 + p1060 + p1061 = 1
inv : p0 + p1 + p7 + p2507 + p2565 + p2570 = 1
inv : p0 + p1 + p7 + p607 + p612 + p613 = 1
inv : p0 + p1 + p7 + p1927 + p1932 = 1
inv : p0 + p1 + p7 + p838 + p843 + p844 = 1
inv : p0 + p1 + p7 + p1660 + p1661 + p1671 + p1674 + p1675 = 1
inv : p0 + p1 + p7 + p2049 + p2070 + p2073 + p2074 = 1
inv : p0 + p1 + p7 + p1352 + p1353 + p1406 + p1410 + p1415 + p1416 = 1
inv : p0 + p1 + p2994 + p2999 + p3000 = 1
inv : p0 + p1 + p7 + p1986 + p1991 + p1992 = 1
inv : p0 + p1 + p7 + p2358 + p2378 + p2383 + p2384 = 1
inv : p0 + p1 + p7 + p1123 + p1139 + p1141 + p1144 + p1145 = 1
inv : p0 + p1 + p2602 + p2605 + p2606 = 1
inv : p0 + p1 + p7 + p2301 + p2306 + p2307 = 1
inv : p0 + p1 + p7 + p1033 + p1037 + p1042 = 1
inv : p0 + p3074 + p3075 = 1
inv : p0 + p1 + p2609 + p2614 + p2615 = 1
inv : p0 + p1 + p7 + p281 + p282 + p283 + p284 = 1
inv : p0 + p1 + p7 + p2358 + p2371 + p2374 + p2375 = 1
inv : p0 + p1 + p7 + p640 + p644 + p645 = 1
inv : p0 + p1 + p2975 + p2987 + p2990 + p2991 = 1
inv : p0 + p1 + p7 + p131 + p134 + p135 = 1
inv : p0 + p1 + p7 + p2430 + p2431 + p2500 + p2505 = 1
inv : p0 + p1 + p7 + p1601 + p1602 + p1606 + p1607 = 1
inv : p0 + p1 + p7 + p575 + p576 + p580 = 1
inv : p0 + p1 + p7 + p113 + p118 = 1
inv : p0 + p1 + p7 + p2038 + p2043 = 1
inv : p0 + p1 + p3039 + p3044 = 1
inv : p0 + p1 + p7 + p1909 + p1912 + p1913 = 1
inv : p0 + p1 + p7 + p1244 + p1245 + p1249 = 1
inv : p0 + p1 + p7 + p1916 + p1921 + p1922 = 1
inv : p0 + p1 + p7 + p1976 + p1978 = 1
inv : p0 + p1 + p7 + p593 + p598 + p599 = 1
inv : p0 + p1 + p7 + p1080 + p1084 + p1085 = 1
inv : p0 + p1 + p7 + p871 + p876 = 1
inv : p0 + p1 + p7 + p178 + p183 = 1
inv : p0 + p1 + p7 + p1850 + p1855 = 1
inv : p0 + p1 + p7 + p2202 + p2203 + p2217 + p2222 + p2223 = 1
inv : p0 + p1 + p7 + p590 + p592 = 1
inv : p0 + p1 + p7 + p893 + p894 + p901 + p904 + p905 = 1
inv : p0 + p1 + p7 + p2400 + p2403 + p2404 = 1
inv : p0 + p1 + p7 + p205 + p207 = 1
inv : p0 + p1 + p7 + p1531 + p1534 + p1535 = 1
inv : p0 + p1 + p7 + p244 + p248 = 1
inv : p0 + p1 + p7 + p2202 + p2203 + p2210 + p2213 + p2214 = 1
inv : p0 + p1 + p7 + p2430 + p2431 + p2477 + p2481 = 1
inv : p0 + p1 + p7 + p2430 + p2431 + p2455 + p2460 + p2461 = 1
inv : p0 + p1 + p7 + p2004 + p2009 = 1
inv : p0 + p1 + p7 + p670 + p673 + p674 = 1
inv : p0 + p1 + p2716 + p2719 + p2720 + p2724 = 1
inv : p0 + p1 + p7 + p299 + p302 + p303 = 1
inv : p0 + p1 + p2885 + p2890 = 1
inv : p0 + p1 + p2826 + p2829 + p2830 = 1
inv : p0 + p1 + p7 + p376 + p379 + p380 = 1
inv : p0 + p1 + p7 + p893 + p894 + p915 + p918 + p919 = 1
inv : p0 + p1 + p7 + p761 + p766 + p767 = 1
inv : p0 + p1 + p7 + p652 + p657 = 1
inv : p0 + p1 + p7 + p2202 + p2203 + p2224 + p2227 + p2228 = 1
inv : p0 + p1 + p7 + p1993 + p1996 + p1997 = 1
inv : p0 + p1 + p2840 + p2843 + p2844 = 1
inv : p0 + p1 + p7 + p831 + p834 + p835 = 1
inv : p0 + p1 + p7 + p1660 + p1661 + p1685 + p1688 + p1689 = 1
inv : p0 + p1 + p7 + p1123 + p1146 + p1149 + p1150 = 1
inv : p0 + p1 + p7 + p1329 + p1333 + p1338 = 1
inv : p0 + p1 + p7 + p2430 + p2431 + p2438 + p2440 = 1
inv : p0 + p1 + p7 + p222 + p223 + p225 + p226 = 1
inv : p0 + p1 + p7 + p957 + p960 + p961 + p965 = 1
inv : p0 + p1 + p2939 + p2943 = 1
inv : p0 + p1 + p2756 + p2761 + p2762 = 1
inv : p0 + p1 + p7 + p2147 + p2150 + p2151 = 1
inv : p0 + p1 + p7 + p600 + p603 + p604 = 1
inv : p0 + p1 + p7 + p464 + p469 = 1
inv : p0 + p1 + p7 + p1123 + p1128 + p1132 + p1137 + p1138 = 1
inv : p0 + p1 + p7 + p1949 + p1954 = 1
inv : p0 + p1 + p7 + p90 + p94 = 1
inv : p0 + p1 + p7 + p2049 + p2056 + p2059 + p2060 = 1
inv : p0 + p1 + p7 + p2430 + p2431 + p2448 + p2450 + p2451 + p2452 = 1
inv : p0 + p1 + p7 + p893 + p894 + p898 + p900 = 1
inv : p0 + p1 + p7 + p1902 + p1907 + p1908 = 1
inv : p0 + p1 + p7 + p208 + p211 + p212 = 1
inv : p0 + p1 + p7 + p523 + p526 + p527 = 1
inv : p0 + p1 + p7 + p2049 + p2063 + p2068 + p2069 = 1
inv : p0 + p1 + p7 + p2192 + p2197 = 1
inv : p0 + p1 + p7 + p1748 + p1753 + p1754 = 1
inv : p0 + p1 + p7 + p281 + p285 + p288 + p289 = 1
inv : p0 + p1 + p7 + p1807 + p1812 = 1
inv : p0 + p1 + p7 + p530 + p535 + p536 = 1
inv : p0 + p1 + p7 + p1825 + p1827 + p1830 + p1831 = 1
inv : p0 + p1 + p7 + p215 + p220 + p221 = 1
inv : p0 + p1 + p7 + p1429 + p1431 + p1476 + p1480 = 1
inv : p0 + p1 + p7 + p1025 + p1030 = 1
inv : p0 + p1 + p2808 + p2813 = 1
inv : p0 + p3093 + p3097 = 1
inv : p0 + p1 + p2749 + p2752 + p2753 = 1
inv : p0 + p1 + p7 + p1660 + p1661 + p1678 + p1679 + p1683 + p1684 = 1
Total of 438 invariants.
[2022-06-12 23:43:26] [INFO ] Computed 438 place invariants in 16 ms
[2022-06-12 23:43:27] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-09(UNSAT) depth K=3 took 1323 ms
[2022-06-12 23:43:28] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-11(UNSAT) depth K=3 took 573 ms
[2022-06-12 23:43:28] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-12(UNSAT) depth K=3 took 625 ms
[2022-06-12 23:43:29] [INFO ] Proved 1072 variables to be positive in 2653 ms
[2022-06-12 23:43:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-040B-ReachabilityCardinality-09
[2022-06-12 23:43:29] [INFO ] KInduction solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-09(SAT) depth K=0 took 158 ms
[2022-06-12 23:43:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-040B-ReachabilityCardinality-11
[2022-06-12 23:43:29] [INFO ] KInduction solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-11(SAT) depth K=0 took 231 ms
[2022-06-12 23:43:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-040B-ReachabilityCardinality-12
[2022-06-12 23:43:29] [INFO ] KInduction solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-12(SAT) depth K=0 took 260 ms
[2022-06-12 23:43:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-040B-ReachabilityCardinality-09
[2022-06-12 23:43:30] [INFO ] KInduction solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-09(SAT) depth K=1 took 1080 ms
[2022-06-12 23:43:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-040B-ReachabilityCardinality-11
[2022-06-12 23:43:32] [INFO ] KInduction solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-11(SAT) depth K=1 took 1154 ms
[2022-06-12 23:43:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-040B-ReachabilityCardinality-12
[2022-06-12 23:43:32] [INFO ] KInduction solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-12(SAT) depth K=1 took 420 ms
Compilation finished in 6903 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16848085107629749183]
Link finished in 63 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, ShieldPPPtPT040BReachabilityCardinality09==true], workingDir=/tmp/ltsmin16848085107629749183]
[2022-06-12 23:44:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-040B-ReachabilityCardinality-09
[2022-06-12 23:44:05] [INFO ] KInduction solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-09(SAT) depth K=2 took 33265 ms
[2022-06-12 23:44:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-040B-ReachabilityCardinality-11
[2022-06-12 23:44:45] [INFO ] KInduction solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-11(SAT) depth K=2 took 39927 ms
[2022-06-12 23:45:36] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-09(UNSAT) depth K=4 took 127138 ms
[2022-06-12 23:46:19] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-11(UNSAT) depth K=4 took 43838 ms
[2022-06-12 23:55:47] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-12(UNSAT) depth K=4 took 567401 ms
[2022-06-13 00:00:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-040B-ReachabilityCardinality-12
[2022-06-13 00:00:33] [INFO ] KInduction solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-12(SAT) depth K=2 took 948049 ms
WARNING : LTSmin timed out (>1200 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, ShieldPPPtPT040BReachabilityCardinality09==true], workingDir=/tmp/ltsmin16848085107629749183]
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, ShieldPPPtPT040BReachabilityCardinality11==true], workingDir=/tmp/ltsmin16848085107629749183]
Detected timeout of ITS tools.
[2022-06-13 00:09:44] [INFO ] Applying decomposition
[2022-06-13 00:09:45] [INFO ] Flatten gal took : 145 ms
[2022-06-13 00:09:45] [INFO ] Decomposing Gal with order
[2022-06-13 00:09:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:09:45] [INFO ] Removed a total of 543 redundant transitions.
[2022-06-13 00:09:46] [INFO ] Flatten gal took : 168 ms
[2022-06-13 00:09:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 84 ms.
[2022-06-13 00:09:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10864471669865143965.gal : 56 ms
[2022-06-13 00:09:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9439708957133633339.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/ReachabilityCardinality10864471669865143965.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9439708957133633339.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/ReachabilityCardinality10864471669865143965.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9439708957133633339.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9439708957133633339.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1025
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1025 after 2561
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :3.4455e+06 after 1.20724e+07
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.20724e+07 after 2.03392e+07
[2022-06-13 00:15:11] [INFO ] BMC solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-09(UNSAT) depth K=5 took 1163835 ms
[2022-06-13 00:17:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-040B-ReachabilityCardinality-09
[2022-06-13 00:17:09] [INFO ] KInduction solution for property ShieldPPPt-PT-040B-ReachabilityCardinality-09(SAT) depth K=3 took 995409 ms
WARNING : LTSmin timed out (>1200 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, ShieldPPPtPT040BReachabilityCardinality11==true], workingDir=/tmp/ltsmin16848085107629749183]
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, ShieldPPPtPT040BReachabilityCardinality12==true], workingDir=/tmp/ltsmin16848085107629749183]

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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ShieldPPPt-PT-040B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldPPPt-PT-040B, examination is ReachabilityCardinality"
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-165286037400251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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